aiqbench analysis
This paper establishes a theoretical breakthrough in off-policy evaluation by proving that additive control variates asymptotically outperform the standard self-normalised inverse propensity scoring method. The findings provide rigorous justification for replacing multiplicative baselines with optimal additive corrections to reduce variance in ranking and recommendation systems without costly online interventions. This shift represents a significant refinement in estimator efficiency within reinforcement learning and information retrieval applications.
Additive Control Variates Dominate Self-Normalisation in Off-Policy Evaluation
arXiv:2602.14914v3 Announce Type: replace Abstract: Off-policy evaluation (OPE) is essential for assessing ranking and recommendation systems without costly online interventions. Self-Normalised Inverse Propensity Scoring (SNIPS) is a standard tool for variance reduction in OPE, leveraging a multiplicative control variate. Recent advances in off-policy learning suggest that additive control variates (baseline corrections) may offer superior performance, yet theoretical guarantees for evaluation are lacking. This paper provides a definitive answer: we prove that $\beta^\star$-IPS, an estimator with an optimal additive baseline, asymptotically dominates SNIPS in Mean Squared Error. By analytically decomposing the variance gap, we show that SNIPS is asymptotically equivalent to using a specific -- but generally sub-optimal -- additive baseline. Our results theoretically justify shifting from self-normalisation to optimal baseline corrections for both ranking and recommendation.
Abstract:Off-policy evaluation (OPE) is essential for assessing ranking and recommendation systems without costly online interventions. Self-Normalised Inverse Propensity Scoring (SNIPS) is a standard tool for variance reduction in OPE, leveraging a multiplicative control variate. Recent advances in off-policy learning suggest that additive control variates (baseline corrections) may offer superior performance, yet theoretical guarantees for evaluation are lacking. This paper provides a definitive answer: we prove that $\beta^\star$-IPS, an estimator with an optimal additive baseline, asymptotically dominates SNIPS in Mean Squared Error. By analytically decomposing the variance gap, we show that SNIPS is asymptotically equivalent to using a specific -- but generally sub-optimal -- additive baseline. Our results theoretically justify shifting from self-normalisation to optimal baseline corrections for both ranking and recommendation.
Machine Learning (cs.LG); Information Retrieval (cs.IR)
arXiv:2602.14914 [cs.LG]
(or arXiv:2602.14914v3 [cs.LG] for this version)
Full text under the publisher's open licence · 135 words
Related coverage

News
Quantum Computing Report · Jun 7, 2026

The Entangled Dimensions of Decision Theory
LessWrong · Jul 30, 2026

[AINews] Reality Checks on AI News (Yegge shuts down Gas Town, Databricks’ +60% Astra cost)
Latent Space · Sep 17, 2026

[AINews] not much happened today
Latent Space · Sep 18, 2026