Learning from Historical Activations in Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Graph Neural Networks (GNNs) have demonstrated remarkable success in various domains such as social networks, molecular chemistry, and more. A crucial component of GNNs is the pooling procedure, in which the node features calculated by the model are combined to form an informative final descriptor to be used for the downstream task. However, previous graph pooling schemes rely on the last GNN layer features as an input to the pooling or classifier layers, potentially under-utilizing important activations of previous layers produced during the forward pass of the model, which we regard as historical graph activations. This gap is particularly pronounced in cases where a node's representation can shift significantly over the course of many graph neural layers, and worsened by graph-specific challenges such as over-smoothing in deep architectures. To bridge this gap, we introduce HISTOGRAPH, a novel two-stage attention-based final aggregation layer that first applies a unified layer-wise attention over intermediate activations, followed by node-wise attention. By modeling the evolution of node representations across layers, our HISTOGRAPH leverages both the activation history of nodes and the graph structure to refine features used for final prediction. Empirical results on multiple graph classification benchmarks demonstrate that HISTOGRAPH offers strong performance that consistently improves traditional techniques, with particularly strong robustness in deep GNNs.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 63 of its 78 references that are in the map. First posted on arXiv 3 Jan 2026.
Builds on
63 of 78 references.
References · 63
- 2017Attention Is All You Needcited by 60,361
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
- 2013Visualizing and Understanding Convolutional Networkscited by 2,290
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
- 2020Big Bird: Transformers for Longer Sequencescited by 1,684
38 more
- 2017Deep Setscited by 1,421
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,102
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 993
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 877
- 2020Simple and Deep Graph Convolutional Networkscited by 860
- 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 787
- 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 728
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
- 2020Benchmarking Graph Neural Networkscited by 680
- 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 631
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
- 2019DeepGCNs: Can GCNs Go as Deep as CNNs?cited by 527
- 2019Graph Transformer Networkscited by 523
- 2019Graph U-Netscited by 492
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 478
- 2019Self-Attention Graph Poolingcited by 421
- 2019Diffusion Improves Graph Learningcited by 414
- 2019Provably Powerful Graph Networkscited by 389
- 2017Residual Gated Graph ConvNetscited by 346
- 2019Revisiting Graph Neural Networks: All We Have is Low-Pass Filterscited by 261
- 2020A Note on Over-Smoothing for Graph Neural Networkscited by 249
- 2023A Survey on Oversmoothing in Graph Neural Networkscited by 247
- 2015Order Matters: Sequence to sequence for setscited by 237
- 2022Sign and Basis Invariant Networks for Spectral Graph Representation Learningcited by 179
- 2021Training Graph Neural Networks with 1000 Layerscited by 169
- 2019ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representationscited by 156
- 2021Weisfeiler and Leman go Machine Learning: The Story so farcited by 122
- 2021Accurate Learning of Graph Representations with Graph Multiset Poolingcited by 120
- 2023Rethinking the Expressive Power of GNNs via Graph Biconnectivitycited by 119
- 2022Understanding and Extending Subgraph GNNs by Rethinking Their Symmetriescited by 112
- 2019Graph Convolutional Networks with EigenPoolingcited by 94
- 2023A Complete Expressiveness Hierarchy for Subgraph GNNs via Subgraph Weisfeiler-Lehman Testscited by 64
- 2020Memory-Based Graph Networkscited by 56
- 2019Edge Contraction Pooling for Graph Neural Networkscited by 53
- 2022Graph Pooling for Graph Neural Networks: Progress, Challenges, and Opportunitiescited by 52
- 2020Topology-Aware Graph Pooling Networkscited by 44
- 2025On Vanishing Gradients, Over-Smoothing, and Over-Squashing in GNNs: Bridging Recurrent and Graph Learningcited by 43
- 2023Equivariant Polynomials for Graph Neural Networkscited by 38
50 most cited of 63 All 63 (JSON)
Built on by
Not cited yet.