mlsanityData to 7 Oct 2026

A/B/n Testing with Control in the Presence of Subpopulations

arXiv 2110.15573 ↗First posted 29 Oct 2021stat.ML cs.LGcited by 17

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

  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. 2018Mixture Martingales Revisited with Applications to Sequential Tests and Confidence Intervalscited by 76
  4. 2013Follow the Leader If You Can, Hedge If You Mustcited by 68
  5. 2016An optimal algorithm for the Thresholding Bandit Problemcited by 62
  6. 2019Non-Asymptotic Pure Exploration by Solving Gamescited by 62
  7. 2019Pure Exploration with Multiple Correct Answerscited by 60
  8. 2017Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selectioncited by 28
  9. 2015Always Valid Inference: Bringing Sequential Analysis to A/B Testingcited by 20
  10. 2017A framework for Multi-A(rmed)/B(andit) testing with online FDR controlcited by 17
  11. 2020The Influence of Shape Constraints on the Thresholding Bandit Problemcited by 11

Built on by

Cited by year (2026 to 7 Oct)

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

17 papers.

Sort:

By area: