← Back to all news
arXiv AI By Killian Cressant, Pedro B. Velloso

LEED: Local Embedding Evolution Distance for over-smoothing estimation and virtual node selection in GNN

Read the original on arXiv AI →

arXiv:2608. 09596v1 Announce Type: cross Abstract: Graph Neural Networks (GNNs) suffer from two fundamental limitations: over-smoothing, where node representations become indistinguishable with depth, and over-squashing, where long-range information is compressed through limited message-passing channels.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Related stories

arXiv Machine Learning
Aug 20

Enhancing Distance-Based Graph Autoencoders with Structural Penalties for Dynamic Graph Embedding

The paper introduces three distance‑based graph autoencoder variants that add structural penalties to the reconstruction loss. All models use a two‑layer Graph Convolutional Network encoder and a Euclidean‑distance decoder, with two node‑level regularizers: a hub penalty based on degree centrality and a penalty based on Natural Community Local Intrinsic Dimensionality (NC‑LID). Experiments on multiple dynamic graph datasets show that incorporating NC‑LID regularization consistently improves reconstruction performance compared to baselines without structural regularization and to the hub‑aware variant.

By Aleksandar Tom\v{c}i\'c, Milo\v{s} Savi\'c, Milo\v{s} Radovanovi\'c
ragefficiency
More like this →
arXiv Machine Learning
Aug 27

DeltaGNN: Graph Neural Network with Information Flow Control

DeltaGNN introduces an information flow control mechanism that uses a new connectivity measure, the information flow score, to mitigate over‑smoothing and over‑squashing in Graph Neural Networks. This approach enables linear computational and memory overhead while effectively capturing both short‑range and long‑range node interactions. Experiments on ten diverse real‑world datasets demonstrate superior performance with limited computational complexity.

By Kevin Mancini, Islem Rekik
benchmarks
More like this →
arXiv AI
Jun 3

Learn When and Where to Connect: Adaptive Virtual Nodes for Dynamic Message Passing on Graphs

arXiv:2606. 03068v1 Announce Type: cross Abstract: While Virtual Nodes (VNs) are often utilized in Message Passing Neural Networks (MPNNs) to facilitate effective message passing, existing VN-based methods have limitations, such as constraining all nodes to connect to the same number of VNs, fixing the connections before applying MPNNs, and connecting a node to a VN independently of the other nodes that connect to the same VN.

By Jaejun Lee, Joyce Jiyoung Whang
More like this →