mlsanityData to 7 Oct 2026

Flow-Corrected Thompson Sampling for Non-Stationary Contextual Bandits

arXiv 2606.23933 ↗First posted 22 Jun 2026eess.SY cs.LG cs.SYcited by 0

On the map: LLM alignment / RLHF / preference optimisation → Reward modeling and RLHF

Abstract (arXiv)

We study non-stationary linear contextual bandits where the reward model drifts over time, rendering classical contextual bandit algorithms brittle because historical data becomes systematically biased. We propose Flow-Corrected Thompson Sampling (fcTS), a Bayesian method that reuses experience by transporting past rewards to the present using an explicit drift model and incorporating each transported observation with a confidence weight that reflects transport reliability. This yields a unified template that specializes in (i) linear parameter drift via online slope estimation and reward correction, (ii) periodic variation via phase-aware reuse across cycles, and (iii) recurring regime switches via changepoint detection and regime-specific posterior memory. The resulting posterior updates remain closed-form under a linear Gaussian model and can be implemented efficiently with truncated, incrementally updated sufficient statistics. Across five controlled case studies and a semi-synthetic portfolio-selection benchmark with multiple overlapping non-stationarities, fcTS outperforms standard forgetting-based baselines (discounting, sliding windows, and periodic restarts), with the largest gains in settings exhibiting recurring temporal structure. These results demonstrate that when non-stationarity is structured, correcting and reweighting historical observations can be substantially more sample-efficient than uniformly discarding them.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Reward modeling and RLHF, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 10 of its 21 references that are in the map. First posted on arXiv 22 Jun 2026.

Builds on

10 of 21 references.

References · 10

  1. 2018Computational Optimal Transportcited by 765
  2. 2021Reinforcement learning based recommender systems: A surveycited by 187
  3. 2014Learning to Optimize via Information-Directed Samplingcited by 168
  4. 2018Learning to Optimize under Non-Stationaritycited by 85
  5. 2019Weighted Linear Bandits for Non-Stationary Environmentscited by 84
  6. 2018Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Banditcited by 49
  7. 2017A Change-Detection based Framework for Piecewise-stationary Multi-Armed Bandit Problemcited by 48
  8. 2017Taming Non-stationary Bandits: A Bayesian Approachcited by 30
  9. 2022A Survey on Reinforcement Learning in Aviation Applicationscited by 19
  10. 2023LLMs-augmented Contextual Banditcited by 8

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown
  2. 2024Thompson Sampling for Stochastic Bandits with Noisy Contexts: An Information-Theoretic Regret Analysis
  3. 2021Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning
  4. 2023The Choice of Noninformative Priors for Thompson Sampling in Multiparameter Bandit Models
  5. 2021Adapting to Misspecification in Contextual Bandits with Offline Regression Oracles
  6. 2024Online Posterior Sampling with a Diffusion Prior
  7. 2024Diffusion Models Meet Contextual Bandits
  8. 2020Tractable contextual bandits beyond realizability