Query-Oblivious Coresets for Softmax Attention: Improved Bounds and Efficient Constructions
cs.DS, cs.CL
Submitted: 2026-09-06
Updated: 2026-09-13
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Related papers
- Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
- Edge-Private Matching Kernels Through Local Decoding
- Local Node Differential Privacy
- Cheaper by the Batch: Shared Traversal for Genotype Graph Editing
- Scalable Algorithms for Approximate DNF Model Counting
- On the Approximation Relationship between Optimizing Ratio of Submodular (RS) and Difference of Submodular (DS) Functions