mlsanityData to 7 Oct 2026

Policy Optimization for Personalized Interventions in Behavioral Health

arXiv 2303.12206 ↗First posted 21 Mar 2023cs.LG cs.AIcited by 9

Not on the map. Why?

Abstract (arXiv)

Behavioral health interventions, delivered through digital platforms, have the potential to significantly improve health outcomes, through education, motivation, reminders, and outreach. We study the problem of optimizing personalized interventions for patients to maximize a long-term outcome, where interventions are costly and capacity-constrained. We assume we have access to a historical dataset collected from an initial pilot study. We present a new approach for this problem that we dub DecompPI, which decomposes the state space for a system of patients to the individual level and then approximates one step of policy iteration. Implementing DecompPI simply consists of a prediction task using the dataset, alleviating the need for online experimentation. DecompPI is a generic model-free algorithm that can be used irrespective of the underlying patient behavior model. We derive theoretical guarantees on a simple, special case of the model that is representative of our problem setting. When the initial policy used to collect the data is randomized, we establish an approximation guarantee for DecompPI with respect to the improvement beyond a null policy that does not allocate interventions. We show that this guarantee is robust to estimation errors. We then conduct a rigorous empirical case study using real-world data from a mobile health platform for improving treatment adherence for tuberculosis. Using a validated simulation model, we demonstrate that DecompPI can provide the same efficacy as the status quo approach with approximately half the capacity of interventions. DecompPI is simple and easy to implement for an organization aiming to improve long-term behavior through targeted interventions, and this paper demonstrates its strong performance both theoretically and empirically, particularly in resource-limited settings.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 12 of its 49 references that are in the map. First posted on arXiv 21 Mar 2023.

Builds on

12 of 49 references.

References · 12

  1. 2018Is Q-learning Provably Efficient?cited by 485
  2. 2021Offline RL Without Off-Policy Evaluationcited by 150
  3. 2020What are the Statistical Limits of Offline RL with Linear Function Approximation?cited by 135
  4. 2019Personalized HeartSteps: A Reinforcement Learning Algorithm for Optimizing Physical Activitycited by 70
  5. 2020Collapsing Bandits and Their Application to Public Health Interventionscited by 47
  6. 2020Whittle index based Q-learning for restless bandits with average rewardcited by 43
  7. 2021Field Study in Deploying Restless Multi-Armed Bandits: Assisting Non-Profits in Improving Maternal and Child Healthcited by 43
  8. 2019Regret Bounds for Thompson Sampling in Episodic Restless Bandit Problemscited by 34
  9. 2021Learn to Intervene: An Adaptive Learning Policy for Restless Bandits in Application to Preventive Healthcarecited by 34
  10. 2020Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Banditscited by 26
  11. 2017Non-Stationary Bandits with Habituation and Recovery Dynamicscited by 23
  12. 2017An Actor-Critic Contextual Bandit Algorithm for Personalized Mobile Health Interventionscited by 17

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 5; 2025: 2; 2026: 2.

9 papers.