Persistent Tri-State Message Passing
Not on the map. Why?
Abstract (arXiv)
In stochastic message passing, an edge's sampled role changes the node states used to compute adaptive weights at later layers. Weight averaging therefore depends on whether edge roles persist across layers or are resampled at each layer. We study this dependence in Persistent Tri-State Message Passing (P3MP), which combines persistent additive, subtractive, and inactive roles with weights computed from each sample's endpoint states. For two layers, we separate target-state feedback from weight-source covariance and derive the condition under which local and shared weights reverse their preactivation ordering. Shared weights retain a 1/K fraction of the feedback for K samples. The interaction is zero for a source-only scorer. Permuting complete weight vectors between samples quantifies the same role-state dependence while preserving their empirical distribution. Exact enumeration and feature-only checkpoint measurements agree with the analytical predictions. Across independently trained feature-only models, local weights yield higher accuracy and lower negative log-likelihood under persistence, while shared weights yield higher accuracy and lower loss under layerwise resampling. The same accuracy ordering holds on deduplicated Chameleon and Squirrel.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 26 of its 33 references that are in the map. First posted on arXiv 3 Jan 2026.
Builds on
26 of 33 references.
References · 26
- 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
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2020Simple and Deep Graph Convolutional Networkscited by 857
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
- 2020Benchmarking Graph Neural Networkscited by 672
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
- 2015Importance Weighted Autoencoderscited by 454
14 more
- 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 361
- 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
- 2022Finding Global Homophily in Graph Neural Networks When Meeting Heterophilycited by 179
- 2022Revisiting Heterophily For Graph Neural Networkscited by 169
- 2021MagNet: A Neural Network for Directed Graphscited by 104
- 2018Bayesian graph convolutional neural networks for semi-supervised classificationcited by 88
- 2023Edge Directionality Improves Learning on Heterophilic Graphscited by 88
- 2021GBK-GNN: Gated Bi-Kernel Graph Neural Networks for Modeling Both Homophily and Heterophilycited by 84
- 2020Bayesian Graph Neural Networks with Adaptive Connection Samplingcited by 81
- 2019Signed Graph Attention Networkscited by 62
- 2023PC-Conv: Unifying Homophily and Heterophily with Two-fold Filteringcited by 28
- 2023Auto-HeG: Automated Graph Neural Network on Heterophilic Graphscited by 23
- 2024Commute Graph Neural Networkscited by 5
Built on by
Not cited yet.