analiza aiqbench
This research proposes structured matrix scoring functions, specifically Block Tensor-Train and Multi-Level Low Rank variants, to mitigate information loss and lack of locality bias inherent in standard attention mechanisms. The approach demonstrates superior performance on high-dimensional regression tasks and improved scaling laws for language modeling while maintaining computational efficiency. These findings offer a viable pathway for enhancing attention mechanisms in scenarios requiring high-rank representations or distance-dependent compute biases.
Customizing the Inductive Biases of Softmax Attention using Structured Matrices
arXiv:2509.07963v2 Announce Type: replace Abstract: The core component of attention is the scoring function, which transforms the inputs into low-dimensional queries and keys and takes the dot product of each pair. While the low-dimensional projection improves efficiency, it causes information loss for certain tasks that have intrinsically high-dimensional inputs. Additionally, attention uses the same scoring function for all input pairs, without imposing a distance-dependent compute bias for neighboring tokens in the sequence. In this work, we address these shortcomings by proposing new scoring functions based on computationally efficient structured matrices with high ranks, including Block Tensor-Train (BTT) and contiguous Multi-Level Low Rank (MLR) matrices. On in-context regression tasks with high-dimensional inputs, our proposed scoring functions outperform standard attention for any fixed compute budget. On language modeling, a task that exhibits locality patterns, our MLR-based attention method achieves improved scaling laws compared to both standard attention and variants of sliding window attention. Additionally, we show that both BTT and MLR fall under a broader family of efficient structured matrices capable of encoding either full-rank or distance-dependent compute biases, thereby addressing significant shortcomings of standard attention. Finally, we show that MLR attention has promising results for long-range time-series forecasting.
Abstract:The core component of attention is the scoring function, which transforms the inputs into low-dimensional queries and keys and takes the dot product of each pair. While the low-dimensional projection improves efficiency, it causes information loss for certain tasks that have intrinsically high-dimensional inputs. Additionally, attention uses the same scoring function for all input pairs, without imposing a distance-dependent compute bias for neighboring tokens in the sequence. In this work, we address these shortcomings by proposing new scoring functions based on computationally efficient structured matrices with high ranks, including Block Tensor-Train (BTT) and contiguous Multi-Level Low Rank (MLR) matrices. On in-context regression tasks with high-dimensional inputs, our proposed scoring functions outperform standard attention for any fixed compute budget. On language modeling, a task that exhibits locality patterns, our MLR-based attention method achieves improved scaling laws compared to both standard attention and variants of sliding window attention. Additionally, we show that both BTT and MLR fall under a broader family of efficient structured matrices capable of encoding either full-rank or distance-dependent compute biases, thereby addressing significant shortcomings of standard attention. Finally, we show that MLR attention has promising results for long-range time-series forecasting.
ICML 2025. Code available at this https URL
Machine Learning (cs.LG)
arXiv:2509.07963 [cs.LG]
(or arXiv:2509.07963v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2509.07963 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 292 cuvinte
Subiecte conexe

Automating customer retention workflows in Amazon Quick
AWS · 29 iul. 2026

Structured outputs for Anthropic Claude models on Amazon Bedrock
AWS · 19 oct. 2026

Introducing Mistral OCR 4
Mistral AI · 23 iun. 2026

Building an Enterprise AI Customer Support Platform with Claude Fable 5.1 and Claude Code
Analytics Vidhya · 5 oct. 2026