Do Transformers Really Perform Bad for Graph Representation?
arXiv:2106.05234
Abstract
The Transformer architecture has become a dominant choice in many domains, such as natural language processing and computer vision. Yet, it has not achieved competitive performance on popular leaderboards of graph-level prediction compared to mainstream GNN variants. Therefore, it remains a mystery how Transformers could perform well for graph representation learning. In this paper, we solve this mystery by presenting Graphormer, which is built upon the standard Transformer architecture, and could attain excellent results on a broad range of graph representation learning tasks, especially on the recent OGB Large-Scale Challenge. Our key insight to utilizing Transformer in the graph is the necessity of effectively encoding the structural information of a graph into the model. To this end, we propose several simple yet effective structural encoding methods to help Graphormer better model graph-structured data. Besides, we mathematically characterize the expressive power of Graphormer and exhibit that with our ways of encoding the structural information of graphs, many popular GNN variants could be covered as the special cases of Graphormer.
References in corpus (28)
- An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale
- Semi-Supervised Classification with Graph Convolutional Networks
- Inductive Representation Learning on Large Graphs
- Neural Message Passing for Quantum Chemistry
- Linformer: Self-Attention with Linear Complexity
- Graph Transformer Networks
- Open Graph Benchmark: Datasets for Machine Learning on Graphs
- Conformer: Convolution-augmented Transformer for Speech Recognition
- A Generalization of Transformer Networks to Graphs
- FreeLB: Enhanced Adversarial Training for Natural Language Understanding
- DeeperGCN: All You Need to Train Deeper GCNs
- Residual Gated Graph ConvNets
- Benchmarking Graph Neural Networks
- Strategies for Pre-training Graph Neural Networks
- Graph-Bert: Only Attention is Needed for Learning Graph Representations
- OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs
- Molecule Attention Transformer
- On Layer Normalization in the Transformer Architecture
- Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification
- Position-aware Graph Neural Networks
- Learning Graph-Level Representation for Drug Discovery
- Rethinking Graph Transformers with Spectral Attention
- Multi-Hop Knowledge Graph Reasoning with Reward Shaping
- Multi-hop Attention Graph Neural Network
- Graph Warp Module: an Auxiliary Module for Boosting the Power of Graph Neural Networks in Molecular Graph Analysis
- LazyFormer: Self Attention with Lazy Update
- Graph convolutions that can finally model local structure
- Breaking the Expressive Bottlenecks of Graph Neural Networks
Cited by in corpus (12)
- Knowledge Matters: Radiology Report Generation with General and Specific Knowledge
- Temporal and Heterogeneous Graph Neural Network for Financial Time Series Prediction
- Global Self-Attention as a Replacement for Graph Convolution
- GraphNorm: A Principled Approach to Accelerating Graph Neural Network Training
- Graph Neural Networks with Learnable Structural and Positional Representations
- Logiformer: A Two-Branch Graph Transformer Network for Interpretable Logical Reasoning
- Meta-Weight Graph Neural Network: Push the Limits Beyond Global Homophily
- Gophormer: Ego-Graph Transformer for Node Classification
- Improving Automatic Parallel Training via Balanced Memory Workload Optimization
- DyFormer: A Scalable Dynamic Graph Transformer with Provable Benefits on Generalization Ability
- Permutation invariant graph-to-sequence model for template-free retrosynthesis and reaction prediction
- RaWaNet: Enriching Graph Neural Network Input via Random Walks on Graphs