← 返回论文检索
ICML 2026PosterAccept (regular)

From Pairwise Affinities to Functional Correspondences: Rethinking Attention

Jiefang Xiao, Maolin Gao, Simon Weber, Guandao Yang, Daniel Cremers

Technical university of Munich · Technical University of Munich · University of Oxford · University of Texas Austin · TU Munich

PDF 由论文原始站点提供,PaperCompass 不保存论文文件。

摘要

Learning mappings between infinite-dimensional function spaces, or operator learning, is essential for many machine learning applications. Although transformer-based operators are popular, they often rely on token-wise attention. These methods treat continuous fields as discrete tokens and usually ignore the global functional structure. We introduce {Functional Attention}, which reinterprets attention as a functional correspondence between adaptive bases. Inspired by geometric functional maps, our method replaces softmax affinities with structured linear operators. This yields a compact, generalizable, resolution-invariant representation that explicitly captures global dependencies. Experiments demonstrate that {Functional Attention} can match state-of-the-art performance in many operator learning tasks, including solving PDEs, 3D segmentation, and regression, while remaining robust to varying discretizations.