PofoliaShared via Pofolia

Neural NetworksΒ· 2026Q1

Fast Multipole Attention: A Scalable Multilevel Attention Mechanism for Text and Images

Yanming Kang, Giang Tran, Hans De Sterck

Short summary

Fast Multipole Attention (FMA) reduces Transformer self-attention complexity from O(n^2) to O(n log n) time and O(n) memory by using a learned hierarchy of resolutions, enabling models to scale to longer sequences and higher-resolution inputs without accuracy loss.

AI-generated from the title and abstract; the full text is not read.

Key points

  • Fast Multipole Attention (FMA) reduces self-attention complexity from O(n^2) to O(n log n) time and O(n) memory.
  • FMA uses a learned hierarchy with O(log n) resolution levels, interacting nearby tokens fully and distant tokens coarsely.
  • 1D and 2D implementations of FMA are developed for language and vision tasks, respectively.
  • FMA matches or outperforms efficient attention baselines in language modeling with lower memory use.
  • The 2D FMA variant shows superior performance in vision tasks like classification and semantic segmentation.

AI-generated from the title and abstract; the full text is not read.

Abstract

While Transformer networks benefit from a global receptive field, their quadratic cost relative to sequence length restricts their application to long sequences and high-resolution inputs. We introduce Fast Multipole Attention (FMA), a divide-and-conquer mechanism for self-attention inspired by the Fast Multipole Method from n-body physics. FMA reduces the time and memory complexity of self-attention from π’ͺ ⁑ ( 𝑛 2 ) to π’ͺ ⁑ ( 𝑛 ⁒ l o g ⁑ 𝑛 ) and π’ͺ ⁑ ( 𝑛 ) while preserving full-context interactions. FMA contains a learned hierarchy with π’ͺ ⁑ ( l o g ⁑ 𝑛 ) levels of resolution. In this hierarchy, nearby tokens interact at full resolution, while distant tokens engage through progressively coarser, learned basis functions. We have developed both 1D and 2D implementations of FMA for language and vision tasks, respectively. On autoregressive and bidirectional language modeling benchmarks, the 1D variant either matches or outperforms leading efficient attention baselines with substantially lower memory use. With linear complexity, the 2D variant demonstrates superior performance over strong vision transformer baselines in classification and semantic segmentation tasks. Our results confirm that the multilevel attention implemented by FMA allows Transformer-based models to scale to much longer sequences and higher-resolution inputs without loss in accuracy. This provides a principled, physics-inspired approach for developing scalable neural networks suitable for language, vision, and multimodal tasks. Our code will be available at [Details omitted for double-anonymized reviewing].

The authors' abstract, as published at the source. Neural Networks, 2026 Β· DOI β†—

TakeawaysPremium
Ask the paperFree account

Continue with a free account

Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.

Continue free on the web

Sign in with Google or Apple; no card needed. You come back to this paper.

On your phone:

Field: Computer Vision and Pattern Recognition

Computer Vision and Pattern RecognitionComputer Science