English
Related papers

Related papers: Untied Ulysses: Memory-Efficient Context Paralleli…

200 papers

Large language models (LLMs) often struggle to accurately read and comprehend extremely long texts. Current methods for improvement typically rely on splitting long contexts into fixed-length chunks. However, fixed truncation risks…

Computation and Language · Computer Science 2025-06-04 Boheng Sheng , Jiacheng Yao , Meicong Zhang , Guoxiu He

Despite very fast progress, efficiently training large language models (LLMs) in very long contexts remains challenging. Existing methods fall back to training LLMs with short contexts (a maximum of a few thousands tokens in training) and…

Machine Learning · Computer Science 2025-01-03 Xingzi Xu , Amir Tavanaei , Kavosh Asadi , Karim Bouyarmane

Long-context large language models (LLMs) face constraints due to the quadratic complexity of the self-attention mechanism. The mainstream sequence parallelism (SP) method, Ring Attention, attempts to solve this by distributing the query…

Machine Learning · Computer Science 2025-10-10 Yida Wang , Ke Hong , Xiuhong Li , Yuanchao Xu , Wenxun Wang , Guohao Dai , Yu Wang

Large Language Models (LLMs) have made significant strides in natural language processing and generation, yet their ability to handle long-context input remains constrained by the quadratic complexity of attention computation and…

Computation and Language · Computer Science 2025-06-16 Manlai Liang , Wanyi Huang , Mandi Liu , Huaijun Li , Jinlong Li

Large vision-language models (LVLMs) employ multi-modal in-context learning (MM-ICL) to adapt to new tasks by leveraging demonstration examples. While increasing the number of demonstrations boosts performance, they incur significant…

Computer Vision and Pattern Recognition · Computer Science 2026-03-18 Shin'ya Yamaguchi , Daiki Chijiwa , Tamao Sakao , Taku Hasegawa

Typically, training LLMs with long context sizes is computationally expensive, requiring extensive training hours and GPU resources. Existing long-context extension methods usually need additional training procedures to support…

Computation and Language · Computer Science 2024-02-23 Jiaheng Liu , Zhiqi Bai , Yuanxing Zhang , Chenchen Zhang , Yu Zhang , Ge Zhang , Jiakai Wang , Haoran Que , Yukang Chen , Wenbo Su , Tiezheng Ge , Jie Fu , Wenhu Chen , Bo Zheng

Transformer models struggle with long-context inference due to their quadratic time and linear memory complexity. Recurrent Memory Transformers (RMTs) offer a solution by reducing the asymptotic cost to linear time and constant memory…

Machine Learning · Computer Science 2025-06-06 Danil Sivtsov , Ivan Rodkin , Gleb Kuzmin , Yuri Kuratov , Ivan Oseledets

As the ever-increasing token limits of large language models (LLMs) have enabled long context as input, prompting with single data samples might no longer an efficient way. A straightforward strategy improving efficiency is to batch data…

Computation and Language · Computer Science 2024-07-16 Jianzhe Lin , Maurice Diesendruck , Liang Du , Robin Abraham

Large language models (LLMs) now support context windows of hundreds of thousands to millions of tokens, enabling applications such as long-document summarization, large-scale code synthesis, multi-document question answering and persistent…

Computation and Language · Computer Science 2025-10-22 Siyuan Yan , Guo-Qing Jiang , Yuchen Zhang , Xiaoxing Ma , Ran Zhu , Chun Cao , Jingwei Xu

Modern large language models (LLMs) increasingly depends on efficient long-context processing and generation mechanisms, including sparse attention, retrieval-augmented generation (RAG), and compressed contextual memory, to support complex…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-12 Zifan He , Rui Ma , Yizhou Sun , Jason Cong

Linear-attention models that compress the entire input sequence into a fixed-size recurrent state offer an efficient alternative to Transformers, but their finite memory induces forgetfulness that harms retrieval-intensive tasks. To…

Computation and Language · Computer Science 2025-10-27 Mutian He , Philip N. Garner

Serving long-context LLMs is costly because attention computation grows linearly with context length. Dynamic sparse attention algorithms (DSAs) mitigate this by attending only to the key-value (KV) cache of critical tokens. However, with…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-30 Qihui Zhou , Peiqi Yin , Pengfei Zuo , James Cheng

Effective training of today's large language models (LLMs) depends on large batches and long sequences for throughput and accuracy. To handle variable-length sequences on hardware accelerators, it is common practice to introduce padding…

Computation and Language · Computer Science 2022-10-07 Mario Michael Krell , Matej Kosec , Sergio P. Perez , Andrew Fitzgibbon

This paper introduces a novel approach to enhance the capabilities of Large Language Models (LLMs) in processing and understanding extensive text sequences, a critical aspect in applications requiring deep comprehension and synthesis of…

Computation and Language · Computer Science 2023-12-15 Kaiqiang Song , Xiaoyang Wang , Sangwoo Cho , Xiaoman Pan , Dong Yu

Efficient attentions have greatly improved the computational efficiency of Transformers. However, most existing linear attention mechanisms suffer from an \emph{efficiency degradation} problem, leading to inefficiencies in causal language…

Computation and Language · Computer Science 2023-12-19 Jun Zhang , Shuyang Jiang , Jiangtao Feng , Lin Zheng , Lingpeng Kong

Empowering LLMs with the ability to precisely understand long contexts is crucial for many downstream applications. However, handling long contexts with conventional transformer architecture requires substantial training and inference…

Computation and Language · Computer Science 2024-12-24 Zhenyu Li , Yike Zhang , Tengyu Pan , Yutao Sun , Zhichao Duan , Junjie Fang , Rong Han , Zixuan Wang , Jianyong Wang

Large language models (LLMs) with long context windows have gained significant attention. However, the KV cache, stored to avoid re-computation, becomes a bottleneck. Various dynamic sparse or TopK-based attention approximation methods have…

Computation and Language · Computer Science 2024-12-19 Zhuoming Chen , Ranajoy Sadhukhan , Zihao Ye , Yang Zhou , Jianyu Zhang , Niklas Nolte , Yuandong Tian , Matthijs Douze , Leon Bottou , Zhihao Jia , Beidi Chen

Transformer-based models have emerged as a leading architecture for natural language processing, natural language generation, and image generation tasks. A fundamental element of the transformer architecture is self-attention, which allows…

Machine Learning · Computer Science 2025-07-01 Venmugil Elango

Deploying useful Long-Context Transformer Models (LCTMs) requires addressing two key challenges: (1) A growing memory footprint due to quadratic self-attention and linear KV-cache scaling in memory as sequence length increases; (2) the…

Computation and Language · Computer Science 2025-10-15 Baisub Lee , Sanghyun Byun , Mohanad Odema , Jung Guack , Jacob Song , Woo Seong Chung

Transformer-based language models have found many diverse applications requiring them to process sequences of increasing length. For these applications, the causal self-attention -- which is the only component scaling quadratically w.r.t.…

Machine Learning · Computer Science 2023-06-05 Matteo Pagliardini , Daniele Paliotta , Martin Jaggi , François Fleuret