Adaptive Identification of Populations with Treatment Benefit in Clinical Trials: Machine Learning Challenges and Solutions
Not on the map. Why?
Abstract (arXiv)
We study the problem of adaptively identifying patient subpopulations that benefit from a given treatment during a confirmatory clinical trial. This type of adaptive clinical trial has been thoroughly studied in biostatistics, but has been allowed only limited adaptivity so far. Here, we aim to relax classical restrictions on such designs and investigate how to incorporate ideas from the recent machine learning literature on adaptive and online experimentation to make trials more flexible and efficient. We find that the unique characteristics of the subpopulation selection problem -- most importantly that (i) one is usually interested in finding subpopulations with any treatment benefit (and not necessarily the single subgroup with largest effect) given a limited budget and that (ii) effectiveness only has to be demonstrated across the subpopulation on average -- give rise to interesting challenges and new desiderata when designing algorithmic solutions. Building on these findings, we propose AdaGGI and AdaGCPI, two meta-algorithms for subpopulation construction. We empirically investigate their performance across a range of simulation scenarios and derive insights into their (dis)advantages across different settings.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 21 of its 76 references that are in the map. First posted on arXiv 11 Aug 2022.
Builds on
21 of 76 references.
References · 21
- 2015Estimation and Inference of Heterogeneous Treatment Effects using Random Forestscited by 600
- 2014On the Complexity of Best Arm Identification in Multi-Armed Bandit Modelscited by 286
- 2016Optimal Best Arm Identification with Fixed Confidencecited by 239
- 2013lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Banditscited by 149
- 2016Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problemcited by 79
- 2021On Inductive Biases for Heterogeneous Treatment Effect Estimationcited by 75
- 2019Pure Exploration with Multiple Correct Answerscited by 64
- 2016An optimal algorithm for the Thresholding Bandit Problemcited by 62
- 2019The True Sample Complexity of Identifying Good Armscited by 37
- 2017Why Adaptively Collected Data Have Negative Bias and How to Correct for Itcited by 36
- 2017Good Arm Identification via Bandit Feedbackcited by 30
- 2018Best arm identification in multi-armed bandits with delayed feedbackcited by 29
9 more
- 2019Are sample means in multi-armed bandits positively or negatively biased?cited by 24
- 2015Always Valid Inference: Bringing Sequential Analysis to A/B Testingcited by 20
- 2021A/B/n Testing with Control in the Presence of Subpopulationscited by 17
- 2017Thresholding Bandits with Augmented UCBcited by 11
- 2021A unified framework for bandit multiple testingcited by 8
- 2019Online control of the familywise error ratecited by 7
- 2017Asynchronous Parallel Empirical Variance Guided Algorithms for the Thresholding Bandit Problemcited by 6
- 2019Thresholding Bandit with Optimal Aggregate Regretcited by 6
- 2020Blinded sample size re-calculation in multiple composite population designs with normal data and baseline adjustmentscited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.