Local Evidence and Geometric Readout Repair in Trained GNNs
Not on the map. Why?
Abstract (arXiv)
Many node-classification GNNs apply a linear classifier to a nonnegative mixture of local messages. An error can reflect either poor mixture weights or a reachable logit set poorly positioned for the classifier. We separate these causes with an exact-mass linear program and two learned post-hoc repairs. Every reweighted prediction has an equivalent centered logit translation, but only translations in a message-induced displacement set are realizable by reweighting. Across eight datasets, eight GNN backbones, and ten splits, mean accuracy rises from 62.6% for the frozen models to 63.8% with reweighting and 65.3% with set-conditioned translation. A parameter-matched node-only translator reaches 64.6%, showing that translation explains most of the gain while the message set supplies a smaller additional benefit. Although oracle reweighting can correct many errors, label-free reweighting captures little of this potential: local evidence is often present but hard to select, and relaxing the evidence constraint is more effective than learning within it.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 29 of its 35 references that are in the map. First posted on arXiv 22 Sep 2026.
Builds on
29 of 35 references.
References · 29
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2021Convex optimizationcited by 2,479
- 2019Simplifying Graph Convolutional Networkscited by 1,470
- 2017Deep Setscited by 1,394
- 2018Pitfalls of Graph Neural Network Evaluationcited by 994
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
17 more
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
- 2018Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networkscited by 878
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
- 2021How Attentive are Graph Attention Networks?cited by 818
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
- 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 442
- 2020Parameterized Explainer for Graph Neural Networkcited by 423
- 2019Diffusion Improves Graph Learningcited by 414
- 2016From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classificationcited by 337
- 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 332
- 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 309
- 2017Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphscited by 307
- 2020Combining Label Propagation and Simple Models Out-performs Graph Neural Networkscited by 199
- 2021CF-GNNExplainer: Counterfactual Explanations for Graph Neural Networkscited by 118
- 2019GNN-FiLM: Graph Neural Networks with Feature-wise Linear Modulationcited by 75
- 2022What Makes Graph Neural Networks Miscalibrated?cited by 39
- 2017A Regularized Framework for Sparse and Structured Neural Attentioncited by 38
Built on by
Not cited yet.