Best Arm Identification with Contextual Information under a Small Gap
Not on the map. Why?
Abstract (arXiv)
We study the best-arm identification (BAI) problem with a fixed budget and contextual (covariate) information. In each round of an adaptive experiment, after observing contextual information, we choose a treatment arm using past observations and current context. Our goal is to identify the best treatment arm, which is a treatment arm with the maximal expected reward marginalized over the contextual distribution, with a minimal probability of misidentification. In this study, we consider a class of nonparametric bandit models that converge to location-shift models when the gaps go to zero. First, we derive lower bounds of the misidentification probability for a certain class of strategies and bandit models (probabilistic models of potential outcomes) under a small-gap regime. A small-gap regime is a situation where gaps of the expected rewards between the best and suboptimal treatment arms go to zero, which corresponds to one of the worst cases in identifying the best treatment arm. We then develop the ``Random Sampling (RS)-Augmented Inverse Probability weighting (AIPW) strategy,'' which is asymptotically optimal in the sense that the probability of misidentification under the strategy matches the lower bound when the budget goes to infinity in the small-gap regime. The RS-AIPW strategy consists of the RS rule tracking a target sample allocation ratio and the recommendation rule using the AIPW estimator.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 34 of its 105 references that are in the map. First posted on arXiv 15 Sep 2022.
Builds on
34 of 105 references.
References · 34
- 2014On the Complexity of Best Arm Identification in Multi-Armed Bandit Modelscited by 286
- 2016Optimal Best Arm Identification with Fixed Confidencecited by 239
- 2018Time-uniform, nonparametric, nonasymptotic confidence sequencescited by 229
- 2013lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Banditscited by 149
- 2016Simple Bayesian Algorithms for Best Arm Identificationcited by 117
- 2019Confidence Intervals for Policy Evaluation in Adaptive Experimentscited by 95
- 2016Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problemcited by 79
- 2018Mixture Martingales Revisited with Applications to Sequential Tests and Confidence Intervalscited by 76
- 2019Non-Asymptotic Pure Exploration by Solving Gamescited by 63
- 2017Improving the Expected Improvement Algorithmcited by 54
- 2020An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Banditscited by 45
- 2021Off-Policy Evaluation via Adaptive Weighting with Data from Contextual Banditscited by 40
22 more
- 2019Fixed-Confidence Guarantees for Bayesian Best-Arm Identificationcited by 38
- 2015The Influence Function of Semiparametric Estimatorscited by 36
- 2022Top Two Algorithms Revisitedcited by 34
- 2021Post-Contextual-Bandit Inferencecited by 32
- 2021Online Multi-Armed Bandits with Adaptive Inferencecited by 22
- 2021Doubly robust Thompson sampling for linear payoffscited by 21
- 2015Sequential Nonparametric Testing with the Law of the Iterated Logarithmcited by 20
- 2022Minimax Optimal Algorithms for Fixed-Budget Best Arm Identificationcited by 20
- 2017Policy Learning with Observational Datacited by 19
- 2018Nonparametric Stochastic Contextual Banditscited by 17
- 2021A/B/n Testing with Control in the Presence of Subpopulationscited by 17
- 2018Simple Regret Minimization for Contextual Banditscited by 16
- 2021Policy Choice and Best Arm Identification: Asymptotic Analysis of Exploration Samplingcited by 15
- 2014On the Complexity of A/B Testingcited by 14
- 2018Stratification Trees for Adaptive Randomization in Randomized Controlled Trialscited by 14
- 2018Sample complexity of partition identification using multi-armed banditscited by 13
- 2021Diffusion Approximations for Thompson Sampling in the Small Gap Regimecited by 12
- 2021Efficient Online Estimation of Causal Effects by Deciding What to Observecited by 11
- 2021The Role of Contextual Information in Best Arm Identificationcited by 8
- 2022Asymptotic Efficiency Bounds for a Class of Experimental Designscited by 8
- 2015RELEAF: An Algorithm for Learning and Exploiting Relevancecited by 7
- 2019Dynamically Aggregating Diverse Informationcited by 5
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.
- 2025Towards Regulatory-Confirmed Adaptive Clinical Trials: Machine Learning Opportunities and Solutionscited by 3
- 2025Conformal bandits: bringing statistical validity and reward efficiency under weak arm separabilitycited by 0
- 2026Active Context Selection Improves Simple Regret in Contextual Banditscited by 0
- 2026Active Context Selection Improves Simple Regret in Contextual Bandits19 May 2026
- 2025Conformal bandits: bringing statistical validity and reward efficiency under weak arm separability10 Dec 2025
- 2025Towards Regulatory-Confirmed Adaptive Clinical Trials: Machine Learning Opportunities and Solutions12 Mar 2025