ESCADA: Efficient Safety and Context Aware Dose Allocation for Precision Medicine
Ilker Demirel, Ahmet Alparslan Celik, Cem Tekin
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a8dc07ea-c40b-4b84-9f56-5d7942549155Cited by top-tier papers2
- Robust Bayesian SatisficingArtun Saday, Yasar Cahit Yildirim, Cem TekinNeurIPS 2023 · 5 citations
- Conformal Risk-Averse Decision Making with Action Conditional GuaranteeZihan Zhu, Shayan Kiyani, George Pappas, Hamed HassaniICML 2026 · 1 citation
Builds on5
- Optimizing for the Future in Non-Stationary MDPsYash Chandak, Georgios Theocharous, Shiv Shankar, Martha White et al.ICML 2020 · 72 citations
- Universal Off-Policy EvaluationYash Chandak, Scott Niekum, Bruno C. da Silva, Erik G. Learned-Miller et al.NeurIPS 2021 · 64 citations
- Off-Policy Risk Assessment in Contextual BanditsAudrey Huang, Liu Leqi, Zachary C. Lipton, Kamyar AzizzadenesheliNeurIPS 2021 · 44 citations
- Safe Linear Stochastic BanditsKia Khezeli, Eilyan BitarAAAI 2020 · 31 citations
- Learning for Dose Allocation in Adaptive Clinical Trials with Safety ConstraintsCong Shen, Zhiyang Wang, Sofia S. Villar, Mihaela van der SchaarICML 2020 · 22 citations
Related papers
- Quasi-optimal Reinforcement Learning with Continuous ActionsYuhan Li, Wenzhuo Zhou, Ruoqing ZhuICLR 2023 · 2 citations
- Kernel Assisted Learning for Personalized Dose FindingLiangyu Zhu, Wenbin Lu, Michael R. Kosorok, Rui SongKDD 2020 · 4 citations
- Proportional Response: Contextual Bandits for Simple and Cumulative Regret MinimizationSanath Kumar Krishnamurthy, Ruohan Zhan, Susan Athey, Emma BrunskillNeurIPS 2023 · 15 citations
- Multi-armed Bandit Requiring Monotone Arm SequencesNingyuan ChenNeurIPS 2021 · 11 citations
- Strategies for Safe Multi-Armed Bandits with Logarithmic Regret and RiskTianrui Chen, Aditya Gangrade, Venkatesh SaligramaICML 2022 · 18 citations
