mlsanityData to 7 Oct 2026

Optimizing Digital Therapeutic Interventions: Online Learning under Endogenous Adherence

arXiv 2605.24261 ↗First posted 22 May 2026cs.LG cs.SY eess.SYcited by 0

Not on the map. Why?

Abstract (arXiv)

A critical challenge facing clinicians managing chronic disease interventions is sustaining long-run patient health given limited information and resources. Digital therapeutics (DTs) provide a cost-effective way to manage interventions at scale through repeated interactions (e.g. daily treatment recommendations), but patient success is highly dependent on their adherence. Behavioral psychology suggests that both treatment recommendations and past adherence affect future adherence, yet existing decision support frameworks for DTs model only recommendation effects or treat adherence as exogenous context, leaving a key gap in model and algorithm development. To address this gap, we present a DT decision support framework that captures both recommendation and adherence effects, allowing clinicians to better plan treatment recommendations. We model a patient's time-varying capacity for engagement with treatment using a linear dynamical system (LDS) that captures both recommendation and adherence effects, endogenously connected to adherence behavior with a logit link. We establish finite-time identification guarantees for this model, extending LDS results to our setting. Next, we propose an optimism-based algorithm, UCB-BOLD, for online treatment selection and prove that it achieves sublinear regret. We evaluate UCB-BOLD against benchmarks via ablation studies on a synthetic patient cohort generated using micro-randomized trial data. DT decision support tools can include dynamical models to enable decision makers to efficiently use the data in DT settings to improve patient health through effective resource allocation. While myopic or heuristic approaches suffice for some patient types, the benefits of explicitly planning around recommendation and adherence effects are significant for others; UCB-BOLD achieves 2-3x lower conditional value-at-risk regret than the next-best benchmark.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 70 references that are in the map. First posted on arXiv 22 May 2026.

Builds on

22 of 70 references.

References · 22

  1. 2021Convex optimizationcited by 2,479
  2. 2019Provably Efficient Reinforcement Learning with Linear Function Approximationcited by 514
  3. 2017Minimax Regret Bounds for Reinforcement Learningcited by 500
  4. 2018Learning Without Mixing: Towards A Sharp Analysis of Linear System Identificationcited by 158
  5. 2017On the Sample Complexity of the Linear Quadratic Regulatorcited by 151
  6. 2014From Predictive to Prescriptive Analyticscited by 142
  7. 2020Improved Optimistic Algorithms for Logistic Banditscited by 117
  8. 2020Naive Exploration is Optimal for Online LQRcited by 111
  9. 2022Statistical Learning Theory for Control: A Finite Sample Perspectivecited by 52
  10. 2020Nearly Minimax Optimal Reinforcement Learning for Discounted MDPscited by 42
  11. 2020IntelligentPooling: Practical Thompson Sampling for mHealthcited by 24
  12. 2017Non-Stationary Bandits with Habituation and Recovery Dynamicscited by 23
10 more
  1. 2024A Deployed Online Reinforcement Learning Algorithm In An Oral Health Clinical Trialcited by 11
  2. 2023Policy Optimization for Personalized Interventions in Behavioral Healthcited by 9
  3. 2023Model Based Reinforcement Learning for Personalized Heparin Dosingcited by 5
  4. 2023Non-asymptotic System Identification for Linear Systems with Nonlinear Policiescited by 5
  5. 2023RoME: A Robust Mixed-Effects Bandit Algorithm for Optimizing Mobile Health Interventionscited by 5
  6. 2021Optimizing αμcited by 4
  7. 2024Non-stationary Bandits with Habituation and Recovery Dynamics and Knapsack Constraintscited by 3
  8. 2025An Adaptive Control Approach to Treatment Selection for Substance Use Disorderscited by 2
  9. 2025A survey of Chernoff and Hoeffding boundscited by 1
  10. 2025Power Constrained Nonstationary Bandits with Habituation and Recovery Dynamicscited by 1

Built on by

Not cited yet.