Sample-Mean Anchored Thompson Sampling for Offline-to-Online Learning with Distribution Shift
Not on the map. Why?
Abstract (arXiv)
Offline-to-online learning aims to improve online decision-making by leveraging offline logged data. A central challenge in this setting is the distribution shift between offline and online environments. While some existing works attempt to leverage shifted offline data, they largely rely on UCB-type algorithms. Thompson sampling (TS) represents another canonical class of bandit algorithms, well known for its strong empirical performance and naturally suited to offline-to-online learning through its Bayesian formulation. However, unlike UCB indices, posterior samples in TS are not guaranteed to be optimistic with respect to the true arm means. This makes indices constructed from purely online and hybrid data difficult to compare and complicates their use. To address this issue, we propose sample-mean anchored TS (Anchor-TS), which introduces a novel median-based anchoring rule that defines the arm index as the median of an online posterior sample, a hybrid posterior sample, and the online sample mean. The median anchoring systematically corrects bias induced by distribution shift by mitigating over-estimation for suboptimal arms and under-estimation for optimal arms, while exploiting offline information to obtain more accurate estimates when the shift is small. We establish theoretical guarantees showing that the proposed algorithm safely leverages offline data to accelerate online learning, and quantifying how the degree of distribution shift and the size of offline data affect the resulting regret reduction. Extensive experiments demonstrate consistent improvements of our algorithm over baselines.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 44 references that are in the map. First posted on arXiv 11 May 2026.
Builds on
24 of 44 references.
References · 24
- 2020AWAC: Accelerating Online Reinforcement Learning with Offline Datasetscited by 671
- 2017A Tutorial on Thompson Samplingcited by 433
- 2023Efficient Online Reinforcement Learning with Offline Datacited by 363
- 2023Cal-QL: Calibrated Offline RL Pre-Training for Efficient Online Fine-Tuningcited by 237
- 2021Offline-to-Online Reinforcement Learning via Balanced Replay and Pessimistic Q-Ensemblecited by 214
- 2022Hybrid RL: Using Both Offline and Online Data Can Make RL Efficientcited by 161
- 2021Policy Finetuning: Bridging Sample-Efficient Offline and Online Reinforcement Learningcited by 158
- 2020Neural Thompson Samplingcited by 128
- 2018Thompson Sampling for Combinatorial Semi-Banditscited by 78
- 2021Bayesian decision-making under misspecified priors with applications to meta-learningcited by 44
- 2022Leveraging Offline Data in Online Reinforcement Learningcited by 42
- 2015Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Playscited by 38
12 more
- 2020MOTS: Minimax Optimal Thompson Samplingcited by 28
- 2019Warm-starting Contextual Bandits: Robustly Combining Supervised and Bandit Feedbackcited by 21
- 2015On the Prior Sensitivity of Thompson Samplingcited by 15
- 2022Artificial Replay: A Meta-Algorithm for Harnessing Historical Data in Banditscited by 13
- 2024Hybrid Transfer Reinforcement Learning: Provable Sample Efficiency from Shifted-Dynamics Datacited by 8
- 2024Online Bandit Learning with Offline Preference Data for Improved RLHFcited by 6
- 2025Balancing optimism and pessimism in offline-to-online learningcited by 6
- 2024A Natural Extension To Online Algorithms For Hybrid RL With Limited Coveragecited by 5
- 2025Best Arm Identification with Possibly Biased Offline Datacited by 5
- 2025Contextual Online Pricing with (Biased) Offline Datacited by 4
- 2025Augmenting Online RL with Offline Data is All You Need: A Unified Hybrid RL Algorithm Design and Analysiscited by 3
- 2025Hybrid Combinatorial Multi-armed Bandits with Probabilistically Triggered Armscited by 2
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2023Thompson Sampling with Diffusion Generative Prior
- 2025Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown
- 2025Offline-to-online hyperparameter transfer for stochastic bandits
- 2026Direction-Aware Offline-to-Online Learning in Linear Contextual Bandits
- 2023The Choice of Noninformative Priors for Thompson Sampling in Multiparameter Bandit Models
- 2026Offline-to-Online Learning in Linear Bandits
- 2020Distilled Thompson Sampling: Practical and Efficient Thompson Sampling via Imitation Learning
- 2023Optimality of Thompson Sampling with Noninformative Priors for Pareto Bandits