English
Related papers

Related papers: Beyond Token Length: Step Pruner for Efficient and…

200 papers

Large reasoning models (LRMs) have recently achieved significant progress in complex reasoning tasks, aided by reinforcement learning with verifiable rewards. However, LRMs often suffer from overthinking, expending excessive computation on…

Artificial Intelligence · Computer Science 2025-08-19 Chuhuai Yue , Chengqi Dong , Yinan Gao , Hang He , Jiajun Chai , Guojun Yin , Wei Lin

Large reasoning models (LRMs) have exhibited remarkable reasoning capabilities through inference-time scaling, but this progress has also introduced considerable redundancy and inefficiency into their reasoning processes, resulting in…

Artificial Intelligence · Computer Science 2025-07-18 Xingyang He , Xiao Ling , Jie Liu

Large reasoning models (LRMs) have recently shown promise in solving complex math problems when optimized with Reinforcement Learning (RL). But conventional approaches rely on outcome-only rewards that provide sparse feedback, resulting in…

Machine Learning · Computer Science 2025-08-01 Tao He , Rongchuan Mu , Lizi Liao , Yixin Cao , Ming Liu , Bing Qin

Large reasoning models (LRMs) achieve higher performance on challenging reasoning tasks by generating more tokens at inference time, but this verbosity often wastes computation on easy problems. Existing solutions, including supervised…

Artificial Intelligence · Computer Science 2025-06-09 Violet Xiang , Chase Blagden , Rafael Rafailov , Nathan Lile , Sang Truong , Chelsea Finn , Nick Haber

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) 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

Large reasoning models (LRMs) boosted by Reinforcement Learning from Verifier Reward (RLVR) have shown great power in problem solving, yet they often cause overthinking: excessive, meandering reasoning that inflates computational cost.…

Computation and Language · Computer Science 2025-10-13 Feifan Song , Shaohang Wei , Bofei Gao , Yejie Wang , Wen Luo , Wei Li , Linli Yao , Weimin Xiong , Liang Chen , Tianyu Liu , Houfeng Wang

Large language models (LLMs) show strong reasoning abilities but often produce unnecessarily long explanations that reduce efficiency. Although reinforcement learning (RL) has been used to improve reasoning, most methods focus on accuracy…

Machine Learning · Computer Science 2026-04-20 Hanbing Liu , Lang Cao , Yuanyi Ren , Mengyu Zhou , Haoyu Dong , Xiaojun Ma , Shi Han , Dongmei Zhang

Reinforcement Learning with Verifiable Rewards (RLVR) elicits long chain-of-thought reasoning in large language models (LLMs), but outcome-based rewards lead to coarse-grained advantage estimation. While existing approaches improve RLVR via…

Computation and Language · Computer Science 2026-01-08 Fei Wu , Zhenrong Zhang , Qikai Chang , Jianshu Zhang , Quan Liu , Jun Du

Recent advancements in large reasoning models (LRMs) have significantly enhanced language models' capabilities in complex problem-solving by emulating human-like deliberative thinking. However, these models often exhibit overthinking (i.e.,…

Artificial Intelligence · Computer Science 2025-06-19 Weixiang Zhao , Jiahe Guo , Yang Deng , Xingyu Sui , Yulin Hu , Yanyan Zhao , Wanxiang Che , Bing Qin , Tat-Seng Chua , Ting Liu

Parallel reasoning enhances Large Reasoning Models (LRMs) but incurs prohibitive costs due to futile paths caused by early errors. To mitigate this, path pruning at the prefix level is essential, yet existing research remains fragmented…

Computation and Language · Computer Science 2026-04-20 Jiaxi Bi , Tongxu Luo , Wenyu Du , Zhengyang Tang , Benyou Wang

Large language models (LLMs) have demonstrated significant advancements in reasoning capabilities, performing well on various challenging benchmarks. Techniques like Chain-of-Thought prompting have been introduced to further improve…

Computation and Language · Computer Science 2025-06-13 Zehui Ling , Deshu Chen , Hongwei Zhang , Yifeng Jiao , Xin Guo , Yuan Cheng

Recent years have seen considerable advancements in multi-step reasoning with Large Language Models (LLMs). The previous studies have elucidated the merits of integrating feedback or search mechanisms during model inference to improve the…

Computation and Language · Computer Science 2023-10-17 Qianli Ma , Haotian Zhou , Tingkai Liu , Jianbo Yuan , Pengfei Liu , Yang You , Hongxia Yang

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

A promising approach for improving reasoning in large language models is to use process reward models (PRMs). PRMs provide feedback at each step of a multi-step reasoning trace, potentially improving credit assignment over outcome reward…

Reinforcement learning (RL) has been widely used in training large language models (LLMs) for preventing unexpected outputs, eg reducing harmfulness and errors. However, existing RL methods mostly adopt the instance-level reward, which is…

Computation and Language · Computer Science 2024-06-18 Zhipeng Chen , Kun Zhou , Wayne Xin Zhao , Junchen Wan , Fuzheng Zhang , Di Zhang , Ji-Rong Wen

Recent research enhances language model reasoning by scaling test-time compute via longer chain-of-thought traces. This often improves accuracy but also introduces redundancy and high computational cost, especially for small language models…

Machine Learning · Computer Science 2025-05-26 Xuechen Zhang , Zijian Huang , Chenshun Ni , Ziyang Xiong , Jiasi Chen , Samet Oymak

Large language models (LLMs) inevitably make mistakes when performing step-by-step mathematical reasoning. Process Reward Models (PRMs) have emerged as a promising solution by evaluating each reasoning step. However, existing PRMs typically…

Computation and Language · Computer Science 2025-03-28 Shuaijie She , Junxiao Liu , Yifeng Liu , Jiajun Chen , Xin Huang , Shujian Huang

Large reasoning models improve with more test-time computation, but often overthink, producing unnecessarily long chains-of-thought that raise cost without improving accuracy. Prior reinforcement learning approaches typically rely on a…

Computation and Language · Computer Science 2026-03-03 Xintong Li , Sha Li , Rongmei Lin , Hongye Jin , Linwei Li , Hejie Cui , Sarah Zhang , Chia-Yuan Chang , Kewei Cheng , Besnik Fetahu , Priyanka Nigam , Jingbo Shang , Bing Yin

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
‹ Prev 1 2 3 10 Next ›