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 521–530 of 655 papers

TitleStatusHype
Regularized-OFU: an efficient algorithm for general contextual bandit with optimization oracles—0
Reinforcement Learning for Efficient and Tuning-Free Link Adaptation—0
Reinforcement learning techniques for Outer Loop Link Adaptation in 4G/5G systems—0
Reinforcement Learning with Subspaces using Free Energy Paradigm—0
Reinforcement Learning with Trajectory Feedback—0
Remote Contextual Bandits—0
Residual Bootstrap Exploration for Bandit Algorithms—0
Revised Progressive-Hedging-Algorithm Based Two-layer Solution Scheme for Bayesian Reinforcement Learning—0
Reward Biased Maximum Likelihood Estimation for Reinforcement Learning—0
Risk and optimal policies in bandit experiments—0
Show:102550
← PrevPage 53 of 66Next →

No leaderboard results yet.