English
Related papers

Related papers: Cut Your Losses! Learning to Prune Paths Early for…

200 papers

Large Reasoning Models (LRMs) demonstrate strong performance on complex tasks but often suffer from excessive verbosity, known as "overthinking." Existing solutions via reinforcement learning (RL) typically penalize generated tokens to…

Computation and Language · Computer Science 2025-12-02 Canhui Wu , Qiong Cao , Chang Li , Zhenfang Wang , Chao Xue , Yuwei Fan , Wei Xi , Xiaodong He

Long chain-of-thought (Long CoT) reasoning improves performance on multi-step problems, but it also induces overthinking: models often generate low-yield reasoning that increases inference cost and latency. This inefficiency is especially…

Computation and Language · Computer Science 2026-05-14 Chenjun Xu , Zhennan Zhou , Zhan Su , Bill Howe , Lucy Lu Wang , Bingbing Wen

Parallel scaling has emerged as a powerful paradigm to enhance reasoning capabilities in large language models (LLMs) by generating multiple Chain-of-Thought (CoT) traces simultaneously. However, this approach introduces significant…

Computation and Language · Computer Science 2026-04-17 Shangqing Tu , Yaxuan Li , Yushi Bai , Lei Hou , Juanzi Li

Large language models (LLMs) are increasingly costly to deploy, motivating extensive research on model pruning. However, most existing studies focus on instruction-following LLMs, leaving it unclear whether established pruning strategies…

Machine Learning · Computer Science 2026-01-27 Longwei Ding , Anhao Zhao , Fanghua Ye , Ziyang Chen , Xiaoyu Shen

Reasoning LLMs (RLMs) such as OpenAI o1, DeepSeek-R1, and Qwen3 deliver strong multi-step reasoning through chain-of-thought generation, but their large model sizes and lengthy decode-time outputs make them costly to deploy and unsuitable…

Computation and Language · Computer Science 2025-12-03 Ziyan Wang , Enmao Diao , Qi Le , Pu Wang , Guanchu Wang , Minwoo Lee , Shu-ping Yeh , Li Yang

Large Language Models (LLMs) can enhance reasoning capabilities through test-time scaling by generating multiple traces. However, the combination of lengthy reasoning traces with multiple sampling introduces substantial computation and high…

Machine Learning · Computer Science 2026-04-29 Zhixiang Liang , Beichen Huang , Zheng Wang , Minjia Zhang

Tree-of-Thought (ToT) reasoning boosts the problem-solving abilities of Large Language Models (LLMs) but is computationally expensive due to semantic redundancy, where distinct branches explore equivalent reasoning paths. We introduce…

Computation and Language · Computer Science 2025-12-09 Joongho Kim , Xirui Huang , Zarreen Reza , Gabriel Grand

Recently, large language models (LLMs) have demonstrated superior performance across various tasks by adhering to scaling laws, which significantly increase model size. However, the huge computation overhead during inference hinders the…

Computation and Language · Computer Science 2024-12-17 Zekai Li , Jintu Zheng , Ji Liu , Han Liu , Haowei Zhu , Zeping Li , Fuwei Yang , Haiduo Huang , Jinzhang Peng , Dong Li , Lu Tian , Emad Barsoum

Large Reasoning Models (LRMs) have demonstrated remarkable capabilities by scaling up the length of Chain-of-Thought (CoT). However, excessively long reasoning traces pose substantial challenges for training cost and inference latency.…

Machine Learning · Computer Science 2026-01-09 Wenhao Zeng , Yaoning Wang , Chao Hu , Yuling Shi , Chengcheng Wan , Hongyu Zhang , Xiaodong Gu

Recent large language models have shown promising capabilities in long-form reasoning, following structured chains of thought before arriving at a final answer. However, we observe that these reasoning paths tend to include substantial…

Large reasoning models (LRMs) achieve state-of-the-art performance by generating long chains-of-thought, but often waste computation on redundant reasoning after the correct answer has already been reached. We introduce Early-Stopping for…

Artificial Intelligence · Computer Science 2026-02-11 Junda Wang , Zhichao Yang , Dongxu Zhang , Sanjit Singh Batra , Robert E. Tillman

While Large Reasoning Models (LRMs) have demonstrated success in complex reasoning tasks through long chain-of-thought (CoT) reasoning, their inference often involves excessively verbose reasoning traces, resulting in substantial…

Computation and Language · Computer Science 2026-04-28 Yuxuan Jiang , Dawei Li , Francis Ferraro

Large reasoning models (LRMs) excel at complex reasoning tasks but typically generate lengthy sequential chains-of-thought, resulting in long inference times before arriving at the final answer. To address this challenge, we introduce…

Artificial Intelligence · Computer Science 2025-12-04 Emil Biju , Shayan Talaei , Zhemin Huang , Mohammadreza Pourreza , Azalia Mirhoseini , Amin Saberi

Long-context inference enhances the reasoning capability of Large Language Models (LLMs), but incurs significant computational overhead. Token-oriented methods, such as pruning and skipping, have shown great promise in reducing inference…

Computation and Language · Computer Science 2026-02-03 Zimeng Wu , Donghao Wang , Chaozhe Jin , Jiaxin Chen , Yunhong Wang

Large reasoning models (LRMs) often consume excessive tokens, inflating computational cost and latency. More broadly, in goal reaching sequential decision problems we often want to reach the goal quickly, and LRM reasoning can be viewed…

Machine Learning · Computer Science 2026-05-27 Alex Ayoub , Kavosh Asadi , Dale Schuurmans , Csaba Szepesvári , Karim Bouyarmane

Large language models (LLMs) have proven to be highly effective across various natural language processing tasks. However, their large number of parameters poses significant challenges for practical deployment. Pruning, a technique aimed at…

Computation and Language · Computer Science 2024-12-16 Jiwon Song , Kyungseok Oh , Taesu Kim , Hyungjun Kim , Yulhwa Kim , Jae-Joon Kim

Although LLMs have demonstrated improved performance by scaling parallel test-time compute, doing so relies on generating reasoning paths that are both diverse and accurate. For challenging problems, the forking tokens that trigger diverse…

Computation and Language · Computer Science 2026-03-03 Sheng Jia , Xiao Wang , Shiva Prasad Kasiviswanathan

Parallel thinking has emerged as a promising paradigm for reasoning, yet it imposes significant computational burdens. Existing efficiency methods primarily rely on local, per-trajectory signals and lack principled mechanisms to exploit…

Computation and Language · Computer Science 2026-02-12 Tong Zheng , Chengsong Huang , Runpeng Dai , Yun He , Rui Liu , Xin Ni , Huiwen Bao , Kaishen Wang , Hongtu Zhu , Jiaxin Huang , Furong Huang , Heng Huang

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

Instruction tuning has optimized the specialized capabilities of large language models (LLMs), but it often requires extensive datasets and prolonged training times. The challenge lies in developing specific capabilities by identifying…

Computation and Language · Computer Science 2026-05-26 Run Zou , Jianhang Ding , Yifan Ding , Wen Wu , Hao Chen , Renshu Gu
‹ Prev 1 2 3 10 Next ›