RoME: A Robust Mixed-Effects Bandit Algorithm for Optimizing Mobile Health Interventions
Abstract
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.
Cite
@article{arxiv.2312.06403,
title = {RoME: A Robust Mixed-Effects Bandit Algorithm for Optimizing Mobile Health Interventions},
author = {Easton K. Huch and Jieru Shi and Madeline R. Abbott and Jessica R. Golbus and Alexander Moreno and Walter H. Dempsey},
journal= {arXiv preprint arXiv:2312.06403},
year = {2025}
}