mlsanityData to 7 Oct 2026

Optimizing Adaptive Experiments: A Unified Approach to Regret Minimization and Best-Arm Identification

arXiv 2402.10592 ↗First posted 16 Feb 2024cs.LG econ.EM stat.MLcited by 9

Not on the map. Why?

Abstract (arXiv)

Practitioners conducting adaptive experiments often encounter two competing priorities: maximizing total welfare (or `reward') through effective treatment assignment and swiftly concluding experiments to implement population-wide treatments. Current literature addresses these priorities separately, with regret minimization studies focusing on the former and best-arm identification research on the latter. This paper bridges this divide by proposing a unified model that simultaneously accounts for within-experiment performance and post-experiment outcomes. We provide a sharp theory of optimal performance in large populations that not only unifies canonical results in the literature but also uncovers novel insights. Our theory reveals that familiar algorithms, such as the recently proposed top-two Thompson sampling algorithm, can optimize a broad class of objectives if a single scalar parameter is appropriately adjusted. In addition, we demonstrate that substantial reductions in experiment duration can often be achieved with minimal impact on both within-experiment and post-experiment regret.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 12 of its 60 references that are in the map. First posted on arXiv 16 Feb 2024.

Builds on

12 of 60 references.

References · 12

  1. 2016Optimal Best Arm Identification with Fixed Confidencecited by 233
  2. 2017Improving the Expected Improvement Algorithmcited by 54
  3. 2022Top Two Algorithms Revisitedcited by 34
  4. 2023On the Existence of a Complexity in Fixed Budget Bandit Identificationcited by 19
  5. 2023Clip-OGD: An Experimental Design for Adaptive Neyman Allocation in Sequential Experimentscited by 16
  6. 2021Policy Choice and Best Arm Identification: Asymptotic Analysis of Exploration Samplingcited by 15
  7. 2021Achieving the Pareto Frontier of Regret Minimization and Best Arm Identification in Multi-Armed Banditscited by 13
  8. 2022Adaptive Experimentation in the Presence of Exogenous Nonstationary Variationcited by 7
  9. 2023Proportional Response: Contextual Bandits for Simple and Cumulative Regret Minimizationcited by 7
  10. 2022Contextual Bandits in a Survey Experiment on Charitable Giving: Within-Experiment Outcomes versus Policy Learningcited by 6
  11. 2023Dual-Directed Algorithm Design for Efficient Pure Explorationcited by 6
  12. 2021Algorithms for Adaptive Experiments that Trade-off Statistical Analysis with Reward: Combining Uniform Random Assignment and Reward Maximizationcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 5; 2026: 3.

9 papers.