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 441–450 of 655 papers

TitleStatusHype
An Online Learning Framework for Energy-Efficient Navigation of Electric Vehicles—0
MOTS: Minimax Optimal Thompson Sampling—0
Efficient exploration of zero-sum stochastic games—0
On Thompson Sampling with Langevin Algorithms—0
Residual Bootstrap Exploration for Bandit Algorithms—0
A General Theory of the Stochastic Linear Bandit and Its Applications—0
The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity—0
Thompson Sampling Algorithms for Mean-Variance BanditsCode0
Bayesian Quantile and Expectile Optimisation—0
On Thompson Sampling for Smoother-than-Lipschitz Bandits—0
Show:102550
← PrevPage 45 of 66Next →

No leaderboard results yet.