English
Related papers

Related papers: Reuse, Don't Recompute: Efficient Large Reasoning …

200 papers

Large Reasoning Models (LRMs) have achieved remarkable performance on complex tasks by engaging in extended reasoning before producing final answers, yet this strength introduces the risk of overthinking, where excessive token generation…

Computation and Language · Computer Science 2025-06-25 Shu Yang , Junchao Wu , Xuansheng Wu , Derek Wong , Ninhao Liu , Di Wang

To break the context limits of large language models (LLMs) that bottleneck reasoning accuracy and efficiency, we propose the Thread Inference Model (TIM), a family of LLMs trained for recursive and decompositional problem solving, and…

Computation and Language · Computer Science 2025-07-23 Hongyin Luo , Nathaniel Morgan , Tina Li , Derek Zhao , Ai Vy Ngo , Philip Schroeder , Lijie Yang , Assaf Ben-Kish , Jack O'Brien , James Glass

Large Reasoning Models (LRMs) achieve strong performance by generating long chains of thought (CoT), but often overthink, continuing to reason after a solution has already stabilized and thereby wasting tokens and increasing latency.…

Computation and Language · Computer Science 2026-05-19 Dehai Min , Giovanni Vaccarino , Huiyi Chen , Yongliang Wu , Gal Yona , Lu Cheng

Long chain-of-thought (CoT) significantly enhances the reasoning capabilities of large language models (LLMs). However, extensive reasoning traces lead to inefficiencies and increased time-to-first-token (TTFT). We propose a training…

Computation and Language · Computer Science 2026-01-08 Roy Xie , David Qiu , Deepak Gopinath , Dong Lin , Yanchao Sun , Chong Wang , Saloni Potdar , Bhuwan Dhingra

Large Reasoning Models (LRMs) excel at complex reasoning but are traditionally evaluated in static, "frozen world" settings: model responses are assumed to be instantaneous, and the context of a request is presumed to be immutable over the…

Computation and Language · Computer Science 2025-10-17 Tsung-Han Wu , Mihran Miroyan , David M. Chan , Trevor Darrell , Narges Norouzi , Joseph E. Gonzalez

Large Reasoning Models (LRMs) perform strongly in complex reasoning tasks via Chain-of-Thought (CoT) prompting, but often suffer from verbose outputs, increasing computational overhead. Existing fine-tuning-based compression methods either…

Machine Learning · Computer Science 2025-09-22 Ziqing Qiao , Yongheng Deng , Jiali Zeng , Dong Wang , Lai Wei , Guanbo Wang , Fandong Meng , Jie Zhou , Ju Ren , Yaoxue Zhang

The performance gains of LLMs have historically been driven by scaling up model size and training data. However, the rapidly diminishing availability of high-quality training data is introducing a fundamental bottleneck, shifting the focus…

Computation and Language · Computer Science 2025-10-14 Zhichao Wang , Cheng Wan , Dong Nie

Personalized large language models (LLMs) rely on memory retrieval to incorporate user-specific histories, preferences, and contexts. Existing approaches either overload the LLM by feeding all the user's past memory into the prompt, which…

Information Retrieval · Computer Science 2026-03-11 Yingyi Zhang , Junyi Li , Wenlin Zhang , Penyue Jia , Xianneng Li , Yichao Wang , Derong Xu , Yi Wen , Huifeng Guo , Yong Liu , Xiangyu Zhao

A recent trend in LLMs is developing recurrent sub-quadratic models that improve long-context processing efficiency. We investigate leading large long-context models, focusing on how their fixed-size recurrent memory affects their…

Machine Learning · Computer Science 2025-09-10 Assaf Ben-Kish , Itamar Zimerman , M. Jehanzeb Mirza , Lior Wolf , James Glass , Leonid Karlinsky , Raja Giryes

Transformers have a quadratic scaling of computational complexity with input size, which limits the input context window size of large language models (LLMs) in both training and inference. Meanwhile, retrieval-augmented generation (RAG)…

Computation and Language · Computer Science 2024-10-18 Yimin Tang , Yurong Xu , Ning Yan , Masood Mortazavi

Large Language Models (LLMs) based on autoregressive, decoder-only Transformers generate text one token at a time, where a token represents a discrete unit of text. As each newly produced token is appended to the partial output sequence,…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-05-06 Dimitrios Kafetzis , Ramin Khalili , Iordanis Koutsopoulos

Large Reasoning Models (LRMs) excel at solving complex problems by explicitly generating a reasoning trace before deriving the final answer. However, these extended generations incur substantial memory footprint and computational overhead,…

Artificial Intelligence · Computer Science 2026-01-27 Zhenyuan Guo , Tong Chen , Wenlong Meng , Chen Gong , Xin Yu , Chengkun Wei , Wenzhi Chen

Modern large language models (LLMs) excel at tasks that require storing and retrieving knowledge, such as factual recall and question answering. Transformers are central to this capability because they can encode information during training…

Machine Learning · Statistics 2026-03-18 Nuri Mert Vural , Alberto Bietti , Mahdi Soltanolkotabi , Denny Wu

Automatic prompt engineering aims to enhance the generation quality of large language models (LLMs). Recent works utilize feedbacks generated from erroneous cases to guide the prompt optimization. During inference, they may further retrieve…

Computation and Language · Computer Science 2025-05-28 Cilin Yan , Jingyun Wang , Lin Zhang , Ruihui Zhao , Xiaopu Wu , Kai Xiong , Qingsong Liu , Guoliang Kang , Yangyang Kang

Large Language Model-based generative recommendation (LLMRec) has achieved notable success, but it suffers from high inference latency due to massive computational overhead and memory pressure of KV Cache. Existing KV Cache reduction…

Information Retrieval · Computer Science 2025-07-02 Chaoqun Yang , Xinyu Lin , Wenjie Wang , Yongqi Li , Teng Sun , Xianjing Han , Tat-Seng Chua

Recent Large Reasoning Models (LRMs) have shown substantially improved reasoning capabilities over traditional Large Language Models (LLMs) by incorporating extended thinking processes prior to producing final responses. However,…

Computation and Language · Computer Science 2025-05-22 Lingjie Jiang , Xun Wu , Shaohan Huang , Qingxiu Dong , Zewen Chi , Li Dong , Xingxing Zhang , Tengchao Lv , Lei Cui , Furu Wei

Modern language models (LMs) exhibit strong deductive reasoning capabilities, yet standard evaluations emphasize correctness while overlooking a key aspect of reasoning: efficiency. In real-world reasoning scenarios, much of the available…

Large Language Models are growing in size, and we expect them to continue to do so, as larger models train quicker. However, this increase in size will severely impact inference costs. Therefore model compression is important, to retain the…

Machine Learning · Computer Science 2024-04-10 Georgy Tyukin

Large Language Models (LLMs) deliver strong performance but incur high inference cost in real-world services, especially under workloads with repeated or near-duplicate queries across users and sessions. In this work, we propose MemBoost, a…

Computation and Language · Computer Science 2026-03-30 Joris Köster , Zixuan Liu , Siavash Khajavi , Zizhan Zheng

Reward modeling is essential for aligning large language models with human preferences through reinforcement learning. To provide accurate reward signals, a reward model (RM) should stimulate deep thinking and conduct interpretable…

Computation and Language · Computer Science 2026-03-09 Xiusi Chen , Gaotang Li , Ziqi Wang , Bowen Jin , Cheng Qian , Yu Wang , Hongru Wang , Yu Zhang , Denghui Zhang , Tong Zhang , Hanghang Tong , Heng Ji