pith. sign in

arxiv: 2302.12202 · v2 · pith:M7SX6D75new · submitted 2023-02-23 · 💻 cs.LG · stat.ML

A Definition of Non-Stationary Bandits

classification 💻 cs.LG stat.ML
keywords banditsdefinitionnon-stationarybanditregretstationaryagentsformal
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. No-regret optimization of time-varying bilevel problems

    math.OC 2026-05 unverdicted novelty 6.0

    W-SparQ-BL models time-varying lower-level responses with multi-output GPs and sparse approximations to achieve sublinear dynamic regret in bilevel optimization under noise.

  2. Space-sampled Value Decay: Forgetting Mechanisms for Non-stationary Deep Reinforcement Learning

    cs.LG 2026-06 unverdicted novelty 5.0

    Space-sampled Value Decay is proposed as a simple forgetting mechanism for DQN and SAC modifications that shows positive but limited effects on returns in non-stationary RL environments.