analiza aiqbench
This research provides provable finite-sample guarantees for Value Difference Regression in offline reward learning, demonstrating its ability to eliminate misspecification bias by averaging over actions within contexts. The study reveals a nuanced trade-off where pairwise methods excel at handling nuisance context variations but may increase variance when the underlying model is well-specified. These theoretical insights clarify the specific geometric conditions under which pairwise losses outperform standard pointwise regression in complex bandit settings.
Pointwise or Pairwise: When Do Pairwise Losses Help Reward Learning, Provably?
arXiv:2609.37209v1 Announce Type: new Abstract: Pairwise losses are increasingly used for reward learning even when pointwise rewards are observed, with mixed empirical results. When and why do pairwise losses outperform pointwise losses? We study this question in a grouped offline contextual-bandit setting allowing multiple actions per context, capturing many reward learning scenarios. We compare Value Regression (VR), which regresses observed rewards pointwise, with Value Difference Regression (VDR), which regresses reward differences between a pair of actions sampled under the same context. We consider a semiparametric model where the mean reward is the sum of a learnable action-dependent component and an arbitrary context-dependent yet action-independent nuisance, capturing context-specific disturbances. Using a unified localized analysis, we prove finite-sample regression guarantees for finite and linear function classes and translate them into offline-regret bounds. For finite classes, VDR eliminates the misspecification term in the VR bound and improves a reward-scale-dependent error term by averaging over actions within each context, a benefit absent from the corresponding VR term. For linear classes, neither method uniformly dominates: within-context differencing removes nuisance-induced bias but may increase estimation variance relative to using absolute rewards when the misspecification is sufficiently low. This yields a feature geometry-dependent bias-variance tradeoff, which we corroborate with numerical experiments.
Title:Pointwise or Pairwise: When Do Pairwise Losses Help Reward Learning, Provably?
Abstract:Pairwise losses are increasingly used for reward learning even when pointwise rewards are observed, with mixed empirical results. When and why do pairwise losses outperform pointwise losses? We study this question in a grouped offline contextual-bandit setting allowing multiple actions per context, capturing many reward learning scenarios. We compare Value Regression (VR), which regresses observed rewards pointwise, with Value Difference Regression (VDR), which regresses reward differences between a pair of actions sampled under the same context. We consider a semiparametric model where the mean reward is the sum of a learnable action-dependent component and an arbitrary context-dependent yet action-independent nuisance, capturing context-specific disturbances. Using a unified localized analysis, we prove finite-sample regression guarantees for finite and linear function classes and translate them into offline-regret bounds. For finite classes, VDR eliminates the misspecification term in the VR bound and improves a reward-scale-dependent error term by averaging over actions within each context, a benefit absent from the corresponding VR term. For linear classes, neither method uniformly dominates: within-context differencing removes nuisance-induced bias but may increase estimation variance relative to using absolute rewards when the misspecification is sufficiently low. This yields a feature geometry-dependent bias-variance tradeoff, which we corroborate with numerical experiments.
Machine Learning (cs.LG); Machine Learning (stat.ML)
arXiv:2609.37209 [cs.LG]
(or arXiv:2609.37209v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.37209 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 307 cuvinte
Subiecte conexe
Debugging Logprob Mismatches in LLM Reinforcement Learning
AMD · 23 sept. 2026

Mastering Agentic Techniques: AI Agent Customization
NVIDIA · 20 mai 2026
Swiss-Knife: A Framework for Reconfigurable Externalised Multi-Objective Alignment at Decode Time
arXiv · 22 sept. 2026

PIRAMID: Progress and Plans
LessWrong · 27 iul. 2026