Pith. sign in

REVIEW 2 cited by

The Expressive Power of Graph Neural Networks: A 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.08235 v2 pith:JZLZOHI5 submitted 2023-08-16 cs.LG cs.SI

classification cs.LGcs.SI
keywords gnnsgraphexpressivemodelspowerenhancementsurveyfocus
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph neural networks (GNNs) are effective machine learning models for many graph-related applications. Despite their empirical success, many research efforts focus on the theoretical limitations of GNNs, i.e., the GNNs expressive power. Early works in this domain mainly focus on studying the graph isomorphism recognition ability of GNNs, and recent works try to leverage the properties such as subgraph counting and connectivity learning to characterize the expressive power of GNNs, which are more practical and closer to real-world. However, no survey papers and open-source repositories comprehensively summarize and discuss models in this important direction. To fill the gap, we conduct a first survey for models for enhancing expressive power under different forms of definition. Concretely, the models are reviewed based on three categories, i.e., Graph feature enhancement, Graph topology enhancement, and GNNs architecture enhancement.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. 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.

  2. Chordless Structure: A Pathway to Simple and Expressive GNNs

    cs.LG 2025-05 reject novelty 4.0 of 10

    CSGNN encodes chordless cycles and paths as structural features and is claimed to strictly outperform k-hop GNNs in expressiveness with polynomial complexity.

Pith tools