mlsanityData to 7 Oct 2026

RoME: A Robust Mixed-Effects Bandit Algorithm for Optimizing Mobile Health Interventions

arXiv 2312.06403 ↗First posted 11 Dec 2023stat.ML cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 18 of its 43 references that are in the map. First posted on arXiv 11 Dec 2023.

Builds on

18 of 43 references.

References · 18

  1. 2017Quasi-Oracle Estimation of Heterogeneous Treatment Effectscited by 328
  2. 2015Scalable Bayesian Optimization Using Deep Neural Networkscited by 284
  3. 2018Deep Bayesian Bandits Showdown: An Empirical Comparison of Bayesian Deep Networks for Thompson Samplingcited by 166
  4. 2020River: machine learning for streaming data in Pythoncited by 96
  5. 2013A Gang of Banditscited by 49
  6. 2020IntelligentPooling: Practical Thompson Sampling for mHealthcited by 24
  7. 2017Action Centered Contextual Banditscited by 23
  8. 2021Doubly robust Thompson sampling for linear payoffscited by 21
  9. 2018Semiparametric Contextual Banditscited by 19
  10. 2019Laplacian-regularized graph bandits: Algorithms and theoretical analysiscited by 17
  11. 2022Mixed-Effect Thompson Samplingcited by 14
  12. 2022Double Doubly Robust Thompson Sampling for Generalized Linear Contextual Banditscited by 14
6 more
  1. 2022Debiased Machine Learning without Sample-Splitting for Stable Estimatorscited by 13
  2. 2019Stochastic Gradient Treescited by 11
  3. 2019Contextual Multi-armed Bandit Algorithm for Semiparametric Reward Modelcited by 10
  4. 2020Personalized Policy Learning using Longitudinal Mobile Health Datacited by 10
  5. 2017Horde of Bandits using Gaussian Markov Random Fieldscited by 6
  6. 2020Using dynamical quantization to perform split attempts in online tree regressorscited by 2

Built on by

Cited by year (2026 to 7 Oct)

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

5 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2022Flexible and Efficient Contextual Bandits with Heterogeneous Treatment Effect Oracles
  2. 2023Adaptive Interventions with User-Defined Goals for Health Behavior Change
  3. 2026BFTS: Thompson Sampling with Bayesian Additive Regression Trees
  4. 2020DTR Bandit: Learning to Make Response-Adaptive Decisions With Low Regret
  5. 2023Robust Fitted-Q-Evaluation and Iteration under Sequentially Exogenous Unobserved Confounders
  6. 2022Robust Tests in Online Decision-Making
  7. 2022Statistically Efficient Advantage Learning for Offline Reinforcement Learning in Infinite Horizons
  8. 2018A clustering-based reinforcement learning approach for tailored personalization of e-Health interventions