Propagate, Then Sharpen: Post-Hoc Refinement of Frozen Node Classifiers
cs.LG, stat.ML
Submitted: 2026-09-28
Updated: 2026-09-28
Code: https://github.com/Prebenno/Propagate-Then-Sharpen
License: http://creativecommons.org/licenses/by/4.0/
The gist: We study post-hoc refinement of frozen node classifiers: given only the graph G and class distributions Q predicted by a frozen model, can we improve accuracy without access to node features, model
Terminology
Abstract
We study post-hoc refinement of frozen node classifiers: given only the graph G and class distributions Q predicted by a frozen model, can we improve accuracy without access to node features, model parameters, or gradients? APPNP answers this by propagating logits with a restart towards the initial predictions, minimizing the anchored Dirichlet energy. Instead, we consider the Potts energy, and decompose it into a Dirichlet term, which penalizes disagreement between neighbouring nodes, and a Gini term, which penalizes indecision within each node. This decomposition motivates Propagate, Then Sharpen (PtS), which alternates between propagation of class probabilities and node-wise, mass-preserving sharpening, with only one additional hyperparameter selected using labelled validation nodes. Across nine homophilic graphs, with a frozen MLP backbone, PtS improves mean test accuracy over independently tuned APPNP by 1.71 percentage points on clean inputs and 3.90 under severe Gaussian feature corruption. Gains over APPNP become smaller, but remain positive with frozen GCN and GraphSAGE backbones. Sharpening also removes most of the accuracy loss of deep propagation: on clean inputs without restart, accuracy falls by 2.2 points between 2 and 100 propagation steps under PtS, compared with 33.8 for APPNP.
Sources
- Convex Shape Prior for Deep Neural Convolution Network based Eye Fundus Images Segmentation
- RoBERTa: A Robustly Optimized BERT Pretraining Approach
- Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks