English
Related papers

Related papers: Accelerating LLM Reasoning via Early Rejection wit…

200 papers

Process Reward Models (PRMs) aim to improve multi-step reasoning in Large Language Models (LLMs) by supervising intermediate steps and identifying errors. However, building effective PRMs remains challenging due to the lack of scalable,…

Artificial Intelligence · Computer Science 2025-10-17 Yao Zhang , Yu Wu , Haowei Zhang , Weiguo Li , Haokun Chen , Jingpei Wu , Guohao Li , Zhen Han , Volker Tresp

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

The development of reasoning capabilities represents a critical frontier in large language models (LLMs) research, where reinforcement learning (RL) and process reward models (PRMs) have emerged as predominant methodological frameworks.…

Artificial Intelligence · Computer Science 2025-12-09 Zhangying Feng , Qianglong Chen , Ning Lu , Yongqian Li , Siqi Cheng , Shuangmu Peng , Duyu Tang , Shengcai Liu , Zhirui Zhang

Reinforcement learning (RL) is a framework for solving sequential decision-making problems. In this work, we demonstrate that, surprisingly, RL emerges during the inference time of large language models (LLMs), a phenomenon we term…

Machine Learning · Computer Science 2026-04-28 Kefan Song , Amir Moeini , Peng Wang , Lei Gong , Rohan Chandra , Shangtong Zhang , Yanjun Qi

While Large Language Models (LLMs) have demonstrated strong math reasoning abilities through Reinforcement Learning with *Verifiable Rewards* (RLVR), many advanced mathematical problems are proof-based, with no guaranteed way to determine…

Computation and Language · Computer Science 2026-02-20 Haotong Yang , Zitong Wang , Shijia Kang , Siqi Yang , Wenkai Yu , Xu Niu , Yike Sun , Yi Hu , Zhouchen Lin , Muhan Zhang

Prompt optimization improves the reasoning abilities of large language models (LLMs) without requiring parameter updates to the target model. Following heuristic-based "Think step by step" approaches, the field has evolved in two main…

Computation and Language · Computer Science 2025-07-25 Andreea Nica , Ivan Zakazov , Nicolas Mario Baldwin , Saibo Geng , Robert West

Reinforcement learning (RL) can align language models with non-differentiable reward signals, such as human preferences. However, a major challenge arises from the sparsity of these reward signals - typically, there is only a single reward…

Computation and Language · Computer Science 2024-02-20 Meng Cao , Lei Shu , Lei Yu , Yun Zhu , Nevan Wichers , Yinxiao Liu , Lei Meng

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

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

Training large language models with reinforcement learning (RL) against verifiable rewards significantly enhances their reasoning abilities, yet remains computationally expensive due to inefficient uniform prompt sampling. We introduce…

Machine Learning · Computer Science 2026-03-06 Ruiqi Zhang , Daman Arora , Song Mei , Andrea Zanette

Recently, scaling test-time compute on Large Language Models (LLM) has garnered wide attention. However, there has been limited investigation of how various reasoning prompting strategies perform as scaling. In this paper, we focus on a…

Artificial Intelligence · Computer Science 2025-08-18 Yexiang Liu , Zekun Li , Zhi Fang , Nan Xu , Ran He , Tieniu Tan

Process Reward Models (PRMs) have become essential for improving Large Language Models (LLMs) via test-time scaling, yet their effectiveness in coding remains limited due to the lack of meaningful step decompositions in code and the noise…

Machine Learning · Computer Science 2025-12-18 Ruiyi Zhang , Peijia Qin , Qi Cao , Pengtao Xie

State-of-the-art language models can exhibit impressive reasoning refinement capabilities on math, science or coding tasks. However, recent work demonstrates that even the best models struggle to identify \textit{when and where to refine}…

Computation and Language · Computer Science 2024-06-26 Alex Havrilla , Sharath Raparthy , Christoforus Nalmpantis , Jane Dwivedi-Yu , Maksym Zhuravinskyi , Eric Hambro , Roberta Raileanu

The rapid advancement of Large Vision Language Models (LVLMs) has demonstrated excellent abilities in various visual tasks. Building upon these developments, the thinking with images paradigm has emerged, enabling models to dynamically edit…

Computer Vision and Pattern Recognition · Computer Science 2026-02-10 Yujin Zhou , Pengcheng Wen , Jiale Chen , Boqin Yin , Han Zhu , Jiaming Ji , Juntao Dai , Chi-Min Chan , Sirui Han

Process Reward Models (PRMs) provide step-level supervision to large language models (LLMs), but scaling up training data annotation remains challenging for both humans and LLMs. To address this limitation, we propose an active learning…

Machine Learning · Computer Science 2025-04-16 Keyu Duan , Zichen Liu , Xin Mao , Tianyu Pang , Changyu Chen , Qiguang Chen , Michael Qizhe Shieh , Longxu Dou

Large reasoning models (LRMs) achieve strong performance by producing long chains of thought, but their inference costs are high and often generate redundant reasoning. Small language models (SLMs) are far more efficient, yet struggle on…

Computation and Language · Computer Science 2026-02-06 Haojin Wang , Yike Wang , Shangbin Feng , Hannaneh Hajishirzi , Yulia Tsvetkov

Large language models (LLMs) are probabilistic in nature and perform more reliably when augmented with external information. As complex queries often require multi-step reasoning over the retrieved information, with no clear or…

Information Retrieval · Computer Science 2026-04-10 Roxana Petcu , Evangelos Kanoulas , Maarten de Rijke

While large language models (LLMs) have significantly advanced mathematical reasoning, Process Reward Models (PRMs) have been developed to evaluate the logical validity of reasoning steps. However, PRMs still struggle with…

Artificial Intelligence · Computer Science 2025-02-21 Jiachen Zhu , Congmin Zheng , Jianghao Lin , Kounianhua Du , Ying Wen , Yong Yu , Jun Wang , Weinan 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

Looped Language Models (LoopLMs) perform multi-step latent reasoning prior to token generation and outperform conventional LLMs on reasoning benchmarks at smaller parameter budgets. However, attempts to further improve LoopLM reasoning with…

Machine Learning · Computer Science 2026-05-29 Jonathan Williams , Esin Tureci
‹ Prev 1 4 5 6 7 8 10 Next ›