Learning Conjoint Attentions for Graph Neural Nets

Page view(s)
0
Checked on
Learning Conjoint Attentions for Graph Neural Nets
Title:
Learning Conjoint Attentions for Graph Neural Nets
Journal Title:
35th Conference on Neural Information Processing Systems (NeurIPS 2021)
DOI:
Publication Date:
07 December 2021
Citation:
He, T., Ong, Y. S., & Bai, L. (2021). Learning conjoint attentions for graph neural nets. Advances in Neural Information Processing Systems, 34, 2641-2653.
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.
License type:
Publisher Copyright
Funding Info:
This work is supported in part by the Data Science & Artificial Intelligence Research Center (DSAIR), Nanyang Technological University, and in part by Agency for Science, Technology and Research (A*STAR).
Description:
ISBN:
https://doi.org/10.48550/arXiv.2102.03147
Files uploaded:

File Size Format Action
cat-neurips2021.pdf 937.53 KB PDF Open