A/B/n Testing with Control in the Presence of Subpopulations
Yoan Russac, Christina Katsimerou, Dennis Bohle, Olivier Cappé, Aurélien Garivier, Wouter M. Koolen
Abstract
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 , then grows linearly with 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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d3f18d86-135a-434a-a411-2f6e051b36a3Cited by top-tier papers8
- Top Two Algorithms RevisitedMarc Jourdan, Rémy Degenne, Dorian Baudry, Rianne de Heide et al.NeurIPS 2022 · 57 citations
- Near-Optimal Collaborative Learning in BanditsClémence Réda, Sattar Vakili, Emilie KaufmannNeurIPS 2022 · 23 citations
- Multi-Fidelity Best-Arm IdentificationRiccardo Poiani, Alberto Maria Metelli, Marcello RestelliNeurIPS 2022 · 12 citations
- Active Adaptive Experimental Design for Treatment Effect Estimation with Covariate ChoiceMasahiro Kato, Akihiro Oga, Wataru Komatsubara, Ryo InokuchiICML 2024 · 12 citations
- Optimal Multi-Fidelity Best-Arm IdentificationRiccardo Poiani, Rémy Degenne, Emilie Kaufmann, Alberto Maria Metelli et al.NeurIPS 2024 · 9 citations
Related papers
- Optimal Treatment Allocation for Efficient Policy Evaluation in Sequential Decision MakingTing Li, Chengchun Shi, Jianing Wang, Fan Zhou et al.NeurIPS 2023 · 21 citations
- Bandits with many optimal armsRianne de Heide, James Cheshire, Pierre Ménard, Alexandra CarpentierNeurIPS 2021 · 28 citations
- Asymptotically Optimal Quantile Pure Exploration for Infinite-Armed BanditsEvelyn Xiao-Yue Gong, Mark SellkeNeurIPS 2023 · 4 citations
- Finite Continuum-Armed BanditsSolenne GaucherNeurIPS 2020 · 2 citations
- On Universally Optimal Algorithms for A/B TestingPo-An Wang, Kaito Ariu, Alexandre ProutièreICML 2024 · 4 citations
