---
title: "图卷积注意力：图去噪与扩散的谱视角"
source: "arXiv AI/CL/LG（论文）"
source_tier: "t2"
url: "https://arxiv.org/abs/2607.06546v1"
permalink: "https://feed.astralor.com/items/itm_3fd2f3b905cffb550ba96919"
published: "2026-07-07T17:52:17.000Z"
score: 81
channel: "ai"
tags: ["图Transformer","图卷积注意力","图去噪","图扩散","谱图理论","谱注意力"]
---

# 图卷积注意力：图去噪与扩散的谱视角

## AI 点评

> 这篇论文值得所有关注图神经网络和扩散模型的研究者仔细阅读。它没有停留在经验改进，而是从谱图理论出发，揭示了线性注意力的根本缺陷并给出了优雅的解决方案。对于工程应用者，GCA提供了即插即用的注意力替代方案，尤其与DiGress结合时的效率提升令人印象深刻。

## 速览

本文从谱角度分析了基于注意力的图去噪机制，指出线性注意力只能学习平均谱去噪滤波器，存在分布光谱多样性导致的局限性。为此，作者提出谱注意力（Spectral Attention）及其实用化的图卷积注意力（GCA），通过图滤波查询和键实现谱去噪。理论证明GCA在随机块模型中匹配理想谱注意力，并发现softmax操作可进一步清理噪声本征向量。实验表明，GCA在合成与真实数据集上持续提升图去噪与扩散性能，并与DiGress结合时无需计算昂贵结构特征即可达到同等效果。

## 关键点

- 线性注意力只能学习平均谱去噪滤波器，无法适应图分布的谱多样性。
- 提出谱注意力（Spectral Attention）和实用的图卷积注意力（GCA），通过图滤波实现谱去噪。
- 理论证明GCA在随机块模型中与理想谱注意力等价，并发现softmax操作具有额外去噪能力。
- 实验表明GCA提升图去噪与扩散性能，结合PEARL位置编码可避免显式本征分解，加速推理而不损失质量。

## 全文

Denoising graphs is a fundamental problem in graph learning and the core operation of graph diffusion models. Attention-based architectures like graph transformers have recently shown promise in denoising graphs. However, our principled understanding of attention-based graph denoising remains limited, making it unclear whether standard attention is the right mechanism for this task. Here we show that, under a denoising objective, linear attention is suboptimal and can only learn an average spectral denoising filter over the training distribution. This creates a fundamental limitation as graphs often vary spectrally across the distribution. To overcome this limitation, we introduce Spectral Attention, which directly utilizes the input graph spectrum and provably outperforms linear attention by a margin governed by the spectral diversity of the distribution. We then derive Graph Convolutional Attention (GCA), a practical and permutation-equivariant realization of this idea that implements spectral denoising through graph-filtered queries and keys. For stochastic block models, GCA provably matches the idealized Spectral Attention mechanism. We further show that the softmax operation, that follows the attention, provides additional denoising by approximately projecting noisy eigenvectors onto the clean eigenspace. Empirically, replacing linear attention with GCA consistently improves graph denoising and diffusion on synthetic and real datasets, with gains strongly correlated with spectral diversity. In DiGress, GCA matches standard graph-transformer performance without computing expensive structural features, and when combined with the recently proposed PEARL positional encodings, avoids explicit eigendecomposition computations resulting in faster inference without degrading quality. The code can be found here: github.com/shervinkhalafi/graph_conv_att

---

引用前请核对原文;本文由星际流动整理:https://feed.astralor.com/items/itm_3fd2f3b905cffb550ba96919