Pith. sign in

REVIEW 3 cited by

Global Self-Attention as a Replacement for Graph Convolution

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 2108.03348 v3 pith:6KS7EXXI submitted 2021-08-07 cs.LG

Global Self-Attention as a Replacement for Graph Convolution

classification cs.LG
keywords graphaggregationchannelsconvolutionalglobalinformationlearningself-attention
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We propose an extension to the transformer neural network architecture for general-purpose graph learning by adding a dedicated pathway for pairwise structural information, called edge channels. The resultant framework - which we call Edge-augmented Graph Transformer (EGT) - can directly accept, process and output structural information of arbitrary form, which is important for effective learning on graph-structured data. Our model exclusively uses global self-attention as an aggregation mechanism rather than static localized convolutional aggregation. This allows for unconstrained long-range dynamic interactions between nodes. Moreover, the edge channels allow the structural information to evolve from layer to layer, and prediction tasks on edges/links can be performed directly from the output embeddings of these channels. We verify the performance of EGT in a wide range of graph-learning experiments on benchmark datasets, in which it outperforms Convolutional/Message-Passing Graph Neural Networks. EGT sets a new state-of-the-art for the quantum-chemical regression task on the OGB-LSC PCQM4Mv2 dataset containing 3.8 million molecular graphs. Our findings indicate that global self-attention based aggregation can serve as a flexible, adaptive and effective replacement of graph convolution for general-purpose graph learning. Therefore, convolutional local neighborhood aggregation is not an essential inductive bias.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

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

  1. Enhancing LLMs for Graph Tasks via Graph-aware LoRA Generation

    cs.LG 2026-06 unverdicted novelty 6.0

    GaRA generates task-specific LoRA weight updates conditioned on graph structures to enable better whole-graph encoding in LLMs for zero-shot graph learning.

  2. Geometric 2D Scene Graph Generation

    cs.CV 2026-07 reject novelty 4.0

    A three-step network predicts assembly scene graphs from geometric component images, demonstrated on a four-toy-vehicle dataset with generalization to an unseen car.

  3. GTHNA: Local-global Graph Transformer with Memory Reconstruction for Holistic Node Anomaly Evaluation

    cs.LG 2025-09 conditional novelty 4.0

    GTHNA scores node anomalies by combining local-global Transformer embeddings, a memory of normal patterns, and multi-scale reconstruction, reporting top AUC on six of seven graph benchmarks.