Pith. sign in

REVIEW 1 cited by

Over-Squashing in Graph Neural Networks: A Comprehensive survey

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

arxiv 2308.15568 v7 pith:TRGG7QFW submitted 2023-08-29 cs.AI

classification cs.AI
keywords over-squashinggraphsurveynetworksneuralgnnsinformationinteractions
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph Neural Networks (GNNs) revolutionize machine learning for graph-structured data, effectively capturing complex relationships. They disseminate information through interconnected nodes, but long-range interactions face challenges known as "over-squashing". This survey delves into the challenge of over-squashing in Graph Neural Networks (GNNs), where long-range information dissemination is hindered, impacting tasks reliant on intricate long-distance interactions. It comprehensively explores the causes, consequences, and mitigation strategies for over-squashing. Various methodologies are reviewed, including graph rewiring, novel normalization, spectral analysis, and curvature-based strategies, with a focus on their trade-offs and effectiveness. The survey also discusses the interplay between over-squashing and other GNN limitations, such as over-smoothing, and provides a taxonomy of models designed to address these issues in node and graph-level tasks. Benchmark datasets for performance evaluation are also detailed, making this survey a valuable resource for researchers and practitioners in the GNN field.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DeepGate4: Efficient and Effective Representation Learning for Circuit Design at Scale

    cs.LG 2025-02 conditional novelty 6.0 of 10

    DeepGate4 scales circuit representation learning to million-gate AIGs by partitioning them into overlapping cones and processing them in level order with a GAT-based sparse transformer, achieving state-of-the-art loss...

Pith tools