Adaptive Experimentation When You Can't Experiment
원문 초록
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 exploration has been extensively studied in standard adaptive experimental design settings, we believe this is the first work considering a setting where noise is confounded. Elimination-style algorithms using experimental design methods in combination with a novel finite-time confidence interval on an instrumental variable style estimator are presented with sample complexity upper bounds nearly matching a minimax lower bound. Finally, experiments are conducted that demonstrate the efficacy of our approach.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
ALINE: Joint Amortization for Bayesian Inference and Active Data Acquisition
Assessing parameter identifiability of a hemodynamics PDE model using spectral surrogates and dimension reduction
OmicsQ: A User-Friendly Platform for Interactive Quantitative Omics Data Analysis
A friendly introduction to triangular transport
Kernel Learning Assisted Synthesis Condition Exploration for Ternary Spinel
How causal perspectives can inform problems in computational neuroscience
토론
이 논문과 연결된 포럼 글이 아직 없습니다.