REVIEW 8 cited by
A Note on Over-Smoothing for Graph Neural Networks
Not yet reviewed by Pith; the record is open.
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
read the original abstract
Graph Neural Networks (GNNs) have achieved a lot of success on graph-structured data. However, it is observed that the performance of graph neural networks does not improve as the number of layers increases. This effect, known as over-smoothing, has been analyzed mostly in linear cases. In this paper, we build upon previous results \cite{oono2019graph} to further analyze the over-smoothing effect in the general graph neural network architecture. We show when the weight matrix satisfies the conditions determined by the spectrum of augmented normalized Laplacian, the Dirichlet energy of embeddings will converge to zero, resulting in the loss of discriminative power. Using Dirichlet energy to measure "expressiveness" of embedding is conceptually clean; it leads to simpler proofs than \cite{oono2019graph} and can handle more non-linearities.
Forward citations
Cited by 8 Pith papers
-
Bridging Theory and Practice in Link Representation with Graph Neural Networks
A new framework classifies message-passing link representation models by neighborhood radius and base expressiveness, yielding a hierarchy in which SEAL is most expressive, plus a synthetic benchmark and symmetry-base...
-
Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement
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.
-
Beyond ReLU: Bifurcation, Oversmoothing, and Topological Priors
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...
-
TANGO: Graph Neural Dynamics via Learned Energy and Tangential Flows
TANGO adds a learnable energy gradient and an orthogonal tangential flow to GNN layers, improving long-range and heterophilic graph benchmarks.
-
From Diffusion to Reaction-Diffusion: A Dynamical-Systems View of Oversmoothing in Hypergraph Neural Networks
Hypergraph diffusion provably collapses node representations, and a reaction term that exactly cancels diffusion dissipation keeps a designed transverse energy level nonzero in Hypergraph Neural Reaction–Diffusion (HNRD).
-
Local-Global Geometric Insights for Graph Neural Networks via Entropic Curvature
A graph curvature proxy, κw, is claimed to bound oversmoothing and generalization and to guide rewiring/gating, but the central proofs rest on gaps and an invalid monotonicity argument.
-
How do Probabilistic Graphical Models and Graph Neural Networks Look at Network Data?
SBM-style probabilistic models outperform graph neural networks on link prediction when node features are low-dimensional, noisy, or the graph is heterophilic.
-
Comment on "A Note on Over-Smoothing for Graph Neural Networks"
The authors show exponential decay of Dirichlet energy for GNNs with Leaky-ReLU and polynomial filters, but the proof relies on unverified spectral inequalities.
Discussion (0). Sign in to comment.