English
Related papers

Related papers: Truncated Step-Level Sampling with Process Rewards…

200 papers

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 Language Models (LLMs) are prone to hallucination, especially during multi-hop and reasoning-intensive tasks such as mathematical problem solving. While Outcome Reward Models verify only final answers, Process Reward Models (PRMs)…

Computation and Language · Computer Science 2025-05-27 Tej Deep Pala , Panshul Sharma , Amir Zadeh , Chuan Li , Soujanya Poria

Retrieval-Augmented Generation (RAG) systems for Large Language Models (LLMs) hold promise in knowledge-intensive tasks but face limitations in complex multi-step reasoning. While recent methods have integrated RAG with chain-of-thought…

Computation and Language · Computer Science 2025-01-15 Zhongxiang Sun , Qipeng Wang , Weijie Yu , Xiaoxue Zang , Kai Zheng , Jun Xu , Xiao Zhang , Song Yang , Han Li

Achieving both accuracy and diverse reasoning remains challenging for Large Language Models (LLMs) in complex domains like mathematics. A key bottleneck is evaluating intermediate reasoning steps to guide generation without costly human…

Machine Learning · Computer Science 2025-10-14 Adam Younsi , Ahmed Attia , Abdalgader Abubaker , Mohamed El Amine Seddik , Hakim Hacid , Salem Lahlou

Reinforcement learning (RL) has become a promising paradigm for optimizing Retrieval-Augmented Generation (RAG) in complex reasoning tasks. However, traditional outcome-based RL approaches often suffer from reward sparsity and inefficient…

Artificial Intelligence · Computer Science 2026-01-30 Zhao Wang , Ziliang Zhao , Zhicheng Dou

Reinforcement Learning (RL) has proven highly effective in aligning Large Language Models (LLMs) with human preferences. Typical RL methods optimize under an overall sequence reward, which can lead to a suboptimal learning process. This…

Machine Learning · Computer Science 2025-02-26 Yanshi Li , Shaopan Xiong , Gengru Chen , Xiaoyang Li , Yijia Luo , Xingyuan Bu , Yingshui Tan , Wenbo Su , Bo Zheng

Recent advancements in reasoning-focused language models such as OpenAI's O1 and DeepSeek-R1 have shown that scaling test-time computation-through chain-of-thought reasoning and iterative exploration-can yield substantial improvements on…

Recent methodologies in LLM self-training mostly rely on LLM generating responses and filtering those with correct output answers as training data. This approach often yields a low-quality fine-tuning training set (e.g., incorrect plans or…

Computation and Language · Computer Science 2024-11-19 Dan Zhang , Sining Zhoubian , Ziniu Hu , Yisong Yue , Yuxiao Dong , Jie Tang

Recent advances in sparse reward policy gradient methods have enabled effective reinforcement learning (RL)-based language model post-training. However, for reasoning tasks such as mathematical problem solving, binarized outcome rewards…

Artificial Intelligence · Computer Science 2026-05-26 Yongjae Lee , Taekhyun Park , Sunghyun Sim , Hyerim Bae

Self-consistency boosts inference-time performance by sampling multiple reasoning traces in parallel and voting. However, in constrained domains like math and code, this strategy is compute-inefficient because it samples with replacement,…

Machine Learning · Computer Science 2026-04-23 Xueyan Li , Johannes Zenn , Ekaterina Fadeeva , Guinan Su , Mrinmaya Sachan , Jonas Geiping

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

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

Reinforcement learning (RL) has been pivotal in enhancing the reasoning capabilities of large language models (LLMs), but it often suffers from limited exploration and entropy collapse, where models exploit a narrow set of solutions,…

Machine Learning · Computer Science 2025-10-20 Shijia Kang , Muhan Zhang

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

Reinforcement learning (RL) post-training has enabled newer capabilities in models, such as agentic tool-use for search. However, these models struggle primarily due to limitations with sparse outcome-based rewards and a lack of training…

Machine Learning · Computer Science 2026-05-08 Harsh Goel , Akhil Udathu , Susmija Jabireddy , Pradnesh Kalkar , Atharva Parulekar

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

Learning to rank (LTR) plays a crucial role in various Information Retrieval (IR) tasks. Although supervised LTR methods based on fine-grained relevance labels (e.g., document-level annotations) have achieved significant success, their…

Information Retrieval · Computer Science 2025-08-21 Yiteng Tu , Zhichao Xu , Tao Yang , Weihang Su , Yujia Zhou , Yiqun Liu , Fen Lin , Qin Liu , Qingyao Ai

Recent studies show that Large Language Models (LLMs) achieve strong reasoning capabilities through supervised fine-tuning or reinforcement learning. However, a key approach, the Process Reward Model (PRM), suffers from reward hacking,…

Computation and Language · Computer Science 2026-04-10 Teng Wang , Zhangyi Jiang , Zhenqi He , Shenyang Tong , Wenhan Yang , Yanan Zheng , Zeyu Li , Zifan He , Hailei Gong , Zewen Ye , Shengjie Ma , Jianping Zhang

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

Deep Research agents tackle knowledge-intensive tasks through multi-round retrieval and decision-oriented generation. While reinforcement learning (RL) has been shown to improve performance in this paradigm, its contributions remain…

Computation and Language · Computer Science 2026-02-24 Yinuo Xu , Shuo Lu , Jianjie Cheng , Meng Wang , Qianlong Xie , Xingxing Wang , Ran He , Jian Liang