Softmax Attention with Any Temperature in Fixed Dimension: Matching the Best Known Maximum-Inner-Product Bounds
cs.DS, cs.CC, cs.CG, cs.LG
Submitted: 2026-11-04
Updated: 2026-11-04
Terminology
Sources
- Furthest Pair Requires Quadratic Time in Superconstant Dimension under SETH
- Fast Transformer Decoding: One Write-Head is All You Need
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time