paper-with-me

홈 › Papers

Catastrophic Goodhart: regularizing RLHF with KL divergence does not mitigate heavy-tailed reward misspecification

2024-07-19 · Thomas Kwa, Drake Thomas, Adrià Garriga-Alonso

When applying reinforcement learning from human feedback (RLHF), the reward is learned from data and, therefore, always has some error. It is common to mitigate this by regularizing the policy with KL divergence from a base model, with the hope that balancing reward with regularization will achieve desirable outcomes despite this reward misspecification. We show that when the reward function has light-tailed error, optimal policies under less restrictive KL penalties achieve arbitrarily high utility. However, if error is heavy-tailed, some policies obtain arbitrarily high reward despite achieving no more utility than the base model--a phenomenon we call catastrophic Goodhart. We adapt a discrete optimization method to measure the tails of reward models, finding that they are consistent with light-tailed error. However, the pervasiveness of heavy-tailed distributions in many real-world applications indicates that future sources of RL reward could have heavy-tailed error, increasing the likelihood of reward hacking even with KL regularization.

📄 PDF Abstract BibTeX arXiv:2407.14503

Code (1)

tkwa/catastrophic-goodhart 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

BASE 설명 없음

Similar Papers 제목 키워드 기반

Tail-Aware Information-Theoretic Bounds for LLM Alignment under Heavy-Tailed Rewards

2026-04-12 · Huiming Zhang, Binghan Li, Wan Tian, Qiang Sun arxiv

Classical information-theoretic learning bounds typically rely on KL mutual information and moment-generating-function (MGF) arguments, which are well matched to bounded or sub-Gaussian losses but can be ineffective when…

Stochastic Optimization

Unifying Stable Optimization and Reference Regularization in RLHF

2026-02-12 · Li He, Qiang Qu, He Zhao, Stephen Wan 외 arxiv

Reinforcement Learning from Human Feedback (RLHF) has advanced alignment capabilities significantly but remains hindered by two core challenges: \textbf{reward hacking} and \textbf{stable optimization}. Current solutions…

Reinforcement Learning

The Strong, Weak and Benign Goodhart's law. An independence-free and paradigm-agnostic formalisation

2025-05-29 · Adrien Majka, El-Mahdi El-Mhamdi

Goodhart's law is a famous adage in policy-making that states that ``When a measure becomes a target, it ceases to be a good measure''. As machine learning models and the optimisation capacity to train them grow, growing…

Correlated Proxies: A New Definition and Improved Mitigation for Reward Hacking

2024-03-05 · Cassidy Laidlaw, Shivam Singhal, Anca Dragan

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 fre…

reinforcement-learningReinforcement Learning

$f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses

2026-05-07 · Di Wu, Chengshuai Shi, Jing Yang, Cong Shen arxiv

Reinforcement Learning from Human Feedback (RLHF) has become a cornerstone technique for post-training large language models. While most existing approaches rely on the reverse KL-regularization, recent empirical studies…

Reinforcement Learning