English
Related papers

Related papers: APR: Penalizing Structural Redundancy in Large Rea…

200 papers

Recent advancements in large language models (LLMs) have shifted the post-training paradigm from traditional instruction tuning and human preference alignment toward reinforcement learning (RL) focused on reasoning capabilities. However,…

Artificial Intelligence · Computer Science 2025-11-12 Qianxi He , Qingyu Ren , Shanzhe Lei , Xuhong Wang , Yingchun Wang

Large Reasoning Models (LRMs) achieve explicit chain-of-thought expansion by imitating deep thinking behaviors of humans, demonstrating excellent performance in complex task scenarios. However, the deep-thinking mode often leads to…

Machine Learning · Computer Science 2026-01-30 Qian Wan , Ziao Xu , Luona Wei , Xiaoxuan Shen , Jianwen Sun

Process Reward Models (PRMs) have emerged as a promising approach to enhance the reasoning capabilities of large language models (LLMs) by guiding their step-by-step reasoning toward a final answer. However, existing PRMs either treat each…

Machine Learning · Computer Science 2026-03-02 Zheng Zhang , Ziwei Shan , Kaitao Song , Yexin Li , Kan Ren

Through reinforcement learning (RL) with outcome correctness rewards, large reasoning models (LRMs) with scaled inference computation have demonstrated substantial success on complex reasoning tasks. However, the one-sided reward, focused…

Computation and Language · Computer Science 2025-11-21 Jiashu Yao , Heyan Huang , Shuang Zeng , Chuwei Luo , WangJie You , Jie Tang , Qingsong Liu , Yuhang Guo , Yangyang Kang

Recent advances in large language models (LLMs) have demonstrated that reinforcement learning with verifiable rewards (RLVR) can significantly enhance reasoning abilities by directly optimizing correctness, rather than relying solely on…

Computer Vision and Pattern Recognition · Computer Science 2025-10-14 Minbin Huang , Runhui Huang , Chuanyang Zheng , Jingyao Li , Guoxuan Chen , Han Shi , Hong Cheng

Recent studies on post-training large language models (LLMs) for reasoning through reinforcement learning (RL) typically focus on tasks that can be accurately verified and rewarded, such as solving math problems. In contrast, our research…

Computation and Language · Computer Science 2025-05-29 Ang Lv , Ruobing Xie , Xingwu Sun , Zhanhui Kang , Rui Yan

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

Process Reward Models (PRMs) are a powerful mechanism for steering large language model reasoning by providing fine-grained, step-level supervision. However, this effectiveness comes at a significant cost: PRMs require expert annotations…

Machine Learning · Computer Science 2026-05-12 Artyom Gadetsky , Maxim Kodryan , Siba Smarak Panigrahi , Hang Guo , Maria Brbic

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

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) 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 language models (LLMs) achieve strong performance by generating long chains of thought, but longer traces always introduce redundant or ineffective reasoning steps. One typical behavior is that they often perform unnecessary…

Computation and Language · Computer Science 2026-01-13 Jinyi Han , Zixiang Di , Zishang Jiang , Ying Liao , Jiaqing Liang , Yongqi Wang , Yanghua Xiao

Large reasoning models (LRMs) are proficient at generating explicit, step-by-step reasoning sequences before producing final answers. However, such detailed reasoning can introduce substantial computational overhead and latency,…

Computation and Language · Computer Science 2025-10-10 Songjun Tu , Jiahao Lin , Qichao Zhang , Xiangyu Tian , Linjing Li , Xiangyuan Lan , Dongbin Zhao

Most reward models for visual generation reduce rich human judgments to a single unexplained score, discarding the reasoning that underlies preference. We show that teaching reward models to produce explicit, multi-dimensional critiques…

Artificial Intelligence · Computer Science 2026-04-15 Haozhe Wang , Cong Wei , Weiming Ren , Jiaming Liu , Fangzhen Lin , Wenhu Chen

Test-time scaling (TTS) for large language models (LLMs) has thus far fallen into two largely separate paradigms: (1) reinforcement learning (RL) methods that optimize sparse outcome-based rewards, yet suffer from instability and low sample…

Machine Learning · Computer Science 2026-02-10 Can Jin , Yang Zhou , Qixin Zhang , Hongwu Peng , Di Zhang , Zihan Dong , Marco Pavone , Ligong Han , Zhang-Wei Hong , Tong Che , Dimitris N. Metaxas

Reasoning in Large Language Models (LLMs) often suffers from inefficient long chain-of-thought traces with redundant self-exploration and validation, which inflate computational costs and even degrade performance. Inspired by human…

Artificial Intelligence · Computer Science 2026-02-17 Qianyue Wang , Jinwu Hu , Huanxiang Lin , Bolin Chen , Zhiquan Wen , Yaofo Chen , Yu Rong , Mingkui Tan

Large Reasoning Models (LRMs) have achieved remarkable success, yet they often suffer from producing unnecessary and verbose reasoning chains. We identify a core aspect of this issue as "invalid thinking" -- models tend to repeatedly…

Artificial Intelligence · Computer Science 2025-09-12 Zhengxiang Cheng , Dongping Chen , Mingyang Fu , Tianyi Zhou

Large Reasoning Models (LRMs) have demonstrated remarkable capabilities in solving complex problems by generating structured, step-by-step reasoning content. However, exposing a model's internal reasoning process introduces additional…

Artificial Intelligence · Computer Science 2026-05-20 Zheng Lin , Zhenxing Niu , Haoxuan Ji , Yuzhe Huang , Haichang Gao

Teaching large language models (LLMs) to reason during post-training typically relies on reinforcement learning with explicit outcome- or process-based reward functions. However, in many real-world settings, obtaining or defining such…

Artificial Intelligence · Computer Science 2026-05-19 Claudio Fanconi , Nicolás Astorga , Mihaela van der Schaar

Through reinforcement learning with verifiable rewards (RLVR), large language models have achieved substantial progress in domains with easily verifiable outcomes, such as mathematics and coding. However, when applied to more complex tasks…

Computation and Language · Computer Science 2025-10-01 Qiyao Ma , Yunsheng Shi , Hongtao Tian , Chao Wang , Weiming Chang , Ting Yao