English
Related papers

Related papers: Inference-Time Reward Hacking in Large Language Mo…

200 papers

Best-of-N (BoN) sampling is a widely used inference-time alignment method for language models, whereby N candidate responses are sampled from a reference model and the one with the highest predicted reward according to a learned reward…

Machine Learning · Computer Science 2026-03-09 Ved Sriraman , Adam Block

Inference-time computation offers a powerful axis for scaling the performance of language models. However, naively increasing computation in techniques like Best-of-N sampling can lead to performance degradation due to reward hacking.…

Artificial Intelligence · Computer Science 2025-04-09 Audrey Huang , Adam Block , Qinghua Liu , Nan Jiang , Akshay Krishnamurthy , Dylan J. Foster

Inference-time compute scaling has emerged as a powerful paradigm for improving language model performance on a wide range of tasks, but the question of how best to use the additional compute remains open. A popular approach is BoN…

Machine Learning · Computer Science 2026-04-07 Zhuohao Yu , Zhiwei Steven Wu , Adam Block

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

Computation and Language · Computer Science 2025-02-19 Yuki Ichihara , Yuu Jinnai , Tetsuro Morimura , Kaito Ariu , Kenshi Abe , Mitsuki Sakamoto , Eiji Uchibe

Inference-time alignment techniques offer a lightweight alternative or complement to costly reinforcement learning, while enabling continual adaptation as alignment objectives and reward targets evolve. Existing theoretical analyses justify…

Machine Learning · Computer Science 2026-05-14 Ye Wang , Jing Liu , Toshiaki Koike-Akino

Best-of-N (BoN) is a popular and effective algorithm for aligning language models to human preferences. The algorithm works as follows: at inference time, N samples are drawn from the language model, and the sample with the highest reward,…

Computation and Language · Computer Science 2025-03-05 Afra Amini , Tim Vieira , Elliott Ash , Ryan Cotterell

Reinforcement Learning from Human Feedback (RLHF) and related alignment paradigms have become central to steering large language models (LLMs) and multimodal large language models (MLLMs) toward human-preferred behaviors. However, these…

Designing robust reinforcement learning (RL) agents in the presence of imperfect reward signals remains a core challenge. In practice, agents are often trained with proxy rewards that only approximate the true objective, leaving them…

Machine Learning · Computer Science 2026-04-15 Zixuan Liu , Xiaolin Sun , Zizhan Zheng

A simple yet effective method for inference-time alignment of generative models is Best-of-$N$ (BoN), where $N$ outcomes are sampled from a reference policy, evaluated using a proxy reward model, and the highest-scoring one is selected.…

Machine Learning · Statistics 2025-07-09 Gholamali Aminian , Idan Shenfeld , Amir R. Asadi , Ahmad Beirami , Youssef Mroueh

Reward models play a key role in aligning language model applications towards human preferences. However, this setup creates an incentive for the language model to exploit errors in the reward model to achieve high estimated reward, a…

Reward hacking arises when a model improves a proxy reward by exploiting shortcuts rather than solving the intended task. We study this failure mode through the geometry of reinforcement learning updates in language models and argue that…

Machine Learning · Computer Science 2026-05-26 Wenlong Deng , Jiaji Huang , Kaan Ozkara , Yushu Li , Christos Thrampoulidis , Xiaoxiao Li , Youngsuk Park

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

Because it is difficult to precisely specify complex objectives, reinforcement learning policies are often optimized using proxy reward functions that only approximate the true goal. However, optimizing proxy rewards frequently leads to…

Machine Learning · Computer Science 2025-03-14 Cassidy Laidlaw , Shivam Singhal , Anca Dragan

Despite the success of reinforcement learning from human feedback (RLHF) in aligning language models with human values, reward hacking, also termed reward overoptimization, remains a critical challenge. This issue primarily arises from…

Machine Learning · Computer Science 2024-11-04 Yuchun Miao , Sen Zhang , Liang Ding , Rong Bao , Lefei Zhang , Dacheng Tao

Language model (LM) alignment improves model outputs to reflect human preferences while preserving the capabilities of the base model. The most common alignment approaches are (i) reinforcement learning, which maximizes the expected reward…

Machine Learning · Computer Science 2026-05-11 Lucas Monteiro Paes , Natalie Mackraz , Barry-John Theobald , Federico Danieli

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…

Despite the success of Reinforcement Learning from Human Feedback (RLHF) in aligning language models with human values, reward hacking-or reward over-optimization-remains a major challenge. We identify two key obstacles to its mitigation:…

Machine Learning · Computer Science 2025-10-16 Yuchun Miao , Liang Ding , Sen Zhang , Rong Bao , Lefei Zhang , Dacheng Tao

Fine-tuned large language models can exhibit reward-hacking behavior arising from emergent misalignment, which is difficult to detect from final outputs alone. While prior work has studied reward hacking at the level of completed responses,…

Computation and Language · Computer Science 2026-03-05 Patrick Wilhelm , Thorsten Wittkopp , Odej Kao

Language models are capable of iteratively improving their outputs based on natural language feedback, thus enabling in-context optimization of user preference. In place of human users, a second language model can be used as an evaluator,…

Computation and Language · Computer Science 2024-07-08 Jane Pan , He He , Samuel R. Bowman , Shi Feng

Existing alignment methods directly use the reward model learned from user preference data to optimize an LLM policy, subject to KL regularization with respect to the base policy. This practice is suboptimal for maximizing user's utility…

Machine Learning · Computer Science 2026-02-04 Haichuan Wang , Tao Lin , Lingkai Kong , Ce Li , Hezi Jiang , Milind Tambe
‹ Prev 1 2 3 10 Next ›