Pointwise or Pairwise: When Do Pairwise Losses Help Reward Learning, Provably?
Authors: Junghyun Lee, Minsoo Ha, Sanghwa Kim, Yeongjong Kim, Eunjee Lee, Seiyun Shin, Kwang-Sung Jun
Organizations: Kim Jaechul Graduate School of AI, KAIST Seoul 02455, Republic of Korea · Graduate School of AI, POSTECH Pohang 37673, Republic of Korea · Samsung Research Seoul 06765, Republic of Korea · Independent Researcher Cambridge, MA, USA
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.
Figures & tables
Figure 1: Left: synthetic regret difference RegVR−RegVDR as the cross-face probability δ and nuisance magnitude β vary; negative values favor VR and positive values favor VDR . Right: real-data regret versus the number of labeled responses per training prompt; lower is better. Error bars are pointwise 95% Student- t intervals over five seeds.
Appendix figures & tables5 assets
Supplementary material from the paper’s appendix.
Appendix
δ
β=0
β=0.25
β=0.5
β=1
β=2
0.00
−0.8390
−0.8330
−0.8154
−0.7472
−0.5686
0.02
−0.0040
+0.0014
+0.0188
+0.0813
+0.2485
0.05
−0.0013
+0.0036
+0.0189
+0.0737
+0.2298
0.10
−0.0007
+0.0033
+0.0157
+0.0592
+0.1978
0.20
−0.0002
+0.0019
+0.0090
+0.0340
+0.1250
0.50
−0.0001
+0.0000
+0.0002
+0.0012
+0.0045
Appendix
Table 2: Mean greedy-regret difference ΔReg in the crossover grid ( ρ=1 ). Negative values favor VR and positive values favor VDR .
Figure 2: Crossover grid ( ρ=1 ). Top left: RegVR−RegVDR ; negative values favor VR and positive values favor VDR . Top right and bottom left: mean α selected by difference-CV and by Oracle . Bottom right: regret of the better of VR and VDR minus that of difference-CV ; positive values mean that difference-CV improves on both.
Figure 3: Alignment sweep at fixed (δ,β)=(0.02,0) . Left: greedy-policy regret as the true value direction moves toward the weak first action coordinate; CV-best denotes difference-CV . Right: the fractions κmean (“mean”) and κdiff (“difference”) of the target’s second moment contributed by its conditional mean and centered component, respectively; see ( 311 ).
Figure 4: Paired regret differences on the 200 evaluation prompts, RegVDR−RegVR , with pointwise 95% Student- t confidence intervals over five seeds. Negative values favor VDR .
Reward head
Accuracy (%)
Linear VR
15
Linear VDR
16
MLP VR
10
MLP VDR
13
Appendix
Table 3: Final-answer accuracy on 100 test problems under a common MCTS budget. Each method uses one search seed; MLPs use one prespecified refit.