SOTAVerified

Thompson Sampling

Thompson sampling, named after William R. Thompson, is a heuristic for choosing actions that addresses the exploration-exploitation dilemma in the multi-armed bandit problem. It consists of choosing the action that maximizes the expected reward with respect to a randomly drawn belief.

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 321–330 of 655 papers

TitleStatusHype
Non-Stationary Latent Bandits—0
No Regrets for Learning the Prior in Bandits—0
Observation-Free Attacks on Stochastic Bandits—0
On Adaptive Estimation for Dynamic Bernoulli Bandits—0
On Batch Bayesian Optimization—0
On Dynamic Pricing with Covariates—0
On Efficiency in Hierarchical Reinforcement Learning—0
On Improved Regret Bounds In Bayesian Optimization with Gaussian Noise—0
On Kernelized Multi-Armed Bandits with Constraints—0
On learning Whittle index policy for restless bandits with scalable regret—0
Show:102550
← PrevPage 33 of 66Next →

No leaderboard results yet.