:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Li, Bochao, Fu, Yao, Chen, Wei, Kong, Fang
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2605.10289
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Thompson Sampling in Online RLHF with General Function Approximation
by: Feng, Songtao, et al.
Published: (2025)

Online Learning of Decision Trees with Thompson Sampling
by: Chaouki, Ayman, et al.
Published: (2024)

Energy-Guided Diffusion Sampling for Offline-to-Online Reinforcement Learning
by: Liu, Xu-Hui, et al.
Published: (2024)

Thompson Sampling for Repeated Newsvendor
by: Chen, Li, et al.
Published: (2025)

Fast Online Learning with Gaussian Prior-Driven Hierarchical Unimodal Thompson Sampling
by: Zhao, Tianchi, et al.
Published: (2026)

Distilled Thompson Sampling: Practical and Efficient Thompson Sampling via Imitation Learning
by: Namkoong, Hongseok, et al.
Published: (2020)

Sample-Efficient Policy Constraint Offline Deep Reinforcement Learning based on Sample Filtering
by: Chen, Yuanhao, et al.
Published: (2025)

Constrained Linear Thompson Sampling
by: Gangrade, Aditya, et al.
Published: (2025)

Regenerative Particle Thompson Sampling
by: Zhou, Zeyu, et al.
Published: (2022)

Graph Neural Thompson Sampling
by: Wu, Shuang, et al.
Published: (2024)

Adaptive Data Augmentation for Thompson Sampling
by: Kim, Wonyoung
Published: (2025)

A Broader View of Thompson Sampling
by: Qu, Yanlin, et al.
Published: (2025)

DISA: Offline Importance Sampling for Distribution-Matching LLM-RL
by: Wang, Shaobo, et al.
Published: (2026)

Is Thompson Sampling Susceptible to Algorithmic Collusion?
by: Xiong, Yi, et al.
Published: (2024)

Sample-Efficient Tabular Self-Play for Offline Robust Reinforcement Learning
by: Li, Na, et al.
Published: (2025)

Mean-Shift PCA by Knockoff Mean
by: Li, Mengda, et al.
Published: (2026)

Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox
by: Zhang, Raymond, et al.
Published: (2024)

Thompson Sampling-Based Learning and Control for Unknown Dynamic Systems
by: Zheng, Kaikai, et al.
Published: (2025)

Stochastically Constrained Best Arm Identification with Thompson Sampling
by: Yang, Le, et al.
Published: (2025)

MINTS: Minimalist Thompson Sampling
by: Wang, Kaizheng
Published: (2026)

Settling the Sample Complexity of Model-Based Offline Reinforcement Learning
by: Li, Gen, et al.
Published: (2022)

BFTS: Thompson Sampling with Bayesian Additive Regression Trees
by: Deng, Ruizhe, et al.
Published: (2026)

On Regret Bounds of Thompson Sampling for Bayesian Optimization
by: Takeno, Shion, et al.
Published: (2026)

Fast, Precise Thompson Sampling for Bayesian Optimization
by: Sweet, David
Published: (2024)

Thompson Sampling in Partially Observable Contextual Bandits
by: Park, Hongju, et al.
Published: (2024)

Optimistic Thompson Sampling for No-Regret Learning in Unknown Games
by: Li, Yingru, et al.
Published: (2024)

Sampling from the Mean-Field Stationary Distribution
by: Kook, Yunbum, et al.
Published: (2024)

Provable Domain Adaptation for Offline Reinforcement Learning with Limited Samples
by: Chen, Weiqin, et al.
Published: (2024)

Thompson Sampling Itself is Differentially Private
by: Ou, Tingting, et al.
Published: (2024)

Counterfactual Inference under Thompson Sampling
by: Jeunen, Olivier
Published: (2025)

Feel-Good Thompson Sampling for Contextual Dueling Bandits
by: Li, Xuheng, et al.
Published: (2024)

Mitigating Distribution Shift in Model-based Offline RL via Shifts-aware Reward Learning
by: Luo, Wang, et al.
Published: (2024)

Prior-Aligned Meta-RL: Thompson Sampling with Learned Priors and Guarantees in Finite-Horizon MDPs
by: Zhou, Runlin, et al.
Published: (2025)

Accelerating Approximate Thompson Sampling with Underdamped Langevin Monte Carlo
by: Zheng, Haoyang, et al.
Published: (2024)

Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity
by: Shi, Laixi, et al.
Published: (2022)

Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning
by: Moradipari, Ahmadreza, et al.
Published: (2023)

Sample Complexity Bounds for Robust Mean Estimation with Mean-Shift Contamination
by: Diakonikolas, Ilias, et al.
Published: (2026)

Learning from Random Demonstrations: Offline Reinforcement Learning with Importance-Sampled Diffusion Models
by: Fang, Zeyu, et al.
Published: (2024)

Thompson Sampling for Multi-Objective Linear Contextual Bandit
by: Park, Somangchan, et al.
Published: (2025)

An Information-Theoretic Analysis of Thompson Sampling for Logistic Bandits
by: Gouverneur, Amaury, et al.
Published: (2024)