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

10/29/2021
by   Yoan Russac, et al.
0

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 𝔼[τ_δ] 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/09/2022

Optimal Clustering with Bandit Feedback

This paper considers the problem of online clustering with bandit feedba...
research
02/15/2021

Top-k eXtreme Contextual Bandits with Arm Hierarchy

Motivated by modern applications, such as online advertisement and recom...
research
01/22/2023

Doubly Adversarial Federated Bandits

We study a new non-stochastic federated multi-armed bandit problem with ...
research
08/23/2015

The Max K-Armed Bandit: A PAC Lower Bound and tighter Algorithms

We consider the Max K-Armed Bandit problem, where a learning agent is fa...
research
08/24/2019

Optimal best arm selection for general distributions

Given a finite set of unknown distributions or arms that can be sampled ...
research
07/15/2021

A unified framework for bandit multiple testing

In bandit multiple hypothesis testing, each arm corresponds to a differe...
research
09/21/2023

Optimal Conditional Inference in Adaptive Experiments

We study batched bandit experiments and consider the problem of inferenc...

Please sign up or login with your details

Forgot password? Click here to reset