Bayesian Preference Learning for Test-Time Steerable Reward Models
summary
The gist
The gist: Variational In-Context Reward Modeling (ICRM) is a novel Bayesian reward modeling objective that enables test-time steerability via in-context preference demonstrations.
In short
The paper introduces Variational In-Context Reward Modeling (ICRM), a new Bayesian method for reward modeling that allows language models to adapt their preferences at test time using in-context examples. ICRM works by treating reward as a latent variable and using in-context demonstrations to infer a preference distribution. This enables steerability for single and multi-objective tasks, improving performance on benchmarks and showing practical use in reinforcement learning.
Key concepts
- Variational In-Context Reward Modeling (ICRM)
- ICRM is a novel Bayesian objective that treats reward modeling as amortized variational inference. It allows a reward model to infer the true preference distribution at test time by conditioning on a few in-context preference demonstrations, making the model steerable without full retraining.
- Bradley-Terry Model
- This is a standard statistical model used to represent pairwise preferences between items. In this context, it assumes that the probability of preferring one item over another is determined by their scores, allowing ICRM to learn and approximate complex preference distributions.
- Test-Time Steerability
- This refers to the ability of a reward model to dynamically change its behavior or preferences when presented with new context during inference. ICRM achieves this by using in-context demonstrations as evidence to adjust the inferred preference distribution on the fly.
Terminology used across episodes
This episode discusses
- Bayesian Preference Learning for Test-Time Steerable Reward Models · Paper Radio
- Critique-out-Loud Reward Models
- Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities
- Active Preference Optimization for Sample Efficient RLHF
- Learning without training: The implicit dynamics of in-context learning
- The Llama 3 Herd of Models · Paper Radio
- Liger Kernel: Efficient Triton Kernels for LLM Training
- OpenRLHF: An Easy-to-use, Scalable and High-performance RLHF Framework
- Tulu 3: Pushing Frontiers in Open Language Model Post-Training
- On the generalization of language models from in-context learning and finetuning: a controlled study
- Skywork-Reward: Bag of Tricks for Reward Modeling in LLMs
- Skywork-Reward-V2: Scaling Preference Data Curation via Human-AI Synergy
- Energy-Based Reward Models for Robust Language Model Alignment
- Uncertainty-aware Reward Model: Teaching Reward Models to Know What is Unknown
- Generative Reward Models
- RewardBench 2: Advancing Reward Model Evaluation
- Active Preference Learning for Large Language Models
- GPT-4o System Card
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
- HelpSteer3-Preference: Open Human-Annotated Preference Data across Diverse Tasks and Languages
- Prior Distributions for the Bradley-Terry Model of Paired Comparisons
The paper
Bayesian Preference Learning for Test-Time Steerable Reward Models · Read on arXiv
Jiwoo Hong, Shao Tang, Zhipeng Wang
LinkedIn Corporation · Nubank
Reward models are central to aligning language models with human preferences via reinforcement learning (RL). As RL is increasingly applied to settings such as verifiable rewards and multi-objective alignment, RMs are expected to encode more complex and multifaceted preference distributions. However, classifier RMs remain static once trained, limiting their adaptability at test time. We propose Variational In-Context Reward Modeling (ICRM), a novel Bayesian reward modeling objective that enables test-time steerability via in-context preference demonstrations. ICRM casts reward modeling as amortized variational inference over a latent preference probability under the Bradley-Terry model using a conjugate Beta prior. We show that ICRM adapts to unseen preference distributions at test time for both single and multi-objective settings. With more demonstrations, ICRM improves RM-Bench accuracy from 60.5 to 70.8, achieves lower calibration error than a generative judge on moral dilemma preferences, and expands the attainable Pareto frontier under conflicting preferences. We further study the practical applicability of ICRM for RL training, showing that it can effectively encode verifiable rewards by outperforming a conventional RM in math reasoning. Finally, we provide theoretical guarantees that the variational objective admits a global interior optimum with finite confidence, followed by an ablation study on its role for the test-time steerability, and we analyze how KL regularization mitigates reward over-optimization.
Transcript
Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.
Tom: We're looking at the paper: "Bayesian Preference Learning for Test-Time Steerable Reward Models".
Jane: The gist: Variational In-Context Reward Modeling (ICRM) is a novel Bayesian reward modeling objective that enables test-time steerability via in-context preference demonstrations.
Tom: First, who's behind it and why it matters.
Paper summary: Tom: So we're looking at this paper called Bayesian Preference Learning for Test-Time Steerable Reward Models. The authors are Jiwoo Hong, Shao Tang, and Zhipeng Wang from LinkedIn Corporation and Nubank.
Jane: It sounds like they’re tackling a problem where reward models, which we use to align language models with human preferences through reinforcement learning, get stuck once they’re trained. They become static at test time.
Lu: Exactly. The paper proposes this Variational In-Context Reward Modeling objective called ICRM to fix that. It casts reward modeling as amortized variational inference over a latent preference probability under the Bradley-Terry model using a Beta prior #pg1
Meng: So what's the main claim here? What exactly is ICRM doing that’s different from just training a standard reward model?
Tom: Basically, ICRM uses in-context preference demonstrations to make the reward model steerable at test time. It lets it adapt to unseen preferences. They show it works for both single and multi-objective settings #pg2
Jane: So, how does this work mechanically? The summary says they approximate the true preference distribution with a Beta posterior conditioned on those in-context demonstrations.
Lu: They use a Beta prior on the Bradley-Terry model, which is a conjugate prior #pg3. This yields a closed-form training loss via variational inference #pg2
Tom: It’s about mapping inputs to the parameters of this approximate posterior distribution, specifically using alpha q = mu tau and beta q = (one - mu) tau, where mu is the posterior predictive probability and tau controls concentration #pg2 <ref:2602.08819#pg1>
Meng: And what's the goal of that KL regularization term they mention? Is it just for stability?
Lu: It’s to prevent excessive maximization of the preference mean on training data, which ensures we get an interior optimum #pg3. Theorem three point two proves that every global minimizer mu satisfies zero < mu < one and zero < tau < infinity #pg3
Jane: That sounds like a lot of math to keep track of, but what does this mean for the person using the AI model? What’s the practical difference?
Tom: The practical difference is test-time steerability. If you have preferences you haven't seen before, ICRM allows the reward model to shift toward those new preferences using just a few examples in context #pg2
Meng: I'm interested in what they say about performance. They mention improving RM-Bench accuracy from sixty point five to seventy point eight with more demonstrations #pg1 <ref:2602.08819#pg1,RM-Bench accuracy from 60.5 to 70.8>
Lu: That improvement shows it adapts to unseen preference distributions at test time for both single and multi-objective settings #pg1
Jane: And they also mention achieving lower calibration error than a generative judge on moral dilemma preferences #pg1 That’s important because those are tricky scenarios.
Tom: They also show that with more demonstrations, ICRM improves RM-Bench accuracy from sixty point five to seventy point eight and expands the attainable Pareto frontier under conflicting preferences #pg1 <ref:2602.08819#pg1,with more demonstrations, ICRM improves RM-Bench accuracy from 60.5 to>
Meng: Okay, so on the practical side, they also applied it to verifiable rewards in reinforcement learning. How did that go?
Lu: In RL with verifiable rewards, ICRM outperforms both the verifier and a conventional reward model in math reasoning #pg1 They reach fifty-three point eight percent MATH-five hundred accuracy #pg1
Jane: Fifty-three point eight percent on a math benchmark compared to fifty percent and fifty-one point four for the other methods. That’s a solid gain if it works reliably on real tasks.
Tom: And they showed that this alignment with accuracy is stronger when using lambda = zero point one in RLVR training #pg1 The correlation analysis indicates that ICRM with lambda = zero point one has a stronger alignment with the accuracy #pg1
Meng: So, what are the limitations? What doesn't this framework handle well?
Jane: They do flag that the trained ICRM could be steered to prefer harmful behaviors when tested against flipped labeled safety preference datasets #F
Lu: That’s a fair point. The paper notes that while it offers wider applications for RLHF, like steering to harmful behaviors, those things need appropriate safeguards and restricted access to unsafe steering demonstrations #F
Tom: So we have this objective that allows us to adapt the model later in the process using context, and it has theoretical guarantees against over-optimization through that KL regularization term #pg3
Jane: It seems like they’ve built a principled way to make reward models flexible instead of just static after training. That's what this paper is about.
Lu: The core contribution is providing a framework grounded in Bayesian views for preference learning that unifies in-context steerability with regularization #G
Tom: So, to wrap up on the paper "Bayesian Preference Learning for Test-Time Steerable Reward Models," it introduces ICRM. It’s this new objective that lets reward models adapt to preferences they haven't seen during training by using in-context preference demonstrations #pg1
Jane: The authors are showing that this approach works for both single and multi-objective settings, improving accuracy on benchmarks like RM-Bench from sixty point five to seventy point eight with more demonstrations #pg1 <ref:2602.08819#pg1,for both single and multi-objective settings>
Lu: The paper proves that this variational design admits a global interior optimum with finite confidence, which is guaranteed by the KL regularization term #pg3
Meng: It's about making models more adaptable post-training without needing full retraining or fine-tuning for every new preference standard.
Tom: Exactly. It gives us a way to encode complex, graded preference mixtures at test time and offers theoretical control over how much the model drifts based on the context it sees #pg1
Conclusion: Tom: So we've been talking about ICRM, this Variational In-Context Reward Modeling objective that lets reward models adapt to preferences they haven't seen during training #pg1
Jane: Exactly, Tom. It’s about making those static reward models flexible at test time using preference demonstrations #pg2
Tom: The authors are Jiwoo Hong, Shao Tang, and Zhipeng Wang from LinkedIn Corporation and Nubank #pg1 They put this Bayesian approach to reward modeling into action #pg3
Jane: So what does that title really mean for someone just listening? It means we’re looking at a way to stop reward models from being locked in their initial training data once they’re deployed #pg2
Tom: It suggests that instead of retraining the whole model every time we want it to prefer something slightly different, we can use context—like a few examples—to steer its behavior dynamically #pg1
Jane: That's the core idea. It’s not about retraining, it’s about having a mechanism for real-time preference adjustment based on the immediate context of the task #pg2
Tom: They show this works for both single and multi-objective settings, which is key because real preferences are rarely just one thing #pg1
Jane: And they have theoretical guarantees that this variational objective actually has a stable, interior solution, meaning it won't just wildly jump around during test time #pg3
Tom: That stability comes from the KL regularization term they use to control how much the model drifts away from its initial training #pg3
Jane: It gives us a principled way to temper that drift. It’s a step toward reward models that aren't just brittle after training #pg2
Tom: We saw some great results in reinforcement learning, too, where this ICRM approach actually beat the conventional verifier for math reasoning on MATH-five hundred #pg1
Jane: Yeah, so while it’s a fancy Bayesian trick to make models more flexible, the real impact is seeing how much better they can perform when you give them just a little bit of in-context guidance #pg2
More episodes
- 2504.20829-GaussTrap: Stealthy Backdoor Attacks on 3D Gaussian Splatting for Targeted Scene Misperception
- 2506.00060-Comparative analysis of privacy-preserving open-source LLMs regarding extraction of diagnostic information from clinical CMR imaging reports
- 2506.10974-AutoMind: Adaptive Knowledgeable Agent for Automated Data Science
- 2507.14056-Dynamic gain neuromodulation attenuates stability gaps during continual joint training
- 2508.03411-SlotMatch: Distilling Object-Centric Representations for Unsupervised Video Segmentation
- 2509.09009-Open-sci-ref-0.02: open reference baselines for reproducible language model and dataset comparison
- 2512.14554-VLegal-Bench: Cognitively Grounded Benchmark for Vietnamese Legal Reasoning of Large Language Models
- 2601.10960-Steering Language Models Before They Speak: Logit-Level Interventions
- 2602.03802-Do We Need Asynchronous SGD? On the Near-Optimality of Synchronous Methods
- 2603.05735-Agentic AI -- Physicist Collaboration in Experimental Particle Physics: A Proof-of-Concept Measurement with LEP Open Data