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 381–390 of 655 papers

TitleStatusHype
Random Effect Bandits—0
Random Hypervolume Scalarizations for Provable Multi-Objective Black Box Optimization—0
Randomised Bayesian Least-Squares Policy Iteration—0
Randomized Exploration in Cooperative Multi-Agent Reinforcement Learning—0
Regenerative Particle Thompson Sampling—0
Regret Analysis of Bandit Problems with Causal Background Knowledge—0
Regret Analysis of the Finite-Horizon Gittins Index Strategy for Multi-Armed Bandits—0
Regret Bounds for Information-Directed Reinforcement Learning—0
Regularized-OFU: an efficient algorithm for general contextual bandit with optimization oracles—0
Reinforcement Learning for Efficient and Tuning-Free Link Adaptation—0
Show:102550
← PrevPage 39 of 66Next →

No leaderboard results yet.