{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/graph-posterior-network-bayesian-predictive","title":"Graph Posterior Network: Bayesian Predictive Uncertainty for Node Classification","arxiv_id":"2110.14012","date":"2021-10-26","proceeding":"NeurIPS 2021 12","authors":["Maximilian Stadler","Bertrand Charpentier","Simon Geisler","Daniel Zügner","Stephan Günnemann"],"abstract":"The interdependence between nodes in graphs is key to improve class predictions on nodes and utilized in approaches like Label Propagation (LP) or in Graph Neural Networks (GNN). Nonetheless, uncertainty estimation for non-independent node-level predictions is under-explored. In this work, we explore uncertainty quantification for node classification in three ways: (1) We derive three axioms explicitly characterizing the expected predictive uncertainty behavior in homophilic attributed graphs. (2) We propose a new model Graph Posterior Network (GPN) which explicitly performs Bayesian posterior updates for predictions on interdependent nodes. GPN provably obeys the proposed axioms. (3) We extensively evaluate GPN and a strong set of baselines on semi-supervised node classification including detection of anomalous features, and detection of left-out classes. GPN outperforms existing approaches for uncertainty estimation in the experiments.","url_abs":"https://arxiv.org/abs/2110.14012v1","url_pdf":"https://arxiv.org/pdf/2110.14012v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"graph-posterior-network-bayesian-predictive","repo_url":"https://github.com/stadlmax/Graph-Posterior-Network","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"graph-posterior-network-bayesian-predictive","repo_url":"https://github.com/neoques/graph-posterior-network","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"uncertainty-quantification","task_name":"Uncertainty Quantification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2110.14012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14012"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/neoques/graph-posterior-network","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/stadlmax/Graph-Posterior-Network","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":3,"unverified":1},"by_repo_kind":{"official":{"samples":4,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"7d8580c54cec1ef4","entry":"gaussian_log_prob","repo":"stadlmax/Graph-Posterior-Network","repo_kind":"official","path":"gpn/layers/bayesian.py","file_url":"https://github.com/stadlmax/Graph-Posterior-Network/blob/HEAD/gpn/layers/bayesian.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"7d8580c54cec1ef4"}},{"code_sha256_prefix":"931b17fe71a65ea4","entry":"get_sigma","repo":"stadlmax/Graph-Posterior-Network","repo_kind":"official","path":"gpn/layers/bayesian.py","file_url":"https://github.com/stadlmax/Graph-Posterior-Network/blob/HEAD/gpn/layers/bayesian.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"931b17fe71a65ea4"}},{"code_sha256_prefix":"78c49071964e5ac2","entry":"sample_weight","repo":"stadlmax/Graph-Posterior-Network","repo_kind":"official","path":"gpn/layers/bayesian.py","file_url":"https://github.com/stadlmax/Graph-Posterior-Network/blob/HEAD/gpn/layers/bayesian.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"78c49071964e5ac2"}},{"code_sha256_prefix":"3d16239bbf53cd65","entry":"LinearSequentialLayer","repo":"stadlmax/Graph-Posterior-Network","repo_kind":"official","path":"gpn/layers/linear_sequential.py","file_url":"https://github.com/stadlmax/Graph-Posterior-Network/blob/HEAD/gpn/layers/linear_sequential.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3d16239bbf53cd65"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}