REVIEW 5 cited by
A Survey of Graph Transformers: Architectures, Theories and Applications
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
A Survey of Graph Transformers: Architectures, Theories and Applications
read the original abstract
Graph Transformers (GTs) have demonstrated a strong capability in modeling graph structures by addressing the intrinsic limitations of graph neural networks (GNNs), such as over-smoothing and over-squashing. Recent studies have proposed diverse architectures, enhanced explainability, and practical applications for Graph Transformers. In light of these rapid developments, we conduct a comprehensive review of Graph Transformers, covering aspects such as their architectures, theoretical foundations, and applications. In this survey, we first categorize the architecture of Graph Transformers according to their strategies for processing structural information, including graph tokenization, positional encoding, structure-aware attention, and model ensemble. Then, from the theoretical perspective, we examine the expressivity of Graph Transformers in various discussed architectures and contrast them with other advanced graph learning algorithms to discover their connections. For applications, we organize the literature around four graph organization forms, from relational, geometric, dynamic to heterogeneous. A Practical Guidance table then maps architectural components to these graph forms by adoption frequency, so practitioners can narrow down which design families to consider for a given input structure. Lastly, we will discuss the current challenges and prospective directions in Graph Transformers for potential future research.
Forward citations
Cited by 5 Pith papers
-
Logarithmic High-Probability Regret for Online Convex Optimization with Two-Point Bandit Feedback
First minimax-optimal high-probability regret bound of O(d(log T + log(1/δ))/μ) for μ-strongly convex losses in two-point bandit OCO.
-
Teaching LLMs to See Graphs: Unifying Text and Structural Reasoning
GTLM injects graph-aware attention biases into LLMs using only 0.015% extra parameters, enabling native graph processing that matches 7B models with a 1B model on text-attributed graph benchmarks.
-
Agentic Fusion of Large Atomic and Language Models to Accelerate Superconductor Discovery
An agentic framework fusing large atomic and language models rediscovers 66 known superconductors and guides experimental verification of four new ones with transition temperatures from 2.5 K to 6.5 K.
-
Logarithmic High-Probability Regret for Online Convex Optimization with Two-Point Bandit Feedback
Standard two-point projected gradient achieves fixed-comparator high-probability logarithmic regret for strongly convex OCO with two-point bandit feedback, with a leading d (not d²) horizon term.
-
Different Statistical Perspectives for Understanding Generalisation in Graph Neural Networks
The paper reviews three broad statistical perspectives on generalization in GNNs and highlights key results plus limitations for each.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.