Skip to content

Controlling representation evolution in deep graph neural networks.

Aug 2026 · Neural Networks · Vol 205 Pt B, pp. 109464 · 0 citations · 12 references
Medicine

TL;DR

The Stable Reaction-Diffusion encoder (SRD) provides a trajectory-stabilizing forward evolution mechanism that explicitly controls propagation drift and finite-depth sensitivity, rather than simply stacking additional message-passing layers.

Abstract

Deep Graph Neural Networks (GNNs) often degrade when many propagation layers are stacked. Although this phenomenon is commonly associated with over-smoothing, node-wise similarity alone does not fully describe deep representation failure. During propagation, node representations form a layer-wise trajectory that may become unstable, lose traceability to input information, or collapse into a low-dimensional subspace. Motivated by this view, we formulate deep GNN degradation as a problem of representation trajectory control. The framework integrates three complementary controls along a shared representation trajectory. The Stable Reaction-Diffusion encoder (SRD) provides a trajectory-stabilizing forward evolution mechanism that explicitly controls propagation drift and finite-depth sensitivity, rather than simply stacking additional message-passing layers. A deterministic depth-normalized traceability constraint (RDC) encourages intermediate input-space targets to remain traceable to the original features through graph-aware residual consistency. A Rank-Rate Constraint (RRC) penalizes excessive inter-layer decay of logarithmic numerical rank to slow premature subspace degeneration. We position the method as an integration and diagnostic framework rather than a new propagation operator. Theoretical analysis and experiments demonstrate the effectiveness, robustness, and stability of the proposed trajectory-control framework.

View source

Similar papers

Preprint Aug 2026

Exploring Oversmoothing with Householder Matrices

This work proves three core properties of HouseGNN: every internal layer preserves the node-wise Euclidean norm; the Householder reflector is scale scale and sign-invariant in the message; and pairwise distance between nodes can change through mismatch between node-wise orthogonal operators.

Bhaskar Karol · 0 citations
Jul 2026

Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks

Analysis of a recurrent graph neural network in which independent Gaussian noise is injected after every propagation step reveals persistent stochastic perturbations as a fundamentally different mechanism for combating oversmoothing, complementing existing deterministic approaches based on residual connections, normali...

M. H. Chehreghani · 1 citation
#machine learning Open access Jan 2025

DeltaGNN: Graph Neural Network With Information Flow Control

DeltaGNN is introduced, to the best of the authors' knowledge, among the first scalable (featuring linear computational and memory complexity overhead) and generalizable (capable of effectively handling graphs with diverse homophily, density, and topology) architectures for long-range and short-range interaction detect...

Kevin Mancini, Islem Rekik · 2 citations
Conference Open access Sep 2026

ADC-GNN: Adaptive Dual-level Collaborative Graph Neural Networks for Graph Classification

This work proposes a novel Adaptive Dual-level Collaborative GNN associated with an adaptive dual-level collaborative mechanism, and shows that the ADC-GNN can inject the learned high-level information back into the node level, forming a closed-loop, bidirectional optimization process.

Wan Tang, Lu Bai, Li-Xin Cui et al. · 0 citations
Open access Jul 2026

Global graph features unveiled by unsupervised deep learning

Graph Autoencoder Uncovering Descriptive Information (GAUDI), an unsupervised graph deep learning framework designed to capture both local details and global structure, is introduced, providing new insights into emergent phenomena across diverse scientific domains.

Mirja Granfors, Jesús Pineda, Blanca Zufiria-Gerbolés et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.