Adaptive Identification of Populations with Treatment Benefit in Clinical Trials: Machine Learning Challenges and Solutions

• URL: http://arxiv.org/abs/2208.05844v2
• Date: Mon, 5 Jun 2023 15:22:59 GMT
• Title: Adaptive Identification of Populations with Treatment Benefit in Clinical Trials: Machine Learning Challenges and Solutions
• Authors: Alicia Curth and Alihan H\"uy\"uk and Mihaela van der Schaar
• Abstract summary: We study the problem of adaptively identifying patient subpopulations that benefit from a given treatment during a confirmatory clinical trial. We propose AdaGGI and AdaGCPI, two meta-algorithms for subpopulation construction.
• Score: 78.31410227443102
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Optimizing Adaptive Experiments: A Unified Approach to Regret Minimization and Best-Arm Identification [9.030753181146176]
  We propose a unified model that simultaneously accounts for within-experiment performance and post-experiment outcomes. We show that substantial reductions in experiment duration can often be achieved with minimal impact on both within-experiment and post-experiment regret.
  arXiv  Detail & Related papers  (2024-02-16T11:27:48Z)
• Optimizing Skin Lesion Classification via Multimodal Data and Auxiliary Task Integration [54.76511683427566]
  This research introduces a novel multimodal method for classifying skin lesions, integrating smartphone-captured images with essential clinical and demographic information. A distinctive aspect of this method is the integration of an auxiliary task focused on super-resolution image prediction. The experimental evaluations have been conducted using the PAD-UFES20 dataset, applying various deep-learning architectures.
  arXiv  Detail & Related papers  (2024-02-16T05:16:20Z)
• Adaptive Experiment Design with Synthetic Controls [79.69661880236293]
  We propose Syntax, an exploratory trial design that identifies subpopulations with positive treatment effect among many subpopulations. We validate the performance of Syntax and provide insights into when it might have an advantage over conventional trial designs through experiments.
  arXiv  Detail & Related papers  (2024-01-30T17:45:47Z)
• A Flexible Framework for Incorporating Patient Preferences Into Q-Learning [1.2891210250935146]
  In real-world healthcare problems, there are often multiple competing outcomes of interest, such as treatment efficacy and side effect severity. statistical methods for estimating dynamic treatment regimes (DTRs) usually assume a single outcome of interest. This includes restrictions to a single time point and two outcomes, the inability to incorporate self-reported patient preferences and limited theoretical guarantees.
  arXiv  Detail & Related papers  (2023-07-22T08:58:07Z)
• Self-accumulative Vision Transformer for Bone Age Assessment Using the Sauvegrain Method [3.5814626468819046]
  This study presents a novel approach to bone age assessment (BAA) using a multi-view, multi-task classification model based on the Sauvegrain method. A self-accumulative vision transformer (SAT) that mitigates anisotropic behavior is proposed.
  arXiv  Detail & Related papers  (2023-03-29T09:26:54Z)
• Clinical trial site matching with improved diversity using fair policy learning [56.01170456417214]
  We learn a model that maps a clinical trial description to a ranked list of potential trial sites. Unlike existing fairness frameworks, the group membership of each trial site is non-binary. We propose fairness criteria based on demographic parity to address such a multi-group membership scenario.
  arXiv  Detail & Related papers  (2022-04-13T16:35:28Z)
• Select-ProtoNet: Learning to Select for Few-Shot Disease Subtype Prediction [55.94378672172967]
  We focus on few-shot disease subtype prediction problem, identifying subgroups of similar patients. We introduce meta learning techniques to develop a new model, which can extract the common experience or knowledge from interrelated clinical tasks. Our new model is built upon a carefully designed meta-learner, called Prototypical Network, that is a simple yet effective meta learning machine for few-shot image classification.
  arXiv  Detail & Related papers  (2020-09-02T02:50:30Z)
• Bloom Origami Assays: Practical Group Testing [90.2899558237778]
  Group testing is a well-studied problem with several appealing solutions. Recent biological studies impose practical constraints for COVID-19 that are incompatible with traditional methods. We develop a new method combining Bloom filters with belief propagation to scale to larger values of n (more than 100) with good empirical results.
  arXiv  Detail & Related papers  (2020-07-21T19:31:41Z)
• Efficient Discovery of Heterogeneous Quantile Treatment Effects in Randomized Experiments via Anomalous Pattern Detection [1.9346186297861747]
  Treatment Effect Subset Scan (TESS) is a new method for discovering which subpopulation in a randomized experiment is most significantly affected by a treatment. In addition to the algorithm, we demonstrate that under the sharp null hypothesis of no treatment effect, the Type I and II error can be controlled.
  arXiv  Detail & Related papers  (2018-03-24T20:21:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.