Learning Conjoint Attentions for Graph Neural Nets
arXiv:2102.03147
Abstract
In this paper, we present Conjoint Attentions (CAs), a class of novel learning-to-attend strategies for graph neural networks (GNNs). Besides considering the layer-wise node features propagated within the GNN, CAs can additionally incorporate various structural interventions, such as node cluster embedding, and higher-order structural correlations that can be learned outside of GNN, when computing attention scores. The node features that are regarded as significant by the conjoint criteria are therefore more likely to be propagated in the GNN. Given the novel Conjoint Attention strategies, we then propose Graph conjoint attention networks (CATs) that can learn representations embedded with significant latent features deemed by the Conjoint Attentions. Besides, we theoretically validate the discriminative capacity of CATs. CATs utilizing the proposed Conjoint Attention strategies have been extensively tested in well-established benchmarking datasets and comprehensively compared with state-of-the-art baselines. The obtained notable performance demonstrates the effectiveness of the proposed Conjoint Attentions.
Conference on Neural Information Processing Systems (NeurIPS 2021), Implementation: https://github.com/he-tiantian/CATs
References in corpus (8)
- Deep Convolutional Networks on Graph-Structured Data
- Simplifying Graph Convolutional Networks
- A Survey on Multi-view Learning
- Open Graph Benchmark: Datasets for Machine Learning on Graphs
- Session-based Social Recommendation via Dynamic Graph Attention Networks
- Principal Neighbourhood Aggregation for Graph Nets
- Benchmarking Graph Neural Networks
- Improving Graph Attention Networks with Large Margin-based Constraints