A/B/n Testing with Control in the Presence of Subpopulations
Not on the map. Why?
Abstract (arXiv)
Motivated by A/B/n testing applications, we consider a finite set of distributions (called arms), one of which is treated as a control. We assume that the population is stratified into homogeneous subpopulations. At every time step, a subpopulation is sampled and an arm is chosen: the resulting observation is an independent draw from the arm conditioned on the subpopulation. The quality of each arm is assessed through a weighted combination of its subpopulation means. We propose a strategy for sequentially choosing one arm per time step so as to discover as fast as possible which arms, if any, have higher weighted expectation than the control. This strategy is shown to be asymptotically optimal in the following sense: if τδ is the first time when the strategy ensures that it is able to output the correct answer with probability at least 1-δ, then mathbbE[τδ] grows linearly with log(1/δ) at the exact optimal rate. This rate is identified in the paper in three different settings: (1) when the experimenter does not observe the subpopulation information, (2) when the subpopulation of each sample is observed but not chosen, and (3) when the experimenter can select the subpopulation from which each response is sampled. We illustrate the efficiency of the proposed strategy with numerical simulations on synthetic and real data collected from an A/B/n experiment.
Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). Builds on 11 of its 18 references that are in the map. First posted on arXiv 29 Oct 2021.
Builds on
11 of 18 references.
References · 11
- 2014On the Complexity of Best Arm Identification in Multi-Armed Bandit Modelscited by 280
- 2016Optimal Best Arm Identification with Fixed Confidencecited by 233
- 2018Mixture Martingales Revisited with Applications to Sequential Tests and Confidence Intervalscited by 76
- 2013Follow the Leader If You Can, Hedge If You Mustcited by 68
- 2016An optimal algorithm for the Thresholding Bandit Problemcited by 62
- 2019Non-Asymptotic Pure Exploration by Solving Gamescited by 62
- 2019Pure Exploration with Multiple Correct Answerscited by 60
- 2017Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selectioncited by 28
- 2015Always Valid Inference: Bringing Sequential Analysis to A/B Testingcited by 20
- 2017A framework for Multi-A(rmed)/B(andit) testing with online FDR controlcited by 17
- 2020The Influence of Shape Constraints on the Thresholding Bandit Problemcited by 11
Built on by
Citing papers per year: 2022: 5; 2023: 3; 2024: 5; 2025: 3; 2026: 1.
17 papers.
Sort:
By area:
- 2022Top Two Algorithms Revisitedcited by 34
- 2024Is Your LLM Outdated? A Deep Look at Temporal Generalizationcited by 25
- 2022Near-Optimal Collaborative Learning in Banditscited by 18
- 2025Sequential Learning of the Pareto Front for Multi-objective Banditscited by 13
- 2024Active Adaptive Experimental Design for Treatment Effect Estimation with Covariate Choicescited by 12
- 2023Best Arm Identification with Fairness Constraints on Subpopulationscited by 8
- 2024Optimal Multi-Fidelity Best-Arm Identificationcited by 8
- 2024Best-Arm Identification in Unimodal Banditscited by 6
- 2022Optimal Best Arm Identification in Two-Armed Bandits with a Fixed Budget under a Small Gapcited by 4
- 2022Best Arm Identification with Contextual Information under a Small Gapcited by 3
- 2023Asymptotically Optimal Fixed-Budget Best Arm Identification with Variance-Dependent Boundscited by 3
- 2022Adaptive Identification of Populations with Treatment Benefit in Clinical Trials: Machine Learning Challenges and Solutionscited by 2
5 more
- 2023Pure Exploration under Mediators' Feedbackcited by 1
- 2024Adaptive Experimental Design for Policy Learningcited by 1
- 2025Multi-Metric Adaptive Experimental Design Under a Fixed Budget with Validationcited by 1
- 2025Pure Exploration with Infinite Answerscited by 0
- 2026Active Context Selection Improves Simple Regret in Contextual Banditscited by 0
- 2026Active Context Selection Improves Simple Regret in Contextual Bandits19 May 2026
- 2025Multi-Metric Adaptive Experimental Design Under a Fixed Budget with Validation3 Jun 2025
- 2025Pure Exploration with Infinite Answers28 May 2025
- 2025Sequential Learning of the Pareto Front for Multi-objective Bandits29 Jan 2025
- 2024Best-Arm Identification in Unimodal Bandits4 Nov 2024
- 2024Optimal Multi-Fidelity Best-Arm Identification5 Jun 2024
- 2024Is Your LLM Outdated? A Deep Look at Temporal Generalization14 May 2024
- 2024Active Adaptive Experimental Design for Treatment Effect Estimation with Covariate Choices6 Mar 2024
- 2024Adaptive Experimental Design for Policy Learning8 Jan 2024
- 2023Pure Exploration under Mediators' Feedback29 Aug 2023
- 2023Best Arm Identification with Fairness Constraints on Subpopulations8 Apr 2023
- 2023Asymptotically Optimal Fixed-Budget Best Arm Identification with Variance-Dependent Bounds6 Feb 2023
5 more
- 2022Best Arm Identification with Contextual Information under a Small Gap15 Sep 2022
- 2022Adaptive Identification of Populations with Treatment Benefit in Clinical Trials: Machine Learning Challenges and Solutions11 Aug 2022
- 2022Top Two Algorithms Revisited13 Jun 2022
- 2022Near-Optimal Collaborative Learning in Bandits31 May 2022
- 2022Optimal Best Arm Identification in Two-Armed Bandits with a Fixed Budget under a Small Gap12 Jan 2022
- 2023Pure Exploration under Mediators' Feedbackcited by 1
- 2023Pure Exploration under Mediators' Feedback29 Aug 2023
- 2022Top Two Algorithms Revisitedcited by 34
- 2024Is Your LLM Outdated? A Deep Look at Temporal Generalizationcited by 25
- 2022Near-Optimal Collaborative Learning in Banditscited by 18
- 2025Sequential Learning of the Pareto Front for Multi-objective Banditscited by 13
- 2024Active Adaptive Experimental Design for Treatment Effect Estimation with Covariate Choicescited by 12
- 2023Best Arm Identification with Fairness Constraints on Subpopulationscited by 8
- 2024Optimal Multi-Fidelity Best-Arm Identificationcited by 8
- 2024Best-Arm Identification in Unimodal Banditscited by 6
- 2022Optimal Best Arm Identification in Two-Armed Bandits with a Fixed Budget under a Small Gapcited by 4
- 2022Best Arm Identification with Contextual Information under a Small Gapcited by 3
- 2023Asymptotically Optimal Fixed-Budget Best Arm Identification with Variance-Dependent Boundscited by 3
- 2022Adaptive Identification of Populations with Treatment Benefit in Clinical Trials: Machine Learning Challenges and Solutionscited by 2
12 most cited of 16 All 16 (JSON)
- 2026Active Context Selection Improves Simple Regret in Contextual Bandits19 May 2026
- 2025Multi-Metric Adaptive Experimental Design Under a Fixed Budget with Validation3 Jun 2025
- 2025Pure Exploration with Infinite Answers28 May 2025
- 2025Sequential Learning of the Pareto Front for Multi-objective Bandits29 Jan 2025
- 2024Best-Arm Identification in Unimodal Bandits4 Nov 2024
- 2024Optimal Multi-Fidelity Best-Arm Identification5 Jun 2024
- 2024Is Your LLM Outdated? A Deep Look at Temporal Generalization14 May 2024
- 2024Active Adaptive Experimental Design for Treatment Effect Estimation with Covariate Choices6 Mar 2024
- 2024Adaptive Experimental Design for Policy Learning8 Jan 2024
- 2023Best Arm Identification with Fairness Constraints on Subpopulations8 Apr 2023
- 2023Asymptotically Optimal Fixed-Budget Best Arm Identification with Variance-Dependent Bounds6 Feb 2023
- 2022Best Arm Identification with Contextual Information under a Small Gap15 Sep 2022
12 newest of 16 All 16 (JSON)