mlsanityData to 7 Oct 2026

Adaptive Doubly Robust Estimator from Non-stationary Logging Policy under a Convergence of Average Probability

arXiv 2102.08975 ↗First posted 17 Feb 2021stat.ME cs.LG econ.EMcited by 0

Not on the map. Why?

Abstract (arXiv)

Adaptive experiments, including efficient average treatment effect estimation and multi-armed bandit algorithms, have garnered attention in various applications, such as social experiments, clinical trials, and online advertisement optimization. This paper considers estimating the mean outcome of an action from samples obtained in adaptive experiments. In causal inference, the mean outcome of an action has a crucial role, and the estimation is an essential task, where the average treatment effect estimation and off-policy value estimation are its variants. In adaptive experiments, the probability of choosing an action (logging policy) is allowed to be sequentially updated based on past observations. Due to this logging policy depending on the past observations, the samples are often not independent and identically distributed (i.i.d.), making developing an asymptotically normal estimator difficult. A typical approach for this problem is to assume that the logging policy converges in a time-invariant function. However, this assumption is restrictive in various applications, such as when the logging policy fluctuates or becomes zero at some periods. To mitigate this limitation, we propose another assumption that the average logging policy converges to a time-invariant function and show the doubly robust (DR) estimator's asymptotic normality. Under the assumption, the logging policy itself can fluctuate or be zero for some actions. We also show the empirical properties by simulations.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 12 of its 60 references that are in the map. First posted on arXiv 17 Feb 2021.

Builds on

12 of 60 references.

References · 12

  1. 2015Doubly Robust Off-policy Value Evaluation for Reinforcement Learningcited by 337
  2. 2014On the Complexity of Best Arm Identification in Multi-Armed Bandit Modelscited by 280
  3. 2016Optimal Best Arm Identification with Fixed Confidencecited by 233
  4. 2016Optimal and Adaptive Off-policy Evaluation in Contextual Banditscited by 111
  5. 2019Confidence Intervals for Policy Evaluation in Adaptive Experimentscited by 95
  6. 2020Inference for Batched Banditscited by 63
  7. 2020Off-policy Bandits with Deficient Supportcited by 60
  8. 2019Intrinsically Efficient, Stable, and Bounded Off-Policy Evaluation for Reinforcement Learningcited by 28
  9. 2019More Efficient Off-Policy Evaluation through Regularized Targeted Learningcited by 17
  10. 2018Efficient Counterfactual Learning from Bandit Feedbackcited by 15
  11. 2018Asymptotic optimality of adaptive importance samplingcited by 9
  12. 2020Off-Policy Evaluation of Bandit Algorithm from Dependent Samples under Batch Update Policycited by 1

Built on by

Not cited yet.