ESCADA: Efficient Safety and Context Aware Dose Allocation for Precision Medicine
Not on the map. Why?
Abstract (arXiv)
Finding an optimal individualized treatment regimen is considered one of the most challenging precision medicine problems. Various patient characteristics influence the response to the treatment, and hence, there is no one-size-fits-all regimen. Moreover, the administration of an unsafe dose during the treatment can have adverse effects on health. Therefore, a treatment model must ensure patient safety while efficiently optimizing the course of therapy. We study a prevalent medical problem where the treatment aims to keep a physiological variable in a safe range and preferably close to a target level, which we refer to as leveling. Such a task may be relevant in numerous other domains as well. We propose ESCADA, a novel and generic multi-armed bandit (MAB) algorithm tailored for the leveling task, to make safe, personalized, and context-aware dose recommendations. We derive high probability upper bounds on its cumulative regret and safety guarantees. Following ESCADA's design, we also describe its Thompson sampling-based counterpart. We discuss why the straightforward adaptations of the classical MAB algorithms such as GP-UCB may not be a good fit for the leveling task. Finally, we make in silico experiments on the bolus-insulin dose allocation problem in type-1 diabetes mellitus disease and compare our algorithms against the famous GP-UCB algorithm, the rule-based dose calculators, and a clinician.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 25 of its 71 references that are in the map. First posted on arXiv 26 Nov 2021.
Builds on
25 of 71 references.
References · 25
- 2020On Information Gain and Regret Bounds in Gaussian Process Banditscited by 158
- 2020Ethical Machine Learning in Health Carecited by 113
- 2014Bayesian Optimization with Unknown Constraintscited by 109
- 2018Stagewise Safe Bayesian Optimization with Gaussian Processescited by 79
- 2016Conservative Banditscited by 59
- 2016Conservative Contextual Linear Banditscited by 57
- 2019Safe Exploration for Interactive Machine Learningcited by 51
- 2015A General Framework for Constrained Bayesian Optimization using Information-based Searchcited by 50
- 2021Universal Off-Policy Evaluationcited by 43
- 2019Safe Linear Thompson Sampling with Side Informationcited by 37
- 2020Optimizing for the Future in Non-Stationary MDPscited by 37
- 2019On Multi-Armed Bandit Designs for Dose-Finding Clinical Trialscited by 32
13 more
- 2021Off-Policy Risk Assessment in Contextual Banditscited by 29
- 2019Safe Linear Stochastic Banditscited by 27
- 2014Exploration vs Exploitation vs Safety: Risk-averse Multi-Armed Banditscited by 26
- 2020Deep Reinforcement Learning for Closed-Loop Blood Glucose Controlcited by 26
- 2016Risk-Averse Multi-Armed Bandit Problems under Mean-Variance Measurecited by 20
- 2020Basal Glucose Control in Type 1 Diabetes using Deep Reinforcement Learning: An In Silico Validationcited by 18
- 2016Interpretable Dynamic Treatment Regimescited by 17
- 2018Risk-Averse Stochastic Convex Banditcited by 13
- 2020Learning for Dose Allocation in Adaptive Clinical Trials with Safety Constraintscited by 13
- 2017Adaptive Rate of Convergence of Thompson Sampling for Gaussian Process Optimizationcited by 9
- 2020Contextual Constrained Learning for Dose-Finding Clinical Trialscited by 9
- 2019Target Tracking for Contextual Bandits: Application to Demand Side Managementcited by 6
- 2021SDF-Bayes: Cautious Optimism in Safe Dose-Finding Clinical Trials with Drug Combinations and Heterogeneous Patient Groupscited by 6
Built on by
Citing papers per year: 2022: 2; 2023: 2; 2024: 0; 2025: 0; 2026: 1.
5 papers.
- 2022Transfer Learning for Contextual Multi-armed Banditscited by 24
- 2023Pure Exploration in Bandits with Linear Constraintscited by 10
- 2023Robust Bayesian Satisficingcited by 3
- 2026Conformal Risk-Averse Decision Making with Action Conditional Guaranteecited by 2
- 2022Some performance considerations when using multi-armed bandit algorithms in the presence of missing datacited by 1
- 2026Conformal Risk-Averse Decision Making with Action Conditional Guarantee4 Jun 2026
- 2023Robust Bayesian Satisficing16 Aug 2023
- 2023Pure Exploration in Bandits with Linear Constraints22 Jun 2023
- 2022Transfer Learning for Contextual Multi-armed Bandits22 Nov 2022
- 2022Some performance considerations when using multi-armed bandit algorithms in the presence of missing data8 May 2022