English
Related papers

Related papers: CoLT5: Faster Long-Range Transformers with Conditi…

200 papers

Recent work has shown that either (1) increasing the input length or (2) increasing model size can improve the performance of Transformer-based neural models. In this paper, we present a new model, called LongT5, with which we explore the…

Computation and Language · Computer Science 2022-05-04 Mandy Guo , Joshua Ainslie , David Uthus , Santiago Ontanon , Jianmo Ni , Yun-Hsuan Sung , Yinfei Yang

We present our work on developing a multilingual, efficient text-to-text transformer that is suitable for handling long inputs. This model, called mLongT5, builds upon the architecture of LongT5, while leveraging the multilingual datasets…

Computation and Language · Computer Science 2023-10-30 David Uthus , Santiago Ontañón , Joshua Ainslie , Mandy Guo

Transformer is a powerful model for text understanding. However, it is inefficient due to its quadratic complexity to input sequence length. Although there are many methods on Transformer acceleration, they are still either inefficient on…

Computation and Language · Computer Science 2021-09-07 Chuhan Wu , Fangzhao Wu , Tao Qi , Yongfeng Huang , Xing Xie

Chain-of-Thought (CoT) is a critical technique in enhancing the reasoning ability of Large Language Models (LLMs), and latent reasoning methods have been proposed to accelerate the inefficient token-level reasoning chain. We notice that…

Computation and Language · Computer Science 2026-02-05 Fangwei Zhu , Zhifang Sui

Lengthy documents pose a unique challenge to neural language models due to substantial memory consumption. While existing state-of-the-art (SOTA) models segment long texts into equal-length snippets (e.g., 128 tokens per snippet) or deploy…

Computation and Language · Computer Science 2024-05-14 Guangzeng Han , Jack Tsao , Xiaolei Huang

Large Language Models (LLMs) are pivotal in advancing natural language processing but often struggle with complex reasoning tasks due to inefficient attention distributions. In this paper, we explore the effect of increased computed tokens…

Computation and Language · Computer Science 2024-06-25 Bingli Liao , Danilo Vasconcellos Vargas

The quadratic complexity of self-attention in Transformers has hindered the processing of long text. To alleviate this problem, previous works have proposed to sparsify the attention matrix, taking advantage of the observation that crucial…

Computation and Language · Computer Science 2024-01-12 Ziwei He , Jian Yuan , Le Zhou , Jingwen Leng , Bo Jiang

The quadratic complexity and indefinitely growing key-value (KV) cache of standard Transformers pose a major barrier to long-context processing. To overcome this, we introduce the Collaborative Memory Transformer (CoMeT), a novel…

Machine Learning · Computer Science 2026-04-20 Runsong Zhao , Shilei Liu , Jiwei Tang , Langming Liu , Haibin Chen , Weidong Zhang , Yujin Yuan , Tong Xiao , Jingbo Zhu , Wenbo Su , Bo Zheng

With the rapid advancement of large reasoning models, long Chain-of-Thought (CoT) prompting has demonstrated strong performance on complex tasks. However, this often comes with a significant increase in token usage. In this paper, we…

Computation and Language · Computer Science 2025-06-05 Ruiqi Zhang , Changyi Xiao , Yixin Cao

Pretrained transformer models have achieved state-of-the-art results in many tasks and benchmarks recently. Many state-of-the-art Language Models (LMs), however, do not scale well above the threshold of 512 input tokens. In specialized…

Computation and Language · Computer Science 2022-12-01 Joel Niklaus , Daniele Giofré

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

Reasoning-oriented Large Language Models (LLMs) often rely on generating explicit tokens step by step, and their effectiveness typically hinges on large-scale supervised fine-tuning or reinforcement learning. While Chain-of-Thought (CoT)…

Computation and Language · Computer Science 2025-09-30 Haoyu Zheng , Zhuonan Wang , Yuqian Yuan , Tianwei Lin , Wenqiao Zhang , Zheqi Lv , Juncheng Li , Siliang Tang , Yueting Zhuang , Hongyang He

Large Language Models (LLMs) have demonstrated remarkable capabilities in handling long texts and have almost perfect performance in traditional retrieval tasks. However, their performance significantly degrades when it comes to numerical…

Computation and Language · Computer Science 2024-12-05 Yijiong Yu

Test-time scaling improves the reasoning capabilities of large language models (LLMs) by allocating extra compute to generate longer Chains-of-Thoughts (CoTs). This enables models to tackle more complex problem by breaking them down into…

Artificial Intelligence · Computer Science 2026-03-03 Adel Javanmard , Baharan Mirzasoleiman , Vahab Mirrokni

Language Models are the underpin of all modern Natural Language Processing (NLP) tasks. The introduction of the Transformers architecture has contributed significantly into making Language Modeling very effective across many NLP task,…

Computation and Language · Computer Science 2021-11-05 Nikolaos Stylianou , Ioannis Vlahavas

Large language models have an exceptional capability to incorporate new information in a contextual manner. However, the full potential of such an approach is often restrained due to a limitation in the effective context length. One…

Computation and Language · Computer Science 2023-12-01 Szymon Tworkowski , Konrad Staniszewski , Mikołaj Pacek , Yuhuai Wu , Henryk Michalewski , Piotr Miłoś

Scaling language models to larger and deeper sizes has led to significant boosts in performance. Even though the size of these models limits their application in compute-constrained environments, the race to continually develop ever larger…

Computation and Language · Computer Science 2024-08-16 Amirkeivan Mohtashami , Matteo Pagliardini , Martin Jaggi

Scaling large language models by increasing parameters and training data is increasingly constrained by limited high-quality corpora and rising communication costs. This work explores an alternative axis: increasing per-token computation…

Computation and Language · Computer Science 2026-03-11 Boyi Zeng , Yiqin Hao , He Li , Shixiang Song , Feichen Song , Zitong Wang , Siyuan Huang , Yi Xu , ZiWei He , Xinbing Wang , Zhouhan Lin

Recent large language models support inputs of up to 10 million tokens, yet they perform poorly on long-context tasks that require complex reasoning. Such tasks can be solved using only a subset of the input -- a proxy context -- rather…

Computation and Language · Computer Science 2026-05-25 Miao Li , Irina Saparina , Alexander Gurung , Mirella Lapata

This study delves into the capabilities and limitations of Large Language Models (LLMs) in the challenging domain of conditional question-answering. Utilizing the Conditional Question Answering (CQA) dataset and focusing on generative…

Computation and Language · Computer Science 2023-12-05 Syed-Amad Hussain , Parag Pravin Dakle , SaiKrishna Rallabandi , Preethi Raghavan
‹ Prev 1 2 3 10 Next ›