arXiv (OAI Expanded)
open access
Query-Oblivious Coresets for Softmax Attention: Improved Bounds and Efficient Constructions
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^{ρ+\frac12\logρ+o(\log\logρ)}/\varepsil
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On a problem of Nathanson related to strongly minimal asymptotic bases of order $h$#1143466
- Per-Query Gating of LLM Rerankers for Multi-Hop Retrieval#1037563
- Sharp Characterization of Bias in Post-Bandit Inference#1052257
- Optimizing the CGMS upper bound on Ramsey numbers#789385
- Bellman-sufficient Information Complexity#798953
Record · ID 1084381
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive