Methods › Graphs › Graph Representation Learning › APPNP

Approximation of Personalized Propagation of Neural Predictions

APPNP

9 papers tagged archive 2025-07-28

Introduced by Johannes Gasteiger et al. in Predict then Propagate: Graph Neural Networks meet Personalized PageRank

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Neural message-passing algorithms for semi-supervised classification on graphs have recently achieved great success. However, for classifying a node these methods only consider nodes that are a few propagation steps away and the size of this utilized neighbourhood is hard to extend. This paper uses the relationship between graph convolutional networks (GCN) and PageRank to derive an improved propagation scheme based on personalized PageRank. We utilize this propagation procedure to construct a simple model, personalized propagation of neural predictions (PPNP), and its fast approximation, APPNP. Our model's training time is on par or faster and its number of parameters is on par or lower than previous models. It leverages a large, adjustable neighbourhood for classification and can be easily combined with any neural network. We show that this model outperforms several recently proposed methods for semi-supervised classification in the most thorough study done so far for GCN-like models.

PaperSource

In Syntology repository known, no verified implementation (declared_code; repositories: 4 listed of 4 in the graph, strongest link: official). This answer is about arXiv:1810.05997, the paper the archive credits with this method.

Origin paper of this answer, arXiv:1810.05997 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified (of 12 harvested samples) · 1 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 9 · with a code link: 6 · where Syntology ran a sample: 4 (2 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (4 of 9 tagged: 2 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 9 of 9, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

14 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Node Classification4
Graph Neural Network2
Recommendation Systems2
Representation Learning2
Collaborative Filtering1
Denoising1
General Classification1
Graph Classification1
Graph Representation Learning1
Knowledge Distillation1
Multi-modal Recommendation1
Node Classification on Non-Homophilic (Heterophilic) Graphs1
Pseudo Label1
Variational Inference1

Usage over time archive 2025-07-28

Papers per year tagged with APPNP: 2018 to 2023, peak 3 3 0 2018: 1 paper 2018 2019: 0 papers 2019 2020: 3 papers 2020 2021: 1 paper 2021 2022: 1 paper 2022 2023: 3 papers 2023
Papers per year the archive tags with this method, by the paper's archive date (9 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Graph Representation Learning

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections