Papers › Non-Stationary Latent Auto-Regressive Bandits
Non-Stationary Latent Auto-Regressive Bandits
Anna L. Trella, Walter Dempsey, Finale Doshi-Velez, Susan A. Murphy
We consider the stochastic multi-armed bandit problem with non-stationary rewards. We present a novel formulation of non-stationarity in the environment where changes in the mean reward of the arms over time are due to some unknown, latent, auto-regressive (AR) state of order k. We call this new environment the latent AR bandit. Different forms of the latent AR bandit appear in many real-world settings, especially in emerging scientific fields such as behavioral health or education where there are few mechanistic models of the environment. If the AR order k is known, we propose an algorithm that achieves Õ(k√(T)) regret in this setting. Empirically, our algorithm outperforms standard UCB across multiple non-stationary environments, even if k is mis-specified.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections