English

BSA: Ball Sparse Attention for Large-scale Geometries

Machine Learning 2025-06-17 v1 Artificial Intelligence Computer Vision and Pattern Recognition

Abstract

Self-attention scales quadratically with input size, limiting its use for large-scale physical systems. Although sparse attention mechanisms provide a viable alternative, they are primarily designed for regular structures such as text or images, making them inapplicable for irregular geometries. In this work, we present Ball Sparse Attention (BSA), which adapts Native Sparse Attention (NSA) (Yuan et al., 2025) to unordered point sets by imposing regularity using the Ball Tree structure from the Erwin Transformer (Zhdanov et al., 2025). We modify NSA's components to work with ball-based neighborhoods, yielding a global receptive field at sub-quadratic cost. On an airflow pressure prediction task, we achieve accuracy comparable to Full Attention while significantly reducing the theoretical computational complexity. Our implementation is available at https://github.com/britacatalin/bsa.

Keywords

Cite

@article{arxiv.2506.12541,
  title  = {BSA: Ball Sparse Attention for Large-scale Geometries},
  author = {Catalin E. Brita and Hieu Nguyen and Lohithsai Yadala Chanchu and Domonkos Nagy and Maksim Zhdanov},
  journal= {arXiv preprint arXiv:2506.12541},
  year   = {2025}
}

Comments

Long Context Foundation Models Workshop @ ICML 2025

R2 v1 2026-07-01T03:17:50.383Z