English
Related papers

Related papers: OPV: Outcome-based Process Verifier for Efficient …

200 papers

Large language models (LLMs) often struggle with maintaining accuracy throughout multiple multiple reasoning steps, especially in mathematical reasoning where an error in earlier steps can propagate to subsequent ones and it ultimately…

Artificial Intelligence · Computer Science 2024-04-02 Fei Yu , Anningzhe Gao , Benyou Wang

Recent work on reinforcement learning with verifiable rewards (RLVR) has shown that large language models (LLMs) can be substantially improved using outcome-level verification signals, such as unit tests for code or exact-match checks for…

Computation and Language · Computer Science 2026-01-27 Massimiliano Pronesti , Anya Belz , Yufang Hou

Recent breakthroughs in large language models (LLMs) have led to notable successes in complex reasoning tasks, such as mathematical problem solving. A common strategy for improving performance is parallel thinking, in which multiple…

Machine Learning · Computer Science 2026-03-03 Zhan Zhuang , Xiequn Wang , Zebin Chen , Feiyang Ye , Ying Wei , Kede Ma , Yu Zhang

In this work, we propose a novel method named \textbf{Auto}mated \textbf{P}rocess-\textbf{S}upervised \textbf{V}erifier (\textbf{\textsc{AutoPSV}}) to enhance the reasoning capabilities of large language models (LLMs) by automatically…

Computation and Language · Computer Science 2024-10-25 Jianqiao Lu , Zhiyang Dou , Hongru Wang , Zeyu Cao , Jianbo Dai , Yingjia Wan , Zhijiang Guo

Large Language Models (LLMs) have achieved remarkable success on reasoning benchmarks through Reinforcement Learning with Verifiable Rewards (RLVR), excelling at tasks such as math, coding, logic, and puzzles. However, existing benchmarks…

Artificial Intelligence · Computer Science 2026-05-12 Xiaozhe Li , Xinyu Fang , Shengyuan Ding , Yang Li , Linyang Li , Haodong Duan , Qingwen Liu , Kai Chen

Reinforcement learning from verifiable rewards (RLVR) has improved the reasoning abilities of large language models (LLMs), but most existing approaches rely on sparse outcome-level feedback. This sparsity creates a credit assignment…

Artificial Intelligence · Computer Science 2026-05-28 Huining Yuan , Zelai Xu , Huaijie Wang , Xiangmin Yi , Jiaxuan Gao , Xiao-Ping Zhang , Yu Wang , Chao Yu , Yi Wu

Despite significant advancements in the general capability of large language models (LLMs), they continue to struggle with consistent and accurate reasoning, especially in complex tasks such as mathematical and code reasoning. One key…

Machine Learning · Computer Science 2024-10-10 Zhenwen Liang , Ye Liu , Tong Niu , Xiangliang Zhang , Yingbo Zhou , Semih Yavuz

Vision-language process reward models (VL-PRMs) are increasingly used to score intermediate reasoning steps and rerank candidates under test-time scaling. However, they often function as black-box judges: a low step score may reflect a…

Computer Vision and Pattern Recognition · Computer Science 2026-05-12 Junxin Wang , Dai Guan , Weijie Qiu , Zhihang Li , Yongbo Gai , Zhengyi Yang , Mengyu Zhou , Erchao Zhao , Xiaoxi Jiang , Guanjun Jiang

Large Language Models excel at code generation yet struggle with complex programming tasks that demand sophisticated reasoning. To bridge this gap, traditional process supervision relies on learned reward models requiring costly training…

Computation and Language · Computer Science 2025-06-09 Zhuohao Yu , Weizheng Gu , Yidong Wang , Xingru Jiang , Zhengran Zeng , Jindong Wang , Wei Ye , Shikun Zhang

Process Reward Models (PRMs) have emerged as a promising approach for improving LLM reasoning capabilities by providing process supervision over reasoning traces. However, existing approaches for constructing PRM training data remain costly…

Computation and Language · Computer Science 2026-04-10 Ryo Kamoi , Yusen Zhang , Nan Zhang , Sarkar Snigdha Sarathi Das , Ranran Haoran Zhang , Wenpeng Yin , Rui Zhang

Step-by-step verifiers -- also known as process reward models (PRMs) -- are a key ingredient for test-time scaling. PRMs require step-level supervision, making them expensive to train. This work aims to build data-efficient PRMs as…

Machine Learning · Computer Science 2025-12-09 Muhammad Khalifa , Rishabh Agarwal , Lajanugen Logeswaran , Jaekyeom Kim , Hao Peng , Moontae Lee , Honglak Lee , Lu Wang

The remarkable reasoning and code generation capabilities of large language models (LLMs) have recently motivated increasing interest in automating formal verification (FV), a process that ensures hardware correctness through mathematically…

Hardware Architecture · Computer Science 2026-04-07 Lily Jiaxin Wan , Chia-Tung Ho , Yunsheng Bai , Cunxi Yu , Deming Chen , Haoxing Ren

Recent advances in Large Language Models (LLMs) have shown that their reasoning capabilities can be significantly improved through Reinforcement Learning with Verifiable Reward (RLVR), particularly in domains like mathematics and…

Large Language Models (LLMs) increasingly rely on external tools such as search engines to solve complex agentic tasks that require reasoning and external knowledge retrieval. Recently, reinforcement learning with verifiable rewards (RLVR)…

Artificial Intelligence · Computer Science 2025-10-01 Peiran Xu , Zhuohao Li , Xiaoying Xing , Guannan Zhang , Debiao Li , Kunyu Shi

Today's programmers face a false choice between creating software that is extensible and software that is correct. Specifically, dynamic languages permit software that is richly extensible (via dynamic code loading, dynamic object…

Programming Languages · Computer Science 2016-08-23 Matthew A. Hammer , Bor-Yuh Evan Chang , David Van Horn

Reinforcement Learning with Verifiable Rewards (RLVR) improves final-answer accuracy on reasoning tasks, but it does not reliably improve reasoning quality. Because outcome rewards only assess final answers, they also reward spurious…

Machine Learning · Computer Science 2026-05-19 Chenlu Ye , Zhou Yu , Ziji Zhang , Hao Chen , Narayanan Sadagopan , Jing Huang , Tong Zhang , Anurag Beniwal

Large Language Models (LLMs) have demonstrated remarkable potential in handling complex reasoning tasks by generating step-by-step rationales.Some methods have proven effective in boosting accuracy by introducing extra verifiers to assess…

Computation and Language · Computer Science 2024-07-02 Mingqian He , Yongliang Shen , Wenqi Zhang , Zeqi Tan , Weiming Lu

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…

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) demonstrate enhanced capabilities and reliability by reasoning more, evolving from Chain-of-Thought prompting to product-level solutions like OpenAI o1. Despite various efforts to improve LLM reasoning,…

Computer Vision and Pattern Recognition · Computer Science 2025-05-05 Yuhao Dong , Zuyan Liu , Hai-Long Sun , Jingkang Yang , Winston Hu , Yongming Rao , Ziwei Liu
‹ Prev 1 2 3 10 Next ›