A Contextual-bandit-based Approach for Informed Decision-making in Clinical Trials
Not on the map. Why?
Abstract (arXiv)
Clinical trials involving multiple treatments utilize randomization of the treatment assignments to enable the evaluation of treatment efficacies in an unbiased manner. Such evaluation is performed in post hoc studies that usually use supervised-learning methods that rely on large amounts of data collected in a randomized fashion. That approach often proves to be suboptimal in that some participants may suffer and even die as a result of having not received the most appropriate treatments during the trial. Reinforcement-learning methods improve the situation by making it possible to learn the treatment efficacies dynamically during the course of the trial, and to adapt treatment assignments accordingly. Recent efforts using textitmulti-arm bandits, a type of reinforcement-learning methods, have focused on maximizing clinical outcomes for a population that was assumed to be homogeneous. However, those approaches have failed to account for the variability among participants that is becoming increasingly evident as a result of recent clinical-trial-based studies. We present a contextual-bandit-based online treatment optimization algorithm that, in choosing treatments for new participants in the study, takes into account not only the maximization of the clinical outcomes but also the patient characteristics. We evaluated our algorithm using a real clinical trial dataset from the International Stroke Trial. The results of our retrospective analysis indicate that the proposed approach performs significantly better than either a random assignment of treatments (the current gold standard) or a multi-arm-bandit-based approach, providing substantial gains in the percentage of participants who are assigned the most suitable treatments. The contextual-bandit and multi-arm bandit approaches provide 72.63% and 64.34% gains, respectively, compared to a random assignment.
Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 1 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 3; 2024: 1; 2025: 6; 2026: 5.
18 papers.
Sort:
- 2023Nash Regret Guarantees for Linear Banditscited by 9
- 2022Multi-disciplinary fairness considerations in machine learning for clinical trialscited by 8
- 2023Doubly Adversarial Federated Banditscited by 7
- 2021SDF-Bayes: Cautious Optimism in Safe Dose-Finding Clinical Trials with Drug Combinations and Heterogeneous Patient Groupscited by 6
- 2025Towards Regulatory-Confirmed Adaptive Clinical Trials: Machine Learning Opportunities and Solutionscited by 3
- 2022Worst-case Performance of Greedy Policies in Bandits with Imperfect Context Observationscited by 2
- 2025Clustering Context in Off-Policy Evaluationcited by 2
- 2025Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Banditscited by 2
- 2025Tailored Behavior-Change Messaging for Physical Activity: Integrating Contextual Bandits and Large Language Modelscited by 1
- 2025Prior-informed optimization of treatment recommendation via bandit algorithms trained on large language model-processed historical recordscited by 1
- 2026Active Learning for Stochastic Contextual Linear Banditscited by 1
- 2023AI in Pharma for Personalized Sequential Decision-Making: Methods, Applications and Opportunitiescited by 0
6 more
- 2024Multi-armed Bandits with Missing Outcomecited by 0
- 2025DAL: A Practical Prior-Free Black-Box Framework for Piecewise Stationary Banditscited by 0
- 2026Quantum-Enhanced Neural Contextual Bandit Algorithmscited by 0
- 2026Shuffle and Joint Differential Privacy for Generalized Linear Contextual Banditscited by 0
- 2026Inverse Contextual Bandits without Rewards: Learning from a Non-Stationary Learner via Suffix Imitationcited by 0
- 2026Mixing Makes Markovian Contexts Cheap for Linear Banditscited by 0
- 2026Active Learning for Stochastic Contextual Linear Bandits24 May 2026
- 2026Mixing Makes Markovian Contexts Cheap for Linear Bandits13 Mar 2026
- 2026Inverse Contextual Bandits without Rewards: Learning from a Non-Stationary Learner via Suffix Imitation4 Mar 2026
- 2026Shuffle and Joint Differential Privacy for Generalized Linear Contextual Bandits31 Jan 2026
- 2026Quantum-Enhanced Neural Contextual Bandit Algorithms6 Jan 2026
- 2025Prior-informed optimization of treatment recommendation via bandit algorithms trained on large language model-processed historical records21 Oct 2025
- 2025Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits12 Oct 2025
- 2025Tailored Behavior-Change Messaging for Physical Activity: Integrating Contextual Bandits and Large Language Models8 Jun 2025
- 2025Towards Regulatory-Confirmed Adaptive Clinical Trials: Machine Learning Opportunities and Solutions12 Mar 2025
- 2025Clustering Context in Off-Policy Evaluation28 Feb 2025
- 2025DAL: A Practical Prior-Free Black-Box Framework for Piecewise Stationary Bandits31 Jan 2025
- 2024Multi-armed Bandits with Missing Outcome8 Nov 2024
6 more
- 2023AI in Pharma for Personalized Sequential Decision-Making: Methods, Applications and Opportunities30 Nov 2023
- 2023Nash Regret Guarantees for Linear Bandits3 Oct 2023
- 2023Doubly Adversarial Federated Bandits22 Jan 2023
- 2022Multi-disciplinary fairness considerations in machine learning for clinical trials18 May 2022
- 2022Worst-case Performance of Greedy Policies in Bandits with Imperfect Context Observations10 Apr 2022
- 2021SDF-Bayes: Cautious Optimism in Safe Dose-Finding Clinical Trials with Drug Combinations and Heterogeneous Patient Groups26 Jan 2021
- 2023Nash Regret Guarantees for Linear Banditscited by 9
- 2022Multi-disciplinary fairness considerations in machine learning for clinical trialscited by 8
- 2023Doubly Adversarial Federated Banditscited by 7
- 2021SDF-Bayes: Cautious Optimism in Safe Dose-Finding Clinical Trials with Drug Combinations and Heterogeneous Patient Groupscited by 6
- 2025Towards Regulatory-Confirmed Adaptive Clinical Trials: Machine Learning Opportunities and Solutionscited by 3
- 2022Worst-case Performance of Greedy Policies in Bandits with Imperfect Context Observationscited by 2
- 2025Clustering Context in Off-Policy Evaluationcited by 2
- 2025Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Banditscited by 2
- 2025Tailored Behavior-Change Messaging for Physical Activity: Integrating Contextual Bandits and Large Language Modelscited by 1
- 2025Prior-informed optimization of treatment recommendation via bandit algorithms trained on large language model-processed historical recordscited by 1
- 2026Active Learning for Stochastic Contextual Linear Banditscited by 1
- 2023AI in Pharma for Personalized Sequential Decision-Making: Methods, Applications and Opportunitiescited by 0
12 most cited of 18 All 18 (JSON)
- 2026Active Learning for Stochastic Contextual Linear Bandits24 May 2026
- 2026Mixing Makes Markovian Contexts Cheap for Linear Bandits13 Mar 2026
- 2026Inverse Contextual Bandits without Rewards: Learning from a Non-Stationary Learner via Suffix Imitation4 Mar 2026
- 2026Shuffle and Joint Differential Privacy for Generalized Linear Contextual Bandits31 Jan 2026
- 2026Quantum-Enhanced Neural Contextual Bandit Algorithms6 Jan 2026
- 2025Prior-informed optimization of treatment recommendation via bandit algorithms trained on large language model-processed historical records21 Oct 2025
- 2025Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits12 Oct 2025
- 2025Tailored Behavior-Change Messaging for Physical Activity: Integrating Contextual Bandits and Large Language Models8 Jun 2025
- 2025Towards Regulatory-Confirmed Adaptive Clinical Trials: Machine Learning Opportunities and Solutions12 Mar 2025
- 2025Clustering Context in Off-Policy Evaluation28 Feb 2025
- 2025DAL: A Practical Prior-Free Black-Box Framework for Piecewise Stationary Bandits31 Jan 2025
- 2024Multi-armed Bandits with Missing Outcome8 Nov 2024
12 newest of 18 All 18 (JSON)