Metraipolis › archive › dc_e514975b404b
Query-Oblivious Coresets for Softmax Attention: Improved Bounds and Efficient Constructions — arXiv:2609.06327
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.06327
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T12:50:05.908Z
- SHA-256 of the archived text
9a4309d9c845cd19854a11cf3b8281fe4cec439c37e03059692ddb1fd008e94f- Stable URL of this page
https://metraipolis.com/documento/dc_e514975b404b
How to cite
Query-Oblivious Coresets for Softmax Attention: Improved Bounds and Efficient Constructions — arXiv:2609.06327 — arXiv (en), https://arxiv.org/abs/2609.06327 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e514975b404b (Metraipolis archive dc_e514975b404b, sha256 9a4309d9c845cd19854a11cf3b8281fe4cec439c37e03059692ddb1fd008e94f)
BibTeX
@misc{dce514975b404b,
title = {Query-Oblivious Coresets for Softmax Attention: Improved Bounds and Efficient Constructions — arXiv:2609.06327},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.06327},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e514975b404b; sha256 9a4309d9c845cd19854a11cf3b8281fe4cec439c37e03059692ddb1fd008e94f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06327. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A query-oblivious coreset for a softmax-attention head is a subset of the key-value pairs whose attention output is within $\varepsilon$ of the full one for every query in a ball. Liberty, Andoni and Kleiner proved that unweighted coresets of size $O(\sqrt d e^{\rho+\frac12\log\rho+o(\log\log\rho)}/\varepsilon)$ exist, $\rho$ the query radius times the centred key radius, against a lower bound $\Omega(\sqrt d e^{\rho}/\varepsilon)$, and conjectured that closing the gap needs new techniques. It does not: a spherical lift of both balls into one exponential-kernel instance lets the Bozzai-Rothvoss chaining bound apply, and Chevet's inequality splits key from value dimension, giving coresets of size $O(e^{\rho}(\sqrt{d_v}+\sqrt{d_k\log(1+\rho)})/\varepsilon)$ in randomised polynomial time, the first constructive whole-ball guarantee within $\sqrt{\log(1+\rho)}$ of the lower bound. A sampling cap $O(e^{2\rho}/\varepsilon^{2})$ completes the envelope; in fixed dimension Tai's diameter-free bound removes the logarithm, settling the Gaussian-restriction case of a Bozzai-Rothvoss question for the kernels. We give theLiberty-Andoni-Kleiner lower boud transfer the one-waycommunication bounds of Chen et r is the price of one signing forall queries. A census of every head of Qwen2.5-7B-Instruct and Llama-3-8B-Instruct finds $\rho$ at least 23.877, so everyactor $e^{\rho}/\varepsilon$prescribes a coreset larger than the cache: the algorithmic contribution is asymptotic on these models.
Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-09 in cs.CL).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computation and Language (cs.CL).
Pagina del lavoro: https://arxiv.org/abs/2609.06327 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T12:30:25.255Z dalla pagina https://arxiv.org/catchup/cs.CL/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).