{"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/improvements-on-uncertainty-quantification","title":"Improvements on Uncertainty Quantification for Node Classification via Distance-Based Regularization","arxiv_id":"2311.05795","date":"2023-11-10","proceeding":null,"authors":["Russell Alan Hart","Linlin Yu","Yifei Lou","Feng Chen"],"abstract":"Deep neural networks have achieved significant success in the last decades, but they are not well-calibrated and often produce unreliable predictions. A large number of literature relies on uncertainty quantification to evaluate the reliability of a learning model, which is particularly important for applications of out-of-distribution (OOD) detection and misclassification detection. We are interested in uncertainty quantification for interdependent node-level classification. We start our analysis based on graph posterior networks (GPNs) that optimize the uncertainty cross-entropy (UCE)-based loss function. We describe the theoretical limitations of the widely-used UCE loss. To alleviate the identified drawbacks, we propose a distance-based regularization that encourages clustered OOD nodes to remain clustered in the latent space. We conduct extensive comparison experiments on eight standard datasets and demonstrate that the proposed regularization outperforms the state-of-the-art in both OOD detection and misclassification detection.","url_abs":"https://arxiv.org/abs/2311.05795v1","url_pdf":"https://arxiv.org/pdf/2311.05795v1.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":"improvements-on-uncertainty-quantification","repo_url":"https://github.com/neoques/graph-posterior-network","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"ood-detection","task_name":"Out of Distribution (OOD) Detection"},{"task_slug":"uncertainty-quantification","task_name":"Uncertainty Quantification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2311.05795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.05795"}},"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"}}],"summary":{"ran":4},"by_repo_kind":{"official":{"samples":4,"ran":4,"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":"neoques/graph-posterior-network","repo_kind":"official","path":"gpn/layers/bayesian.py","file_url":"https://github.com/neoques/graph-posterior-network/blob/HEAD/gpn/layers/bayesian.py","link_basis":"first_harvest_node","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":"9d29290e613909a7","entry":"get_df","repo":"neoques/graph-posterior-network","repo_kind":"official","path":"generate_all_figs.py","file_url":"https://github.com/neoques/graph-posterior-network/blob/HEAD/generate_all_figs.py","link_basis":"first_harvest_node","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":"9d29290e613909a7"}},{"code_sha256_prefix":"931b17fe71a65ea4","entry":"get_sigma","repo":"neoques/graph-posterior-network","repo_kind":"official","path":"gpn/layers/bayesian.py","file_url":"https://github.com/neoques/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":"neoques/graph-posterior-network","repo_kind":"official","path":"gpn/layers/bayesian.py","file_url":"https://github.com/neoques/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"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}