Graph-Bert: Only Attention is Needed for Learning Graph Representations
Jiawei Zhang, Haopeng Zhang, Congying Xia, Li Sun

TL;DR
GRAPH-BERT introduces a novel attention-only neural network for graph representation learning, avoiding traditional graph convolution issues, and demonstrates superior performance and efficiency on benchmark datasets.
Contribution
It proposes a new attention-based GNN model, GRAPH-BERT, trained on sampled subgraphs, which outperforms existing GNNs in effectiveness and efficiency.
Findings
Outperforms existing GNNs on benchmark datasets.
Effective in node classification and graph clustering.
Can be transferred across tasks with minimal fine-tuning.
Abstract
The dominant graph neural networks (GNNs) over-rely on the graph links, several serious performance problems with which have been witnessed already, e.g., suspended animation problem and over-smoothing problem. What's more, the inherently inter-connected nature precludes parallelization within the graph, which becomes critical for large-sized graph, as memory constraints limit batching across the nodes. In this paper, we will introduce a new graph neural network, namely GRAPH-BERT (Graph based BERT), solely based on the attention mechanism without any graph convolution or aggregation operators. Instead of feeding GRAPH-BERT with the complete large input graph, we propose to train GRAPH-BERT with sampled linkless subgraphs within their local contexts. GRAPH-BERT can be learned effectively in a standalone mode. Meanwhile, a pre-trained GRAPH-BERT can also be transferred to other…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Topic Modeling · Graph Theory and Algorithms
MethodsConvolution
