arXiv AI

Compression Precedes, Content Decides: Emergent Misalignment in Reward Models

The paper investigates emergent misalignment in reward models, showing that fine‑tuning reward models to prefer harmful content in a single domain (medical or financial) causes the preference to generalize to seven other domains. The authors fine‑tune two state‑of‑the‑art reward models—Skywork‑Reward‑V2‑Llama‑3.1‑8B and Skywork‑Reward‑V2‑Qwen3‑8B—and find that the models still perform well on the standard RewardBench 2 evaluation while exhibiting a preference for harm. Mechanistically, the study identifies two key changes in the reward models’ representations: a geometric compression that reduces the angle between sound and harmful responses, and a content‑specific rotation that aligns harmful representations more closely with the scalar head, thereby increasing their reward score.

arXiv Machine Learning
Sep 2

Patterning in Practice: Debiasing Reward Models with Susceptibilities

The paper introduces patterning, a reweighting technique that adjusts preference pairs based on their susceptibility to bias, to debias a Gemma 2 9B Instruct reward model trained on Skywork-Reward-Preference v0.2. Using this method, the authors achieve a +14.2 ± 1.2 percentage point improvement on the RM‑Bench Hard split while maintaining overall accuracy, matching the best reported Hard‑split gain from a comparable model. The study also demonstrates that the learned weights are interpretable, transferable across Gemma variants, and partially effective on Llama 3.1 8B.

By George Wang, Elizabeth Donoway, Daniel Murfet
arXiv Computation and Language
21h ago

ECHO: Emergent Common-Mode Hidden Offsets Drive Vocabulary Collapse in Preference Optimization

arXiv:2610.29410v1 Announce Type: new Abstract: Preference optimization can improve every ranking metric while building a hidden, shared representation shift that the relative loss barely sees, one t...

By Yun Li, Ehsan Javanmardi, Simon Thompson, Jiachen Gong, Qunli Zhang, Zifan Zeng, Shiming Liu, Peng Wang, Zixuan Guo, Manabu Tsukada
arXiv AI
Oct 12

Unsupervised Multimodal Reward Modeling

The paper presents an unsupervised multimodal reward model built on a frozen Qwen3‑VL backbone. By adding a linear head to an intermediate layer and training it to rank a web caption higher than a perturbed version of itself, the authors avoid human preference labels and achieve competitive performance—outperforming GPT‑4o on several benchmarks with far fewer parameters and compute. The approach demonstrates that a carefully chosen intermediate layer, simple perturbation-based training, and verifier‑driven fine‑tuning can yield effective vision‑language rewards without costly annotation.

By Yueying Li, Jingxuan Fan, Kiant\'e Brantley, Sham M. Kakade, Hanlin Zhang
arXiv Computation and Language
21h ago

Mitigating Reward Hacking in Preference Reward Models with Evolving Penalties

The paper introduces Dynalize, an online penalty system that mitigates reward hacking in preference reward models during policy training. By having a language model periodically analyze rollouts and generate penalties for behaviors the reward model inadvertently rewards, Dynalize prevents the policy from inflating scores without improving quality. Experiments in clinical counseling and creative writing show that Dynalize sustains longer training and yields better downstream performance, suppressing undesirable patterns even in multi‑turn settings and after retraining the reward model.

By Afonso Baldo, Ant\'onio Farinhas, Marcos Treviso, Ricardo Rei, Nuno M. Guerreiro