English
Related papers

Related papers: Lightweight Latent Reasoning for Narrative Tasks

200 papers

When writing and talking, people sometimes pause to think. Although reasoning-focused works have often framed reasoning as a method of answering questions or completing agentic tasks, reasoning is implicit in almost all written text. For…

Computation and Language · Computer Science 2024-03-19 Eric Zelikman , Georges Harik , Yijia Shao , Varuna Jayasiri , Nick Haber , Noah D. Goodman

Long-context reasoning has significantly empowered large language models (LLMs) to tackle complex tasks, yet it introduces severe efficiency bottlenecks due to the computational complexity. Existing efficient approaches often rely on…

Computation and Language · Computer Science 2026-02-03 Yibo Wang , Yongcheng Jing , Shunyu Liu , Hao Guan , Rong-cheng Tu , Chengyu Wang , Jun Huang , Dacheng Tao

Large language models (LLMs) have demonstrated strong reasoning abilities in mathematical tasks, often enhanced through reinforcement learning (RL). However, RL-trained models frequently produce unnecessarily long reasoning traces -- even…

Computation and Language · Computer Science 2025-05-27 Jinyan Su , Claire Cardie

Large Reasoning Models (LRMs) are Large Language Models (LLMs) explicitly trained to generate long-form Chain-of-Thoughts (CoTs), achieving impressive success on challenging tasks like math and programming. However, their underlying…

Reinforcement learning (RL) has increasingly become a pivotal technique in the post-training of large language models (LLMs). The effective exploration of the output space is essential for the success of RL. We observe that for complex…

Machine Learning · Computer Science 2025-07-08 Shihan Dou , Muling Wu , Jingwen Xu , Rui Zheng , Tao Gui , Qi Zhang , Xuanjing Huang

Recent advances in inference-time compute have significantly improved performance on complex tasks by generating long chains of thought (CoTs) using Large Reasoning Models (LRMs). However, this improved accuracy comes at the cost of high…

Machine Learning · Computer Science 2025-05-20 Rui Pan , Yinwei Dai , Zhihao Zhang , Gabriele Oliaro , Zhihao Jia , Ravi Netravali

Large Reasoning Models (LRMs) have achieved impressive performance on challenging tasks, yet their deep reasoning often incurs substantial computational costs. To achieve efficient reasoning, existing reinforcement learning methods still…

LLMs often need effective configurations, like temperature and reasoning steps, to handle tasks requiring sophisticated reasoning and problem-solving, ranging from joke generation to mathematical reasoning. Existing prompting approaches…

Artificial Intelligence · Computer Science 2025-10-13 Xiangqi Wang , Yue Huang , Yanbo Wang , Xiaonan Luo , Kehan Guo , Yujun Zhou , Xiangliang Zhang

Large Language Models (LLMs) often rely on long chain-of-thought (CoT) reasoning to solve complex tasks. While effective, these trajectories are frequently inefficient, leading to high latency from excessive token generation, or unstable…

Despite the recent advancement in Retrieval-Augmented Generation (RAG) systems, most retrieval methodologies are often developed for factual retrieval, which assumes query and positive documents are semantically similar. In this paper, we…

Information Retrieval · Computer Science 2025-04-10 Luo Ji , Feixiang Guo , Teng Chen , Qingqing Gu , Xiaoyu Wang , Ningyuan Xi , Yihong Wang , Peng Yu , Yue Zhao , Hongyang Lei , Zhonglin Jiang , Yong Chen

Recent Large Reasoning Models (LRMs), such as DeepSeek-R1 and OpenAI o1, have demonstrated strong performance gains by scaling up the length of Chain-of-Thought (CoT) reasoning during inference. However, a growing concern lies in their…

Supervised fine-tuning (SFT) has emerged as one of the most effective ways to improve the performance of large language models (LLMs) in downstream tasks. However, SFT can have difficulty generalizing when the underlying data distribution…

Computation and Language · Computer Science 2025-12-15 Mrinal Rawat , Arkajyoti Chakraborty , Neha Gupta , Roberto Pieraccini

While large language models (LLMs) have demonstrated impressive capabilities across tasks in language understanding and interactive decision making, their abilities for reasoning (e.g. chain-of-thought prompting) and acting (e.g. action…

Computation and Language · Computer Science 2023-03-13 Shunyu Yao , Jeffrey Zhao , Dian Yu , Nan Du , Izhak Shafran , Karthik Narasimhan , Yuan Cao

To improve the reasoning capabilities of large language models, test-time compute is typically scaled by generating intermediate tokens before the final answer. However, this couples reasoning to autoregressive generation and thereby…

Computation and Language · Computer Science 2026-05-29 Lukas Aichberger , Sepp Hochreiter

Large Language Models (LLMs) have shown impressive performance in reasoning tasks. However, LLMs tend to generate excessively long reasoning content, leading to significant computational overhead. Our observations indicate that even on…

Computation and Language · Computer Science 2025-05-21 Guochao Jiang , Guofeng Quan , Zepeng Ding , Ziqin Luo , Dixuan Wang , Zheng Hu

Large Language Models (LLMs) solve many reasoning tasks via chain-of-thought (CoT) prompting, but smaller models (about 7 to 8B parameters) still struggle with multi-step reasoning under tight compute and token budgets. Existing test time…

Computation and Language · Computer Science 2026-04-29 Sagnik Chatterjee , Atharva Patil , Sricharan Ramesh

While Chain-of-Thought (CoT) significantly enhances the performance of Large Language Models (LLMs), explicit reasoning chains introduce substantial computational redundancy. Recent latent reasoning methods attempt to mitigate this by…

Computation and Language · Computer Science 2026-02-02 Fanmeng Wang , Haotian Liu , Guojiang Zhao , Hongteng Xu , Zhifeng Gao

Large reasoning models (LRMs) achieve impressive reasoning capabilities by generating lengthy chain-of-thoughts, but this "overthinking" incurs high latency and cost without commensurate accuracy gains. In this work, we introduce AALC, a…

Computation and Language · Computer Science 2025-08-11 Ruosen Li , Ziming Luo , Quan Zhang , Ruochen Li , Ben Zhou , Ali Payani , Xinya Du

Reasoning language models such as DeepSeek-R1 produce long chain-of-thought traces during inference time which make them costly to deploy at scale. We show that using compression techniques such as neural network pruning produces greater…

Artificial Intelligence · Computer Science 2026-05-05 Ryan Lucas , Kayhan Behdin , Zhipeng Wang , Qingquan Song , Shao Tang , Rahul Mazumder

Large Language Models (LLMs) that can continually improve beyond their training budgets are able to solve increasingly difficult problems by adapting at test time, a property we refer to as extrapolation. However, standard reinforcement…

Machine Learning · Computer Science 2026-03-24 Ian Wu , Yuxiao Qu , Amrith Setlur , Aviral Kumar
‹ Prev 1 4 5 6 7 8 10 Next ›