Automatically Finding Reward Model Biases

Atticus Wang, Iván Arcuschin, Arthur Conmy
2/16/2026
cs.LGcs.AI

No official code found. Best implementation: chry-santhemum/reward-model-bias (7 stars, last commit 2026-03-30).

Abstract

Reward models are central to large language model (LLM) post-training. However, past work has shown that they can reward spurious or undesirable attributes such as length, format, hallucinations, and sycophancy. In this work, we introduce and study the research problem of automatically finding reward model biases in natural language. We offer a simple approach of using an LLM to iteratively propose and refine candidate biases. Our method can recover known biases and surface novel ones: for example, we found that Skywork-V2-8B, a leading open-weight reward model, often mistakenly favors responses with redundant spacing and responses with hallucinated content. In addition, we show evidence that evolutionary iteration outperforms flat best-of-N search, and we validate the recall of our pipeline using synthetically injected biases. We hope our work contributes to further research on improving RMs through automated interpretability methods.

View on arXivView PDF

Code Implementations(1)

Code for the paper "Automatically Finding Reward Model Biases"

71PythonFeb 16, 20266 months ago

Similar Papers

Cite this paper

@article{wang2026automatically,
  title  = {Automatically Finding Reward Model Biases},
  author = {Atticus Wang and Iván Arcuschin and Arthur Conmy},
  year   = {2026},
  eprint = {2602.15222},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2602.15222v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2602.15222.svg)](https://codeofpaper.com/paper/2602.15222)

Discussion