RoME: A Robust Mixed-Effects Bandit Algorithm for Optimizing Mobile Health Interventions
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Minimum Empirical Divergence for Sub-Gaussian Linear Bandits
Scalable Exploration via Ensemble++
Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leibler Maillard Sampling
Adaptive Data Augmentation for Thompson Sampling
Scalable and Interpretable Contextual Bandits: A Literature Review and Retail Offer Prototype
In-Domain African Languages Translation Using LLMs and Multi-armed Bandits
토론
이 논문과 연결된 포럼 글이 아직 없습니다.