mlsanityData to 14 Oct 2026

Long-term Off-Policy Evaluation and Learning

arXiv 2404.15691 ↗First posted 24 Apr 2024cs.LG stat.MLcited by 9

Not on the map. Why?

Abstract (arXiv)

Short- and long-term outcomes of an algorithm often differ, with damaging downstream effects. A known example is a click-bait algorithm, which may increase short-term clicks but damage long-term user engagement. A possible solution to estimate the long-term outcome is to run an online experiment or A/B test for the potential algorithms, but it takes months or even longer to observe the long-term outcomes of interest, making the algorithm selection process unacceptably slow. This work thus studies the problem of feasibly yet accurately estimating the long-term outcome of an algorithm using only historical and short-term experiment data. Existing approaches to this problem either need a restrictive assumption about the short-term outcomes called surrogacy or cannot effectively use short-term outcomes, which is inefficient. Therefore, we propose a new framework called Long-term Off-Policy Evaluation (LOPE), which is based on reward function decomposition. LOPE works under a more relaxed assumption than surrogacy and effectively leverages short-term rewards to substantially reduce the variance. Synthetic experiments show that LOPE outperforms existing approaches particularly when surrogacy is severely violated and the long-term reward is noisy. In addition, real-world experiments on large-scale A/B test data collected on a music streaming platform show that LOPE can estimate the long-term outcome of actual algorithms more accurately than existing feasible methods.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 24 of its 42 references that are in the map. First posted on arXiv 24 Apr 2024.

Builds on

24 of 42 references.

References · 24

  1. 2015Doubly Robust Policy Evaluation and Optimizationcited by 158
  2. 2018More Robust Doubly Robust Off-policy Evaluationcited by 141
  3. 2019Empirical Study of Off-Policy Policy Evaluation for Reinforcement Learningcited by 121
  4. 2016Optimal and Adaptive Off-policy Evaluation in Contextual Banditscited by 111
  5. 2022A Review of Off-Policy Evaluation in Reinforcement Learningcited by 95
  6. 2019Doubly robust off-policy evaluation with shrinkagecited by 87
  7. 2020Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluationcited by 77
  8. 2020Off-policy Bandits with Deficient Supportcited by 61
  9. 2022Off-Policy Evaluation for Large Action Spaces via Embeddingscited by 54
  10. 2020On the role of surrogates in the efficient estimation of treatment effects with limited outcome datacited by 38
  11. 2020Optimal Off-Policy Evaluation from Multiple Logging Policiescited by 30
  12. 2022Doubly Robust Off-Policy Evaluation for Ranking Policies under the Cascade Behavior Modelcited by 30
12 more
  1. 2020Using Experiments to Correct for Selection in Observational Studiescited by 28
  2. 2020Targeting for long-term outcomescited by 23
  3. 2017Effective Evaluation using Logged Bandit Feedback from Multiple Loggerscited by 20
  4. 2023Impatient Bandits: Optimizing Recommendations for the Long-Term Without Delaycited by 17
  5. 2024Off-Policy Evaluation of Slate Bandit Policies via Optimizing Abstractioncited by 17
  6. 2023Off-Policy Evaluation of Ranking Policies under Diverse User Behaviorcited by 16
  7. 2020Long-Term Effect Estimation with Surrogate Representationcited by 15
  8. 2023Exponential Smoothing for Off-Policy Learningcited by 15
  9. 2023Towards Assessing and Benchmarking Risk-Return Tradeoff of Off-Policy Evaluationcited by 13
  10. 2024POTEC: Off-Policy Learning for Large Action Spaces via Two-Stage Policy Decompositioncited by 13
  11. 2023Learning Action Embeddings for Off-Policy Evaluationcited by 7
  12. 2023Estimating Effects of Long-Term Treatmentscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 2; 2025: 4; 2026: 3.

9 papers.