从随机逼近视角重新思考 Langevin Thompson Sampling

View PDF HTML (experimental)

Abstract:Langevin-based Thompson Sampling (TS) methods for multi-armed bandits use likelihood gradients to approximate posterior samples when exact sampling is intractable. As new rewards arrive, the posterior changes, and these methods run an inner Markov chain to approximate the updated target. To simplify this repeated sampling procedure, we introduce TS-SA, which incorporates stochastic approximation (SA) within the TS framework. In each round, TS-SA takes one Langevin step using the newly observed reward and applies an SA update to combine the noisy proposal with the current parameter estimate. By retaining this estimate across rounds, TS-SA maintains one continuing Markov chain for each arm, preserving the influence of past observations without storing or sampling them again. Within this recursion, the proposal step size remains fixed across rounds, while the SA weights decrease as observations accumulate to control the effect of noise on the estimate. This continuing-chain formulation simplifies the theoretical analysis, allowing us to establish a near-optimal worst-case regret bound of $\widetilde{\mathcal O}(\sqrt{KT})$ under log-concavity and smoothness assumptions with one update per new reward. Our experiments further demonstrate that TS-SA, using a single-step Langevin update after an initial warm-up, achieves strong performance against standard baselines.

Comments:	35 pages, 5 figures, 1 table
Subjects:	Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Machine Learning (stat.ML)
Cite as:	arXiv:2510.05023 [cs.LG]
	(or arXiv:2510.05023v2 [cs.LG] for this version)
	https://doi.org/10.48550/arXiv.2510.05023 arXiv-issued DOI via DataCite

Submission history

From: Pan Xu [view email]
[v1] Mon, 6 Oct 2025 17:01:29 UTC (2,256 KB)
[v2] Fri, 9 Oct 2026 20:02:18 UTC (2,363 KB)