English
Related papers

Related papers: PairJudge RM: Perform Best-of-N Sampling with Knoc…

200 papers

Verifiers or reward models are often used to enhance the reasoning performance of large language models (LLMs). A common approach is the Best-of-N method, where N candidate solutions generated by the LLM are ranked by a verifier, and the…

Machine Learning · Computer Science 2025-02-25 Lunjun Zhang , Arian Hosseini , Hritik Bansal , Mehran Kazemi , Aviral Kumar , Rishabh Agarwal

LLM-as-a-judge has emerged as a cornerstone technique for evaluating large language models by leveraging LLM reasoning to score prompt-response pairs. Since LLM judgments are stochastic, practitioners commonly query each pair multiple times…

Machine Learning · Computer Science 2026-04-14 Aadirupa Saha , Aniket Wagde , Branislav Kveton

Large Language Models (LLMs) are increasingly relied upon for solving complex reasoning tasks in domains such as mathematics, logic, and multi-step question answering. A growing line of work seeks to improve reasoning quality by scaling…

Machine Learning · Computer Science 2025-08-05 Seyyed Saeid Cheshmi , Azal Ahmad Khan , Xinran Wang , Zirui Liu , Ali Anwar

Large Language Models (LLMs) have significantly advanced the state-of-the-art in various coding tasks. Beyond directly answering user queries, LLMs can also serve as judges, assessing and comparing the quality of responses generated by…

Computation and Language · Computer Science 2025-08-15 Hongchao Jiang , Yiming Chen , Yushi Cao , Hung-yi Lee , Robby T. Tan

Allocating more computation during inference time (test-time scaling) improves language model performance, especially for reasoning tasks. However, popular methods like Best-of-$N$ sampling often show diminishing returns as $N$ increases.…

Machine Learning · Computer Science 2025-10-20 Yung-Chen Tang , Pin-Yu Chen , Andrea Cavallaro

Best-of-N (BoN) sampling with a reward model has been shown to be an effective strategy for aligning Large Language Models (LLMs) to human preferences at the time of decoding. BoN sampling is susceptible to a problem known as reward hacking…

Computation and Language · Computer Science 2025-01-30 Yuu Jinnai , Tetsuro Morimura , Kaito Ariu , Kenshi Abe

Recent studies have indicated that effectively utilizing inference-time compute is crucial for attaining better performance from large language models (LLMs). In this work, we propose a novel inference-aware fine-tuning paradigm, in which…

Large language models are increasingly used to support high-stakes decisions, potentially influencing who is granted bail or receives a loan. Naive chain-of-thought sampling can improve average decision accuracy, but has also been shown to…

Machine Learning · Computer Science 2025-07-16 Zara Hall , Melanie Subbiah , Thomas P Zollo , Kathleen McKeown , Richard Zemel

We study the theoretical aspects of Reinforced Language Models (RLMs) from a bi-objective optimization perspective. Specifically, we consider the RLMs as a Pareto optimization problem that maximizes the two conflicting objectives, i.e.,…

Machine Learning · Computer Science 2023-11-27 Changhun Lee , Chiehyeon Lim

To ensure that large language model (LLM) responses are helpful and non-toxic, a reward model trained on human preference data is usually used. LLM responses with high rewards are then selected through best-of-$n$ (BoN) sampling or the LLM…

Machine Learning · Computer Science 2024-07-04 Adam X. Yang , Maxime Robeyns , Thomas Coste , Zhengyan Shi , Jun Wang , Haitham Bou-Ammar , Laurence Aitchison

Best-of-$n$ is a widely used test-time scaling approach for LLM inference. Yet despite evidence that LLMs exhibit complementary strengths across tasks, traditionally best-of-$n$ relies on a single model to generate responses. We propose…

Machine Learning · Computer Science 2025-12-08 Jonathan Geuter , Gregor Kornhardt

The application of Reinforcement Learning with Verifiable Rewards (RLVR) to mathematical and coding domains has demonstrated significant improvements in the reasoning and problem-solving abilities of Large Language Models. Despite its…

Machine Learning · Computer Science 2025-10-28 Farid Bagirov , Mikhail Arkhipov , Ksenia Sycheva , Evgeniy Glukhov , Egor Bogomolov

Ranking documents using Large Language Models (LLMs) by directly feeding the query and candidate documents into the prompt is an interesting and practical problem. However, researchers have found it difficult to outperform fine-tuned…

Information Retrieval · Computer Science 2024-03-29 Zhen Qin , Rolf Jagerman , Kai Hui , Honglei Zhuang , Junru Wu , Le Yan , Jiaming Shen , Tianqi Liu , Jialu Liu , Donald Metzler , Xuanhui Wang , Michael Bendersky

Reinforcement learning with verifiable rewards (RLVR) has become an effective paradigm for improving reasoning language models on tasks such as mathematics, coding, and scientific question answering. However, widely used group-relative…

Computation and Language · Computer Science 2026-05-29 Redacted by arXiv

Reward models are crucial for aligning large language models (LLMs) with human values and intentions. Existing approaches follow either Generative (GRMs) or Discriminative (DRMs) paradigms, yet both suffer from limitations: GRMs typically…

Computation and Language · Computer Science 2026-03-03 Longze Chen , Lu Wang , Renke Shan , Ze Gong , Run Luo , Jiaming Li , Jing Luo , Qiyao Wang , Min Yang

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

The availability of large pre-trained models is changing the landscape of Machine Learning research and practice, moving from a training-from-scratch to a fine-tuning paradigm. While in some applications the goal is to "nudge" the…

Machine Learning · Computer Science 2022-11-15 Tomasz Korbak , Hady Elsahar , Germán Kruszewski , Marc Dymetman

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

To improve the ability of the large language model (LLMs) to tackle complex reasoning problems, chain-of-thoughts (CoT) methods were proposed to guide LLMs to reason step-by-step, enabling problem solving from simple to complex.…

Machine Learning · Computer Science 2024-06-27 Zhen-Yu Zhang , Siwei Han , Huaxiu Yao , Gang Niu , Masashi Sugiyama

Reward modeling is essential for aligning large language models with human preferences through reinforcement learning. To provide accurate reward signals, a reward model (RM) should stimulate deep thinking and conduct interpretable…

Computation and Language · Computer Science 2026-03-09 Xiusi Chen , Gaotang Li , Ziqi Wang , Bowen Jin , Cheng Qian , Yu Wang , Hongru Wang , Yu Zhang , Denghui Zhang , Tong Zhang , Hanghang Tong , Heng Ji