Query-Oblivious Coresets for Softmax Attention: Improved Bounds and Efficient Constructions

arXiv:2609.06327v3 Announce Type: replace-cross Abstract: 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. With $\rho$ the query radius times the centred key radius, we build such coresets of size $O(e^{\rho}(\sqrt{d_v}+\sqrt{d_k\log(1+\rho)})/\varepsilon)$ in randomised polynomial time, improving the existential $O(\sqrt d\,e^{\rho+\frac12\log\rho+o(\log\log\rho)}/\varepsilon)$ of Liberty, Andoni and Kleiner to within $\sqrt{\log(1+\rho)}$ of their $\Omega(\sqrt d\,e^{\rho}/\varepsilon)$ lower bound: a spherical lift of both balls into one exponential-kernel instance admits the Bozzai--Rothvoss chaining bound, and Chevet's inequality splits key from value dimension. A sampling cap $O(e^{2\rho}/\varepsilon^{2})$ completes the envelope, and in fixed dimension Tai's diameter-free bound removes the logarithm. A census of every head of Qwen2.5-7B-Instruct and Llama-3.1-8B-Instruct finds $\rho\ge24.100$, so every whole-ball bound with a factor $e^{\rho}/\varepsilon$ prescribes a coreset larger than the cache: the algorithmic contribution is asymptotic on these models.