Understanding and Tackling Over-Dilution in Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Message Passing Neural Networks (MPNNs) hold a key position in machine learning on graphs, but they struggle with unintended behaviors, such as over-smoothing and over-squashing, due to irregular data structures. The observation and formulation of these limitations have become foundational in constructing more informative graph representations. In this paper, we delve into the limitations of MPNNs, focusing on aspects that have previously been overlooked. Our observations reveal that even within a single layer, the information specific to an individual node can become significantly diluted. To delve into this phenomenon in depth, we present the concept of Over-dilution and formulate it with two dilution factors: intra-node dilution for attribute-level and inter-node dilution for node-level representations. We also introduce a transformer-based solution that alleviates over-dilution and complements existing node embedding methods like MPNNs. Our findings provide new insights and contribute to the development of informative representations. The implementation and supplementary materials are publicly available at https://github.com/LeeJunHyun/NATR.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 28 of its 42 references that are in the map. First posted on arXiv 22 Aug 2025.
Builds on
28 of 42 references.
References · 28
- 2017Attention Is All You Needcited by 60,361
- 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
- 2016Layer Normalizationcited by 5,669
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2019Simplifying Graph Convolutional Networkscited by 1,477
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,102
- 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 877
- 2020Simple and Deep Graph Convolutional Networkscited by 860
16 more
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
- 2015Image-based Recommendations on Styles and Substitutescited by 706
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 545
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 478
- 2021Rethinking Graph Transformers with Spectral Attentioncited by 473
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 335
- 2019PairNorm: Tackling Oversmoothing in GNNscited by 297
- 2019Revisiting Graph Neural Networks: All We Have is Low-Pass Filterscited by 261
- 2022Pure Transformers are Powerful Graph Learnerscited by 188
- 2019Graph Neural Networks with convolutional ARMA filterscited by 185
- 2022GRPE: Relative Positional Encoding for Graph Transformercited by 70
- 2020Inductive Link Prediction for Nodes Having Only Attribute Informationcited by 30
- 2024Spectral Graph Pruning Against Over-Squashing and Over-Smoothingcited by 24
- 2022Feature Overcorrelation in Deep Graph Neural Networks: A New Perspectivecited by 19
- 2024Probabilistic Graph Rewiring via Virtual Nodescited by 15
- 2024TSC: A Simple Two-Sided Constraint against Over-Smoothingcited by 2
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Relieving the Over-Aggregating Effect in Graph Transformers24 Oct 2025