Graph Transformer
Overview
Graph Transformers study how attention-based models can learn from nodes, edges, and other relationships while respecting graph structure. Common approaches add positional or structural encodings—such as Laplacian spectra, random walks, or graph distances—or use local, sparse, hierarchical, and relation-aware attention to control computation. They are applied to tasks including molecular prediction, temporal and relational graphs, scientific modeling, and graph generation, with evaluations spanning standard graph benchmarks and larger or shifted settings. A central tension is how to preserve useful structural biases and generalize across graph sizes while scaling attention; theory also indicates that global attention alone does not necessarily overcome the expressive limits of common graph architectures.
Latest papers
101 papers17 papers in the last four weeks, up 89% on the four weeks before. 0.1% of all new papers.