{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/appnp","slug":"appnp","name":"APPNP","full_name":"Approximation of Personalized Propagation of Neural Predictions","full_name_withheld":false,"description_markdown":"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.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","paper":"/paper/predict-then-propagate-graph-neural-networks","first_author":"Johannes Gasteiger","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/predict-then-propagate-graph-neural-networks"},"source":{"url":"https://arxiv.org/abs/1810.05997v6","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Representation Learning","url":"/methods/category/graph-representation-learning","pwc_aliases":[]}],"n_papers_tagged":9,"archive_num_papers":9,"papers_newest_first":[{"paper":"/paper/lightgcn-evaluated-and-enhanced","slug":"lightgcn-evaluated-and-enhanced","title":"LightGCN: Evaluated and Enhanced","date":"2023-12-17","arxiv_id":"2312.16183","n_code_links":1,"syntology":null},{"paper":null,"slug":"understanding-and-improving-deep-graph-neural","title":"Understanding and Improving Deep Graph Neural Networks: A Probabilistic Graphical Model Perspective","date":"2023-01-25","arxiv_id":"2301.10536","n_code_links":0,"syntology":null},{"paper":null,"slug":"beyond-graph-convolutional-network-an","title":"Beyond Graph Convolutional Network: An Interpretable Regularizer-centered Optimization Framework","date":"2023-01-11","arxiv_id":"2301.04318","n_code_links":0,"syntology":null},{"paper":"/paper/mgdcf-distance-learning-via-markov-graph","slug":"mgdcf-distance-learning-via-markov-graph","title":"MGDCF: Distance Learning via Markov Graph Diffusion for Neural Collaborative Filtering","date":"2022-04-05","arxiv_id":"2204.02338","n_code_links":2,"syntology":null},{"paper":"/paper/extract-the-knowledge-of-graph-neural","slug":"extract-the-knowledge-of-graph-neural","title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","date":"2021-03-04","arxiv_id":"2103.02885","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":0,"n_instrument":2,"unverified":1,"pointer_only":3,"phrase":"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","official":{"repos":["BUPT-GAMMA/CPF"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/on-the-equivalence-of-decoupled-graph","slug":"on-the-equivalence-of-decoupled-graph","title":"On the Equivalence of Decoupled Graph Convolution Network and Label Propagation","date":"2020-10-23","arxiv_id":"2010.12408","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"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","official":{"repos":["DongHande/PT_propagation_then_training"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/a-unified-view-on-graph-neural-networks-as-1","slug":"a-unified-view-on-graph-neural-networks-as-1","title":"A Unified View on Graph Neural Networks as Graph Signal Denoising","date":"2020-10-05","arxiv_id":"2010.01777","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"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","official":{"repos":["alge24/ADA-UGNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"rethinking-and-relieving-over-smoothing-in","title":"Tackling Over-Smoothing for General Graph Convolutional Networks","date":"2020-08-22","arxiv_id":"2008.09864","n_code_links":0,"syntology":null},{"paper":"/paper/predict-then-propagate-graph-neural-networks","slug":"predict-then-propagate-graph-neural-networks","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","date":"2018-10-14","arxiv_id":"1810.05997","n_code_links":5,"syntology":{"ran":11,"of":12,"n_ran_checked":10,"n_instrument":1,"unverified":1,"pointer_only":1,"phrase":"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","official":{"repos":["klicperajo/ppnp"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}}],"papers_shown":9,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":9,"with_a_code_link":6,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":9,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":4,"papers_where_code_ran_first_page":"/method/appnp/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/appnp/papers/ran/1","json":"/method/appnp/papers/ran/1.json","rows":4}],"tasks":[{"task":"/task/node-classification","name":"Node Classification","papers":4},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":2},{"task":"/task/recommendation-systems","name":"Recommendation Systems","papers":2},{"task":"/task/representation-learning","name":"Representation Learning","papers":2},{"task":"/task/collaborative-filtering","name":"Collaborative Filtering","papers":1},{"task":"/task/denoising","name":"Denoising","papers":1},{"task":"/task/classification","name":"General Classification","papers":1},{"task":"/task/graph-classification","name":"Graph Classification","papers":1},{"task":"/task/graph-representation-learning","name":"Graph Representation Learning","papers":1},{"task":"/task/knowledge-distillation","name":"Knowledge Distillation","papers":1},{"task":"/task/multi-modal-recommendation","name":"Multi-modal Recommendation","papers":1},{"task":"/task/node-classification-on-non-homophilic","name":"Node Classification on Non-Homophilic (Heterophilic) Graphs","papers":1},{"task":"/task/pseudo-label","name":"Pseudo Label","papers":1},{"task":"/task/variational-inference","name":"Variational Inference","papers":1}],"tasks_shown":14,"n_tasks":14,"usage_by_year":[{"year":"2018","papers":1},{"year":"2020","papers":3},{"year":"2021","papers":1},{"year":"2022","papers":1},{"year":"2023","papers":3}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/appnp"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=APPNP","read_at":"2026-10-05T00:52:31+00:00","query":"APPNP","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"APPNP","origin_arxiv_id":"1810.05997"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"1810.05997","repositories":{"listed":4,"in_graph":4,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"1810.05997","citations":null},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'APPNP'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"1810.05997","page":"/paper/predict-then-propagate-graph-neural-networks","syntology_url":"https://syntology.ai/paper/1810.05997","in_graph_layer":true,"samples":12,"ran":11,"n_ran_checked":10,"n_instrument":1,"unverified":1,"phrase":"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","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"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.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"65ce3bf1896f0d70285c7024341cf63c4cee3b5ba948ceb3f694598a1856be89","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}