Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.29803 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917543776616448 |
|---|---|
| author | Ma, Zhongtian Wu, Hao Zhang, Yexin Zhang, Qiaosheng Wang, Zhen |
| author_facet | Ma, Zhongtian Wu, Hao Zhang, Yexin Zhang, Qiaosheng Wang, Zhen |
| contents | Graph attention networks learn neighbor importance through data-dependent coefficients, but standard layers lack explicit control over unreliable feature dimensions and use fixed sharpness of attention coefficient distributions. This paper proposes gated graph attention and learnable temperature for common graph attention mechanisms. Gated graph attention filters feature or message responses to reduce the influence of unreliable dimensions, while learnable temperature dynamically adjusts the sharpness of the attention coefficient distribution. Experiments on homogeneous and heterophilic heterogeneous benchmarks show that the proposed variants consistently improve the corresponding graph attention backbones, and controlled noise studies further verify their behavior under feature perturbations. Theoretical analysis explains these results by showing that gating improves robustness when only part of the feature coordinates are reliable, while temperature is beneficial when global noise weakens the discriminability of node features. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_29803 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Gated Graph Attention Networks with Learnable Temperature Ma, Zhongtian Wu, Hao Zhang, Yexin Zhang, Qiaosheng Wang, Zhen Machine Learning Graph attention networks learn neighbor importance through data-dependent coefficients, but standard layers lack explicit control over unreliable feature dimensions and use fixed sharpness of attention coefficient distributions. This paper proposes gated graph attention and learnable temperature for common graph attention mechanisms. Gated graph attention filters feature or message responses to reduce the influence of unreliable dimensions, while learnable temperature dynamically adjusts the sharpness of the attention coefficient distribution. Experiments on homogeneous and heterophilic heterogeneous benchmarks show that the proposed variants consistently improve the corresponding graph attention backbones, and controlled noise studies further verify their behavior under feature perturbations. Theoretical analysis explains these results by showing that gating improves robustness when only part of the feature coordinates are reliable, while temperature is beneficial when global noise weakens the discriminability of node features. |
| title | Gated Graph Attention Networks with Learnable Temperature |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2605.29803 |