mlsanityData to 7 Oct 2026

Adaptive Experimental Design for Policy Learning

arXiv 2401.03756 ↗First posted 8 Jan 2024cs.LG cs.AI econ.EMcited by 1

Not on the map. Why?

Abstract (arXiv)

This study investigates the contextual best arm identification (BAI) problem, aiming to design an adaptive experiment to identify the best treatment arm conditioned on contextual information (covariates). We consider a decision-maker who assigns treatment arms to experimental units during an experiment and recommends the estimated best treatment arm based on the contexts at the end of the experiment. The decision-maker uses a policy for recommendations, which is a function that provides the estimated best treatment arm given the contexts. In our evaluation, we focus on the worst-case expected regret, a relative measure between the expected outcomes of an optimal policy and our proposed policy. We derive a lower bound for the expected simple regret and then propose a strategy called Adaptive Sampling-Policy Learning (PLAS). We prove that this strategy is minimax rate-optimal in the sense that its leading factor in the regret upper bound matches the lower bound as the number of experimental units increases.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 40 of its 101 references that are in the map. First posted on arXiv 8 Jan 2024.

Builds on

40 of 101 references.

References · 40

  1. 2014On the Complexity of Best Arm Identification in Multi-Armed Bandit Modelscited by 280
  2. 2016Optimal Best Arm Identification with Fixed Confidencecited by 233
  3. 2018Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Banditscited by 123
  4. 2016Simple Bayesian Algorithms for Best Arm Identificationcited by 116
  5. 2019Confidence Intervals for Policy Evaluation in Adaptive Experimentscited by 95
  6. 2016Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problemcited by 79
  7. 2018Offline Multi-Action Policy Learning: Generalization and Optimizationcited by 64
  8. 2017Improving the Expected Improvement Algorithmcited by 54
  9. 2019Fixed-Confidence Guarantees for Bayesian Best-Arm Identificationcited by 38
  10. 2015Counterfactual Risk Minimization: Learning from Logged Bandit Feedbackcited by 33
  11. 2021Minimax Optimal Fixed-Budget Best Arm Identification in Linear Banditscited by 32
  12. 2023Semiparametric Efficient Inference in Adaptive Experimentscited by 23
28 more
  1. 2021Doubly robust Thompson sampling for linear payoffscited by 21
  2. 2021Policy Learning with Adaptively Collected Datacited by 21
  3. 2022Minimax Optimal Algorithms for Fixed-Budget Best Arm Identificationcited by 20
  4. 2023On the Existence of a Complexity in Fixed Budget Bandit Identificationcited by 19
  5. 2023Open Problem: Optimal Best Arm Identification with Fixed Budgetcited by 18
  6. 2018Nonparametric Stochastic Contextual Banditscited by 17
  7. 2021A/B/n Testing with Control in the Presence of Subpopulationscited by 17
  8. 2018Simple Regret Minimization for Contextual Banditscited by 16
  9. 2021Improved Analysis of the Tsallis-INF Algorithm in Stochastically Constrained Adversarial Bandits and Stochastic Bandits with Adversarial Corruptionscited by 15
  10. 2021Policy Choice and Best Arm Identification: Asymptotic Analysis of Exploration Samplingcited by 15
  11. 2023On the Complexity of Multi-Agent Decision Making: From Learning in Games to Partial Monitoringcited by 15
  12. 2018Stratification Trees for Adaptive Randomization in Randomized Controlled Trialscited by 14
  13. 2022Dealing with Unknown Variances in Best-Arm Identificationcited by 13
  14. 2022Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Boundscited by 12
  15. 2022Bayesian Fixed-Budget Best-Arm Identificationcited by 12
  16. 2021Efficient Online Estimation of Causal Effects by Deciding What to Observecited by 11
  17. 2021Rate-optimal Bayesian Simple Regret in Best Arm Identificationcited by 11
  18. 2020Experimental Design under Network Interferencecited by 9
  19. 2021The Role of Contextual Information in Best Arm Identificationcited by 8
  20. 2022Asymptotic Efficiency Bounds for a Class of Experimental Designscited by 8
  21. 2022Upper bounds on the Natarajan dimensions of some function classescited by 8
  22. 2015RELEAF: An Algorithm for Learning and Exploiting Relevancecited by 7
  23. 2023Fixed-Budget Best-Arm Identification with Heterogeneous Reward Variancescited by 6
  24. 2023Asymptotically Optimal Fixed-Budget Best Arm Identification with Variance-Dependent Boundscited by 3
  25. 2023Worst-Case Optimal Multi-Armed Gaussian Best Arm Identification with a Fixed Budgetcited by 3
  26. 2023Locally Optimal Fixed-Budget Best Arm Identification in Two-Armed Gaussian Bandits with Unknown Variancescited by 3
  27. 2015Clinical trial design enabling ε-optimal treatment rulescited by 2
  28. 2020Treatment recommendation with distributional targetscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.