mlsanityData to 14 Oct 2026

CANDOR: Counterfactual ANnotated DOubly Robust Off-Policy Evaluation

arXiv 2412.08052 ↗First posted 11 Dec 2024cs.LG stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

Off-policy evaluation (OPE) is critical for applying contextual bandit algorithms to high-stakes decision-making settings such as healthcare, where new treatment policies must be evaluated prior to deployment. Unfortunately, OPE techniques are inherently limited by the breadth of the available data, which may not be sufficient to evaluate the performance of a new policy. Recent work attempts to improve dataset coverage by adding expert-annotated counterfactual samples. However, such annotations are often imperfect and can lead to worse estimator performance than using no annotations at all. To better leverage imperfect annotations, we propose a family of OPE estimators grounded in the doubly robust (DR) framework, which combines importance sampling (IS) with a reward model (direct method, DM) for better statistical guarantees. We study three ways of incorporating counterfactual annotations. Under mild assumptions, we prove that using annotations within just the DM component yields the most desirable theoretical results. Experiments on multiple healthcare tasks, including real-world electronic health records (EHR) data, show that this strategy is most robust under misspecified reward models and inaccurate annotations. By addressing the challenges posed by imperfect annotations, this work broadens the applicability of OPE methods and facilitates safer deployment of decision-making policies in healthcare.

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

Builds on

9 of 27 references.

References · 9

  1. 2015Doubly Robust Off-policy Value Evaluation for Reinforcement Learningcited by 339
  2. 2016Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learningcited by 286
  3. 2019Batch Policy Learning under Constraintscited by 244
  4. 2018More Robust Doubly Robust Off-policy Evaluationcited by 141
  5. 2019Empirical Study of Off-Policy Policy Evaluation for Reinforcement Learningcited by 121
  6. 2019Counterfactual Off-Policy Evaluation with Gumbel-Max Structural Causal Modelscited by 117
  7. 2016Q(λ) with Off-Policy Correctionscited by 48
  8. 2020Power Constrained Banditscited by 30
  9. 2023Counterfactual-Augmented Importance Sampling for Semi-Offline Policy Evaluationcited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2023When is Off-Policy Evaluation (Reward Modeling) Useful in Contextual Bandits? A Data-Centric Perspective
  2. 2026Cross-Domain Off-Policy Evaluation and Learning for Contextual Bandits
  3. 2026Optimal Sequential Annotations for Off-Policy Evaluation
  4. 2021Off-Policy Evaluation Using Information Borrowing and Context-Based Switching
  5. 2024OPERA: Automatic Offline Policy Evaluation with Re-weighted Aggregates of Multiple Estimators
  6. 2026Variance-Optimal Off-Policy Evaluation with Conjunct Effect Modeling
  7. 2024Data Poisoning Attacks on Off-Policy Policy Evaluation Methods
  8. 2026From Weighting to Modeling: A Nonparametric Estimator for Off-Policy Evaluation