Graph Propagation Transformer for Graph Representation Learning
Zhe Chen, Hao Tan, Tao Wang, Tianrun Shen, Tong Lu, Qiuying Peng, Cheng Cheng, Yue Qi
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/czczup/gptransOfficialIn paperpytorch★ 49
Abstract
This paper presents a novel transformer architecture for graph representation learning. The core insight of our method is to fully consider the information propagation among nodes and edges in a graph when building the attention module in the transformer blocks. Specifically, we propose a new attention mechanism called Graph Propagation Attention (GPA). It explicitly passes the information among nodes and edges in three ways, i.e. node-to-node, node-to-edge, and edge-to-node, which is essential for learning graph-structured data. On this basis, we design an effective transformer architecture named Graph Propagation Transformer (GPTrans) to further help learn graph data. We verify the performance of GPTrans in a wide range of graph learning experiments on several benchmark datasets. These results show that our method outperforms many state-of-the-art transformer-based graph models with better performance. The code will be released at https://github.com/czczup/GPTrans.
Tasks
Benchmark Results
| Dataset | Model | Metric | Claimed | Verified | Status |
|---|---|---|---|---|---|
| PCQM4M-LSC | GPTrans-L | Validation MAE | 0.12 | — | Unverified |
| PCQM4Mv2-LSC | GPTrans-L | Validation MAE | 0.08 | — | Unverified |
| PCQM4Mv2-LSC | GPTrans-T | Validation MAE | 0.08 | — | Unverified |
| ZINC-500k | GPTrans-Nano | MAE | 0.08 | — | Unverified |