Pith. sign in

REVIEW 1 cited by

Towards Principled Graph Transformers

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 2401.10119 v4 pith:NWIBWIXK submitted 2024-01-18 cs.LG cs.AI

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

Graph learning architectures based on the k-dimensional Weisfeiler-Leman (k-WL) hierarchy offer a theoretically well-understood expressive power. However, such architectures often fail to deliver solid predictive performance on real-world tasks, limiting their practical impact. In contrast, global attention-based models such as graph transformers demonstrate strong performance in practice, but comparing their expressive power with the k-WL hierarchy remains challenging, particularly since these architectures rely on positional or structural encodings for their expressivity and predictive performance. To address this, we show that the recently proposed Edge Transformer, a global attention model operating on node pairs instead of nodes, has at least 3-WL expressive power. Empirically, we demonstrate that the Edge Transformer surpasses other theoretically aligned architectures regarding predictive performance while not relying on positional or structural encodings. Our code is available at https://github.com/luis-mueller/towards-principled-gts

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. Beyond Interpolation: Extrapolative Reasoning with Reinforcement Learning and Graph Neural Networks

    cs.LG 2025-02 conditional novelty 5.0 of 10

    Graph-based RL agents can solve logic puzzles larger than anything seen in training, with graph structure, reward design, and recurrence each changing how far extrapolation goes.

Pith tools