English
Related papers

Related papers: Fast and Simplex: 2-Simplicial Attention in Triton

200 papers

The interest in linear complexity models for large language models is on the rise, although their scaling capacity remains uncertain. In this study, we present the scaling laws for linear complexity language models to establish a foundation…

Computation and Language · Computer Science 2024-06-25 Xuyang Shen , Dong Li , Ruitao Leng , Zhen Qin , Weigao Sun , Yiran Zhong

A long-standing goal in both industry and academia is to develop an LLM inference platform that is portable across hardware architectures, eliminates the need for low-level hand-tuning, and still delivers best-in-class efficiency. In this…

Machine Learning · Computer Science 2025-11-18 Burkhard Ringlein , Jan van Lunteren , Radu Stoica , Thomas Parnell

Transformers with linear attention allow for efficient parallel training but can simultaneously be formulated as an RNN with 2D (matrix-valued) hidden states, thus enjoying linear-time inference complexity. However, linear attention…

Machine Learning · Computer Science 2024-08-28 Songlin Yang , Bailin Wang , Yikang Shen , Rameswar Panda , Yoon Kim

Processing 3D data efficiently has always been a challenge. Spatial operations on large-scale point clouds, stored as sparse data, require extra cost. Attracted by the success of transformers, researchers are using multi-head attention for…

Computer Vision and Pattern Recognition · Computer Science 2022-08-02 Mahdi Saleh , Yige Wang , Nassir Navab , Benjamin Busam , Federico Tombari

Previous research has explored the computational expressivity of Transformer models in simulating Boolean circuits or Turing machines. However, the learnability of these simulators from observational data has remained an open question. Our…

Machine Learning · Computer Science 2025-10-27 Morris Yau , Ekin Akyürek , Jiayuan Mao , Joshua B. Tenenbaum , Stefanie Jegelka , Jacob Andreas

The dominant sequence transduction models are based on complex recurrent or convolutional neural networks in an encoder-decoder configuration. The best performing models also connect the encoder and decoder through an attention mechanism.…

Computation and Language · Computer Science 2023-08-03 Ashish Vaswani , Noam Shazeer , Niki Parmar , Jakob Uszkoreit , Llion Jones , Aidan N. Gomez , Lukasz Kaiser , Illia Polosukhin

We describe an efficient hierarchical method to compute attention in the Transformer architecture. The proposed attention mechanism exploits a matrix structure similar to the Hierarchical Matrix (H-Matrix) developed by the numerical…

Machine Learning · Computer Science 2021-07-27 Zhenhai Zhu , Radu Soricut

Vision tokens in multimodal large language models often dominate huge computational overhead due to their excessive length compared to linguistic modality. Abundant recent methods aim to solve this problem with token pruning, which first…

Computation and Language · Computer Science 2025-06-10 Zichen Wen , Yifeng Gao , Shaobo Wang , Junyuan Zhang , Qintong Zhang , Weijia Li , Conghui He , Linfeng Zhang

Large language models (LLMs) are increasingly used across research and industry applications, yet their inference efficiency remains a significant challenge. As the computational power of modern GPU architectures continuously improves,…

Language models struggle to generalize beyond pretraining context lengths, limiting long-horizon reasoning and retrieval. Continued pretraining on long-context data can help but is expensive due to the quadratic scaling of Attention. We…

Computation and Language · Computer Science 2026-03-19 Sakshi Choudhary , Aditya Chattopadhyay , Luca Zancato , Elvis Nunez , Matthew Trager , Wei Xia , Stefano Soatto

Recent studies have demonstrated that the performance of transformers on the task of language modeling obeys a power-law relationship with model size over six orders of magnitude. While transformers exhibit impressive scaling, their…

Machine Learning · Computer Science 2021-10-07 Narsimha Chilkuri , Eric Hunsberger , Aaron Voelker , Gurshaant Malik , Chris Eliasmith

Transformers have achieved success in both language and vision domains. However, it is prohibitively expensive to scale them to long sequences such as long documents or high-resolution images, because self-attention mechanism has quadratic…

Computer Vision and Pattern Recognition · Computer Science 2021-12-08 Chen Zhu , Wei Ping , Chaowei Xiao , Mohammad Shoeybi , Tom Goldstein , Anima Anandkumar , Bryan Catanzaro

We present a novel bi-directional Transformer architecture (BiXT) which scales linearly with input size in terms of computational cost and memory consumption, but does not suffer the drop in performance or limitation to only one input…

Computer Vision and Pattern Recognition · Computer Science 2024-11-01 Markus Hiller , Krista A. Ehinger , Tom Drummond

As the context window expands, self-attention increasingly dominates the transformer's inference time. Therefore, accelerating attention computation while minimizing performance degradation is essential for the efficient deployment of Large…

Computation and Language · Computer Science 2025-03-14 Eli Sason , Darya Frolova , Boris Nazarov , Felix Goldberd

While Transformer networks benefit from a global receptive field, their quadratic cost relative to sequence length restricts their application to long sequences and high-resolution inputs. We introduce Fast Multipole Attention (FMA), a…

Computation and Language · Computer Science 2025-09-19 Yanming Kang , Giang Tran , Hans De Sterck

Transformers have demonstrated outstanding performance across a wide range of tasks, owing to their self-attention mechanism, but they are highly energy-consuming. Spiking Neural Networks have emerged as a promising energy-efficient…

Computer Vision and Pattern Recognition · Computer Science 2025-03-18 Yufei Guo , Xiaode Liu , Yuanpei Chen , Weihang Peng , Yuhan Zhang , Zhe Ma

The quadratic complexity of the attention mechanism represents one of the biggest hurdles for processing long sequences using Transformers. Current methods, relying on sparse representations or stateful recurrence, sacrifice token-to-token…

Machine Learning · Computer Science 2025-06-06 Tobias Christian Nauen , Sebastian Palacio , Andreas Dengel

The rapid advancement of Multimodal Large Language Models (MLLMs) has led to remarkable performances across various domains. However, this progress is accompanied by a substantial surge in the resource consumption of these models. We…

Computation and Language · Computer Science 2024-12-19 Dingjie Song , Wenjun Wang , Shunian Chen , Xidong Wang , Michael Guan , Benyou Wang

The recent surge of large language models (LLMs) highlights their ability to perform in-context learning, i.e., "learning" to perform a task from a few demonstrations in the context without any parameter updates. However, their capabilities…

Computation and Language · Computer Science 2023-07-07 Tianle Cai , Kaixuan Huang , Jason D. Lee , Mengdi Wang

Length Generalization is the essential capacity of autonomous agents to perform tasks in longer contexts than those encountered during training. To systematically study this feat, we test how well models can approximate the next token…