English
Related papers

Related papers: Minimalist Softmax Attention Provably Learns Const…

200 papers

Large Audio-Language Models (LALMs) often suffer from audio-textual attention imbalance, prioritizing text over acoustic information, particularly in the multi-modal fusion layers of the Transformer architecture. This bias hinders their…

Sound · Computer Science 2025-09-24 Junyu Wang , Ziyang Ma , Zhengding Luo , Tianrui Wang , Meng Ge , Xiaobao Wang , Longbiao Wang

When and how can an attention mechanism learn to selectively attend to informative tokens, thereby enabling detection of weak, rare, and sparsely located features? We address these questions theoretically in a sparse-token classification…

Machine Learning · Computer Science 2025-09-30 Nicholas Barnfield , Hugo Cui , Yue M. Lu

Large language models (LLMs) have numerous real-life applications across various domains, such as natural language translation, sentiment analysis, language modeling, chatbots and conversational agents, creative writing, text…

Machine Learning · Computer Science 2025-02-18 Yeqi Gao , Zhao Song , Junze Yin

The restricted Boltzmann machine (RBM) is a flexible tool for modeling complex data, however there have been significant computational difficulties in using RBMs to model high-dimensional multinomial observations. In natural language…

Machine Learning · Computer Science 2012-07-06 George E. Dahl , Ryan P. Adams , Hugo Larochelle

Low-bit quantization of network weights and activations can drastically reduce the memory footprint, complexity, energy consumption and latency of Deep Neural Networks (DNNs). However, low-bit quantization can also cause a considerable drop…

Computer Vision and Pattern Recognition · Computer Science 2021-03-25 Ghouthi Boukli Hacene , Lukas Mauch , Stefan Uhlich , Fabien Cardinaux

Prompt-tuning is an emerging strategy to adapt large language models (LLM) to downstream tasks by learning a (soft-)prompt parameter from data. Despite its success in LLMs, there is limited theoretical understanding of the power of…

Machine Learning · Computer Science 2023-06-07 Samet Oymak , Ankit Singh Rawat , Mahdi Soltanolkotabi , Christos Thrampoulidis

It has been proved that almost all $n$-bit Boolean functions have exact classical query complexity $n$. However, the situation seemed to be very different when we deal with exact quantum query complexity. In this paper, we prove that almost…

Computational Complexity · Computer Science 2014-09-30 Andris Ambainis , Jozef Gruska , Shenggen Zheng

We establish the universal approximation capability of single-layer, single-head self- and cross-attention mechanisms with minimal attached structures. Our key insight is to interpret single-head attention as an input domain-partition…

Machine Learning · Computer Science 2025-04-29 Hude Liu , Jerry Yao-Chieh Hu , Zhao Song , Han Liu

We study the training dynamics of gradient descent in a softmax self-attention layer trained to perform linear regression and show that a simple first-order optimization algorithm can converge to the globally optimal self-attention…

Machine Learning · Computer Science 2026-03-03 Gautam Goel , Mahdi Soltanolkotabi , Peter Bartlett

Linearizing pretrained large language models (LLMs) primarily relies on intra-layer hybrid attention mechanisms to alleviate the quadratic complexity of standard softmax attention. Existing methods perform token routing based on…

Machine Learning · Computer Science 2026-02-03 Weikang Meng , Liangyu Huo , Yadan Luo , Jiawen Guan , Jingyi Zhang , Yingjian Li , Zheng Zhang

We give new quantum algorithms for evaluating composed functions whose inputs may be shared between bottom-level gates. Let $f$ be an $m$-bit Boolean function and consider an $n$-bit function $F$ obtained by applying $f$ to conjunctions of…

Quantum Physics · Physics 2021-09-22 Mark Bun , Robin Kothari , Justin Thaler

We address the problem of minimizing a smooth function $f^0(x)$ over a compact set $D$ defined by smooth functional constraints $f^i(x)\leq 0,~ i = 1,\ldots, m$ given noisy value measurements of $f^i(x)$. This problem arises in…

Optimization and Control · Mathematics 2019-12-20 Ilnura Usmanova , Andreas Krause , Maryam Kamgarpour

The attention mechanism in text generation is memory-bounded due to its sequential characteristics. Therefore, off-chip memory accesses should be minimized for faster execution. Although previous methods addressed this by pruning…

Hardware Architecture · Computer Science 2024-07-23 Junyoung Park , Myeonggu Kang , Yunki Han , Yanggon Kim , Jaekang Shin , Lee-Sup Kim

The Transformer model architecture has become one of the most widely used in deep learning and the attention mechanism is at its core. The standard attention formulation uses a softmax operation applied to a scaled dot product between query…

Machine Learning · Computer Science 2026-04-02 Hariprasath Govindarajan , Per Sidén , Jacob Roll , Fredrik Lindsten

The approximate degree of a Boolean function $f \colon \{-1, 1\}^n \rightarrow \{-1, 1\}$ is the least degree of a real polynomial that approximates $f$ pointwise to error at most $1/3$. We introduce a generic method for increasing the…

Computational Complexity · Computer Science 2017-03-20 Mark Bun , Justin Thaler

Non-local (NL) block is a popular module that demonstrates the capability to model global contexts. However, NL block generally has heavy computation and memory costs, so it is impractical to apply the block to high-resolution feature maps.…

Computer Vision and Pattern Recognition · Computer Science 2022-07-28 Yooshin Cho , Youngsoo Kim , Hanbyel Cho , Jaesung Ahn , Hyeong Gwon Hong , Junmo Kim

We describe a slightly sub-exponential time algorithm for learning parity functions in the presence of random classification noise. This results in a polynomial-time algorithm for the case of parity functions that depend on only the first…

Machine Learning · Computer Science 2007-05-23 Avrim Blum , Adam Kalai , Hal Wasserman

We study the dynamics of gradient flow for training a multi-head softmax attention model for in-context learning of multi-task linear regression. We establish the global convergence of gradient flow under suitable choices of initialization.…

Machine Learning · Computer Science 2024-06-11 Siyu Chen , Heejune Sheen , Tianhao Wang , Zhuoran Yang

There has recently been significant interest in training reinforcement learning (RL) agents in vision-based environments. This poses many challenges, such as high dimensionality and the potential for observational overfitting through…

Recent advances in large language models highlighted the excessive quadratic cost of self-attention. Despite the significant research efforts, subquadratic attention methods still suffer from inferior performance in practice. We hypothesize…

Machine Learning · Computer Science 2025-05-02 Piotr Piękos , Róbert Csordás , Jürgen Schmidhuber