Adaptive Experimentation When You Can't Experiment
Yao Zhao, Kwang-Sung Jun, Tanner Fiez, Lalit Jain

TL;DR
This paper develops an adaptive experimental design method for confounded pure exploration in linear bandits, addressing challenges where direct experimentation is infeasible and noise is confounded, with theoretical guarantees and empirical validation.
Contribution
Introduces the CPET-LB problem and a novel elimination algorithm with confidence intervals for confounded linear bandits in encouragement designs.
Findings
Algorithm achieves near-minimax optimal sample complexity.
Method effectively handles confounded noise in pure exploration.
Experiments validate the approach's practical efficacy.
Abstract
This paper introduces the \emph{confounded pure exploration transductive linear bandit} (\texttt{CPET-LB}) problem. As a motivating example, often online services cannot directly assign users to specific control or treatment experiences either for business or practical reasons. In these settings, naively comparing treatment and control groups that may result from self-selection can lead to biased estimates of underlying treatment effects. Instead, online services can employ a properly randomized encouragement that incentivizes users toward a specific treatment. Our methodology provides online services with an adaptive experimental design approach for learning the best-performing treatment for such \textit{encouragement designs}. We consider a more general underlying model captured by a linear structural equation and formulate pure exploration linear bandits in this setting. Though pure…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsSimulation Techniques and Applications · Advanced Multi-Objective Optimization Algorithms
