A Definition of Non-Stationary Bandits
Not on the map. Why?
Abstract (arXiv)
Despite the subject of non-stationary bandit learning having attracted much recent attention, we have yet to identify a formal definition of non-stationarity that can consistently distinguish non-stationary bandits from stationary ones. Prior work has characterized non-stationary bandits as bandits for which the reward distribution changes over time. We demonstrate that this definition can ambiguously classify the same bandit as both stationary and non-stationary; this ambiguity arises in the existing definition's dependence on the latent sequence of reward distributions. Moreover, the definition has given rise to two widely used notions of regret: the dynamic regret and the weak regret. These notions are not indicative of qualitative agent performance in some bandits. Additionally, this definition of non-stationary bandits has led to the design of agents that explore excessively. We introduce a formal definition of non-stationary bandits that resolves these issues. Our new definition provides a unified approach, applicable seamlessly to both Bayesian and frequentist formulations of bandits. Furthermore, our definition ensures consistent classification of two bandits offering agents indistinguishable experiences, categorizing them as either both stationary or both non-stationary. This advancement provides a more robust framework for non-stationary bandit learning.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 32 of its 62 references that are in the map. First posted on arXiv 23 Feb 2023.
Builds on
32 of 62 references.
References · 32
- 2019Introduction to Multi-Armed Banditscited by 475
- 2013Learning to Optimize Via Posterior Samplingcited by 253
- 2014An Information-Theoretic Analysis of Thompson Samplingcited by 178
- 2014Learning to Optimize via Information-Directed Samplingcited by 168
- 2021Non-stationary Reinforcement Learning without Prior Knowledge: An Optimal Black-box Approachcited by 98
- 2018Learning to Optimize under Non-Stationaritycited by 85
- 2019Weighted Linear Bandits for Non-Stationary Environmentscited by 84
- 2019A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-freecited by 71
- 2017Efficient Contextual Bandits in Non-stationary Worldscited by 62
- 2021Reinforcement Learning, Bit by Bitcited by 59
- 2021A Simple Approach for Non-stationary Linear Banditscited by 54
- 2016Time-Varying Gaussian Process Bandit Optimizationcited by 50
20 more
- 2018Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Banditcited by 49
- 2017A Change-Detection based Framework for Piecewise-stationary Multi-Armed Bandit Problemcited by 48
- 2014Optimal Exploration-Exploitation in a Multi-Armed-Bandit Problem with Non-stationary Rewardscited by 41
- 2019An Information-Theoretic Approach to Minimax Regret in Partial Monitoringcited by 41
- 2018An Information-Theoretic Analysis for Thompson Sampling with Many Actionscited by 35
- 2019Regret Bounds for Thompson Sampling in Episodic Restless Bandit Problemscited by 34
- 2017Taming Non-stationary Bandits: A Bayesian Approachcited by 30
- 2022A New Look at Dynamic Regret for Non-Stationary Stochastic Banditscited by 28
- 2018Learning Contextual Bandits in a Non-stationary Environmentcited by 26
- 2022Non-Stationary Bandit Learning via Predictive Samplingcited by 21
- 2022Lifting the Information Ratio: An Information-Theoretic Analysis of Thompson Sampling for Contextual Banditscited by 19
- 2022Contextual Information-Directed Samplingcited by 16
- 2018On Abruptly-Changing and Slowly-Varying Multiarmed Bandit Problemscited by 15
- 2019Efficient Change-Point Detection for Tackling Piecewise-Stationary Banditscited by 15
- 2023Smooth Non-Stationary Banditscited by 13
- 2023An Information-Theoretic Analysis of Nonstationary Bandit Learningcited by 11
- 2020A Change-Detection Based Thompson Sampling Framework for Non-Stationary Banditscited by 10
- 2020Regime Switching Banditscited by 9
- 2021Kolmogorov-Smirnov Test-Based Actively-Adaptive Thompson Sampling for Non-Stationary Banditscited by 4
- 2020A Linear Bandit for Seasonal Environmentscited by 3
Built on by
Citing papers per year: 2023: 2; 2024: 3; 2025: 2; 2026: 2.
9 papers.
- 2023A Definition of Continual Reinforcement Learningcited by 98
- 2023Continual Learning as Computationally Constrained Reinforcement Learningcited by 35
- 2025X-Transfer Attacks: Towards Super Transferable Adversarial Attacks on CLIPcited by 21
- 2024Plastic Learning with Deep Fourier Featurescited by 14
- 2024Almost Minimax Optimal Best Arm Identification in Piecewise Stationary Linear Banditscited by 6
- 2024Variance-Dependent Regret Bounds for Non-stationary Linear Banditscited by 2
- 2025Natural Policy Gradient for Average Reward Non-Stationary RLcited by 0
- 2026On the Peril of (Even a Little) Nonstationarity in Satisficing Regret Minimizationcited by 0
- 2026Space-sampled Value Decay: Forgetting Mechanisms for Non-stationary Reinforcement Learningcited by 0
- 2026Space-sampled Value Decay: Forgetting Mechanisms for Non-stationary Reinforcement Learning10 Jun 2026
- 2026On the Peril of (Even a Little) Nonstationarity in Satisficing Regret Minimization19 Mar 2026
- 2025X-Transfer Attacks: Towards Super Transferable Adversarial Attacks on CLIP8 May 2025
- 2025Natural Policy Gradient for Average Reward Non-Stationary RL23 Apr 2025
- 2024Plastic Learning with Deep Fourier Features27 Oct 2024
- 2024Almost Minimax Optimal Best Arm Identification in Piecewise Stationary Linear Bandits10 Oct 2024
- 2024Variance-Dependent Regret Bounds for Non-stationary Linear Bandits15 Mar 2024
- 2023A Definition of Continual Reinforcement Learning20 Jul 2023
- 2023Continual Learning as Computationally Constrained Reinforcement Learning10 Jul 2023