RoME: A Robust Mixed-Effects Bandit Algorithm for Optimizing Mobile Health Interventions
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915103401574400 |
|---|---|
| author | Huch, Easton K. Shi, Jieru Abbott, Madeline R. Golbus, Jessica R. Moreno, Alexander Dempsey, Walter H. |
| author_facet | Huch, Easton K. Shi, Jieru Abbott, Madeline R. Golbus, Jessica R. Moreno, Alexander Dempsey, Walter H. |
| contents | Mobile health leverages personalized and contextually tailored interventions optimized through bandit and reinforcement learning algorithms. In practice, however, challenges such as participant heterogeneity, nonstationarity, and nonlinear relationships hinder algorithm performance. We propose RoME, a Robust Mixed-Effects contextual bandit algorithm that simultaneously addresses these challenges via (1) modeling the differential reward with user- and time-specific random effects, (2) network cohesion penalties, and (3) debiased machine learning for flexible estimation of baseline rewards. We establish a high-probability regret bound that depends solely on the dimension of the differential-reward model, enabling us to achieve robust regret bounds even when the baseline reward is highly complex. We demonstrate the superior performance of the RoME algorithm in a simulation and two off-policy evaluation studies. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_06403 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | RoME: A Robust Mixed-Effects Bandit Algorithm for Optimizing Mobile Health Interventions Huch, Easton K. Shi, Jieru Abbott, Madeline R. Golbus, Jessica R. Moreno, Alexander Dempsey, Walter H. Machine Learning Mobile health leverages personalized and contextually tailored interventions optimized through bandit and reinforcement learning algorithms. In practice, however, challenges such as participant heterogeneity, nonstationarity, and nonlinear relationships hinder algorithm performance. We propose RoME, a Robust Mixed-Effects contextual bandit algorithm that simultaneously addresses these challenges via (1) modeling the differential reward with user- and time-specific random effects, (2) network cohesion penalties, and (3) debiased machine learning for flexible estimation of baseline rewards. We establish a high-probability regret bound that depends solely on the dimension of the differential-reward model, enabling us to achieve robust regret bounds even when the baseline reward is highly complex. We demonstrate the superior performance of the RoME algorithm in a simulation and two off-policy evaluation studies. |
| title | RoME: A Robust Mixed-Effects Bandit Algorithm for Optimizing Mobile Health Interventions |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2312.06403 |