CAT: A Causally Graph Attention Network for Trimming Heterophilic Graph
Silu He, Qinyao Luo, Xinsha Fu, Ling Zhao, Ronghua Du, Haifeng Li

TL;DR
This paper introduces CAT, a causally-guided attention mechanism that identifies and removes distracting neighbors in heterophilic graphs, significantly improving node classification accuracy.
Contribution
The paper proposes a novel causal approach to estimate and weaken the distraction effect in GATs, enhancing their performance on heterophilic graphs.
Findings
CAT improves accuracy of base GAT models on heterophilic datasets
It effectively identifies and removes distraction neighbors
Experimental results validate the causal estimation and performance gains
Abstract
Local Attention-guided Message Passing Mechanism (LAMP) adopted in Graph Attention Networks (GATs) is designed to adaptively learn the importance of neighboring nodes for better local aggregation on the graph, which can bring the representations of similar neighbors closer effectively, thus showing stronger discrimination ability. However, existing GATs suffer from a significant discrimination ability decline in heterophilic graphs because the high proportion of dissimilar neighbors can weaken the self-attention of the central node, jointly resulting in the deviation of the central node from similar nodes in the representation space. This kind of effect generated by neighboring nodes is called the Distraction Effect (DE) in this paper. To estimate and weaken the DE of neighboring nodes, we propose a Causally graph Attention network for Trimming heterophilic graph (CAT). To estimate the…
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 · Functional Brain Connectivity Studies · Complex Network Analysis Techniques
MethodsGraph Attention Network · Balanced Selection
