Methods › Graphs › Graph Representation Learning › APPNP
Approximation of Personalized Propagation of Neural Predictions
APPNP
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.
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.
-
LightGCN: Evaluated and Enhanced 17 Dec 2023 · 1 repository · arXiv:2312.16183
-
Understanding and Improving Deep Graph Neural Networks: A Probabilistic Graphical Model Perspective 25 Jan 2023 · 0 repositories · arXiv:2301.10536
-
Beyond Graph Convolutional Network: An Interpretable Regularizer-centered Optimization Framework 11 Jan 2023 · 0 repositories · arXiv:2301.04318
-
MGDCF: Distance Learning via Markov Graph Diffusion for Neural Collaborative Filtering 5 Apr 2022 · 2 repositories · arXiv:2204.02338
-
Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework 4 Mar 2021 · 1 repository · arXiv:2103.02885Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified (of 3 harvested samples) · 3 pointer-only (licence)
-
On the Equivalence of Decoupled Graph Convolution Network and Label Propagation 23 Oct 2020 · 1 repository · arXiv:2010.12408Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 4 harvested samples)
-
A Unified View on Graph Neural Networks as Graph Signal Denoising 5 Oct 2020 · 1 repository · arXiv:2010.01777Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample) · 1 pointer-only (licence)
-
Tackling Over-Smoothing for General Graph Convolutional Networks 22 Aug 2020 · 0 repositories · arXiv:2008.09864
-
Predict then Propagate: Graph Neural Networks meet Personalized PageRank 14 Oct 2018 · 5 repositories · arXiv:1810.05997Syntology official (archive's flag): 11 ran · 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)
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.
Usage over time archive 2025-07-28
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
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