Pith. sign in

REVIEW 18 cited by

A Survey on Oversmoothing in Graph Neural Networks

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.10993 v1 pith:BFGC3K4J submitted 2023-03-20 cs.LG

T. Konstantin Rusch , Michael M. Bronstein , Siddhartha Mishra This is my paper
classification cs.LG
keywords over-smoothinggraphgnnsmeasuresapproachesdefinitiondemonstrateempirically
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Node features of graph neural networks (GNNs) tend to become more similar with the increase of the network depth. This effect is known as over-smoothing, which we axiomatically define as the exponential convergence of suitable similarity measures on the node features. Our definition unifies previous approaches and gives rise to new quantitative measures of over-smoothing. Moreover, we empirically demonstrate this behavior for several over-smoothing measures on different graphs (small-, medium-, and large-scale). We also review several approaches for mitigating over-smoothing and empirically test their effectiveness on real-world graph datasets. Through illustrative examples, we demonstrate that mitigating over-smoothing is a necessary but not sufficient condition for building deep GNNs that are expressive on a wide range of graph learning tasks. Finally, we extend our definition of over-smoothing to the rapidly emerging field of continuous-time GNNs.

Discussion (0). Sign in to comment.

Forward citations

Cited by 18 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 82 citations worldwide. Full citation record

  1. FM4NPP: A Scaling Foundation Model for Nuclear and Particle Physics

    cs.LG 2025-08 conditional novelty 7.0 of 10

    A 188M-parameter Mamba model pretrained on 11M+ simulated sPHENIX events with a new serialization and neighbor-prediction task beats task-specific baselines on three downstream detector tasks when frozen and paired wi...

  2. Does Graph Compression Preserve Signal Propagation?

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Under graph compression, coarsening preserves the propagation trajectory but accelerates oversmoothing, while sparsification preserves signal diversity but diverges from the original trajectory.

  3. Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement

    cs.LG 2026-07 conditional novelty 6.0 of 10

    ACE adds a heterophily-aware auxiliary loss to coarsening-based GNN training, recovering discarded node-level information and improving accuracy on heterophilic graphs by up to ~15 points.

  4. Revisiting Degree-Corrected Spectral Clustering: a Condition-Free Spectral Analysis and Extension

    cs.SI 2026-07 conditional novelty 6.0 of 10

    A condition-free spectral bound ties DCSC's misclustered-node count to degree heterogeneity and cluster weakness, and the new ASCENT variant shows early-stage node-wise corrections can improve clustering.

  5. RTL-Sequencer: Towards Scalable RTL Timing Prediction with the Sequence-based Paradigm

    cs.AR 2026-07 conditional novelty 6.0 of 10

    Linearizing RTL logic cones into breadth-first sequences and processing them with Mamba-2 sequence models yields better arrival-time, WNS, and TNS predictions than graph-based baselines on 21 open-source designs.

  6. PostDeg: Placement Beats Parameterization in LayerNorm GNNs

    cs.LG 2026-06 conditional novelty 6.0 of 10

    Putting a degree-scalar after LayerNorm preserves topology magnitude that pre-LN multiplication erases, and a zero-parameter post-LN inverse-degree scale outperforms the LayerNorm baseline on influence maximization, d...

  7. Beyond ReLU: Bifurcation, Oversmoothing, and Topological Priors

    cs.LG 2026-02 conditional novelty 6.0 of 10

    Replacing ReLU with odd activations that have a stabilizing cubic term (sin, tanh) provably destabilizes the oversmooth fixed point of message passing and creates stable non-homogeneous solutions with square-root ampl...

  8. Geometry of Reason: Spectral Signatures of Valid Mathematical Reasoning

    cs.LG 2026-01 reject novelty 6.0 of 10

    Spectral features of attention are claimed to classify proof validity with near-perfect effect sizes, but the main evaluation relabels proofs using the classifier's own outputs.

  9. Multimodal Conditional MeshGAN for Personalized Aneurysm Growth Prediction

    cs.CV 2025-08 conditional novelty 6.0 of 10

    A conditional mesh-to-mesh GAN with local KNN and global graph branches predicts future thoracic aortic aneurysm shape and diameter more accurately than baseline mesh networks on a private longitudinal dataset.

  10. TANGO: Graph Neural Dynamics via Learned Energy and Tangential Flows

    cs.LG 2025-08 conditional novelty 6.0 of 10

    TANGO adds a learnable energy gradient and an orthogonal tangential flow to GNN layers, improving long-range and heterophilic graph benchmarks.

  11. Effects of relational graph modularity and depth on the learning performance of neural networks

    cs.LG 2025-07 conditional novelty 6.0 of 10

    Community-structured sparse relational graphs improve 5-layer CIFAR-10 accuracy over fully connected baselines, but the advantage reverses at 8 layers due to over-smoothing.

  12. GATMesh: Clock Mesh Timing Analysis using Graph Neural Networks

    cs.AR 2025-07 conditional novelty 6.0 of 10

    A graph neural network predicts clock mesh sink delays and slews on unseen designs with about 5 ps average error and a roughly 47,000x speedup over SPICE.

  13. Boundary Embedding Shaping with Adaptive Contrastive Learning for Graph Structural Disentanglement

    cs.LG 2026-06 unverdicted novelty 5.0 of 10

    Boundary-focused contrastive "gravity" loss on selected boundary nodes improves GNN node classification by about one point over an equal-architecture baseline, but the claimed proofs do not cover the implemented loss.

  14. Attention Maps in 3D Shape Classification for Dental Stage Estimation with Class Node Graph Attention Networks

    cs.CV 2025-09 conditional novelty 5.0 of 10

    CGAT, a graph attention network with a CLS node, achieves 0.76 weighted F1 on Demirjian stage classification of 3D third-molar meshes and generates attention maps that highlight roots and furcation regions.

  15. On the Interplay between Graph Structure and Learning Algorithms in Graph Neural Networks

    cs.LG 2025-08 unverdicted novelty 5.0 of 10

    Excess risk of SGD and ridge regression on GNNs is characterized through graph spectra, showing graph shape decides which algorithm generalizes better and deeper networks amplify the difference.

  16. Uncertainty-Aware Graph Neural Networks: A Multi-Hop Evidence Fusion Approach

    cs.LG 2025-06 conditional novelty 5.0 of 10

    EFGNN fuses per-depth evidential opinions from a multi-hop GNN into one final Dirichlet-based prediction whose uncertainty is lower than that of any single propagation depth.

  17. Solving the Job Shop Scheduling Problem with Graph Neural Networks: A Customizable Reinforcement Learning Environment

    cs.LG 2025-06 conditional novelty 5.0 of 10

    A new open-source library, JobShopLib, provides a customizable RL environment for GNN-based job shop scheduling, with experimental dispatchers showing competitive results.

  18. sHGCN: Simplified hyperbolic graph convolutional neural networks

    cs.LG 2025-06 conditional novelty 4.0 of 10

    A simplified hyperbolic GCN that avoids redundant log/exp computations is competitive or faster than prior HGCN variants on four benchmark graphs.

Pith tools