mlsanityData to 14 Oct 2026

Pointwise or Pairwise: When Do Pairwise Losses Help Reward Learning, Provably?

arXiv 2609.37209 ↗First posted 29 Sep 2026cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 89 references that are in the map. First posted on arXiv 29 Sep 2026.

Builds on

7 of 89 references.

References · 7

  1. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  2. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
  3. 2017Deep reinforcement learning from human preferencescited by 3,912
  4. 2021Program Synthesis with Large Language Modelscited by 3,637
  5. 2024Qwen2.5-Coder Technical Reportcited by 1,203
  6. 2019Comments on the Du-Kakade-Wang-Yang Lower Boundscited by 17
  7. 2026Reward Learning from Best-of-N Preference Data: Targets, Tradeoffs, and Design Principlescited by 1

Built on by

Not cited yet.