Scaling laws for reward model overoptimization

OpenAI Blog Papers

Summary

OpenAI researchers empirically study how reward model overoptimization affects performance, establishing scaling laws that show the relationship between proxy reward optimization and ground truth performance varies by optimization method and scales predictably with model size.

No content available
Original Article
View Cached Full Text

Cached at: 04/20/26, 02:46 PM

# Scaling laws for reward model overoptimization Source: [https://openai.com/index/scaling-laws-for-reward-model-overoptimization/](https://openai.com/index/scaling-laws-for-reward-model-overoptimization/) ## Abstract In reinforcement learning from human feedback, it is common to optimize against a reward model trained to predict human preferences\. Because the reward model is an imperfect proxy, optimizing its value too much can hinder ground truth performance, in accordance with Goodhart's law\. This effect has been frequently observed, but not carefully measured due to the expense of collecting human preference data\. In this work, we use a synthetic setup in which a fixed "gold\-standard" reward model plays the role of humans, providing labels used to train a proxy reward model\. We study how the gold reward model score changes as we optimize against the proxy reward model using either reinforcement learning or best\-of\-n sampling\. We find that this relationship follows a different functional form depending on the method of optimization, and that in both cases its coefficients scale smoothly with the number of reward model parameters\. We also study the effect on this relationship of the size of the reward model dataset, the number of reward model and policy parameters, and the coefficient of the KL penalty added to the reward in the reinforcement learning setup\. We explore the implications of these empirical results for theoretical considerations in AI alignment\.

Similar Articles

Revisiting scaling laws for reward optimization

arXiv cs.LG

The paper revisits scaling laws for reward optimization in AI alignment, showing that performance scales as Θ(√min{log(M), K}) where M is the amount of preference data and K is the KL-divergence budget, and provides an information-theoretic model plus extensive empirical validation with proxy reward models.

Scaling laws for neural language models

OpenAI Blog

Foundational empirical study demonstrating power-law scaling relationships between language model performance and model size, dataset size, and compute budget, with implications for optimal training allocation and sample efficiency.

Scaling Laws, Carefully (25 minute read)

TLDR AI

A comprehensive overview of scaling laws in deep learning, tracing their theoretical roots and empirical findings, and explaining how loss decreases predictably with model size, data, and compute.