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 101–110 of 655 papers

TitleStatusHype
A Multi-Armed Bandit to Smartly Select a Training Set from Big Medical Data—0
Adaptive Combinatorial Allocation—0
Automatic Ensemble Learning for Online Influence Maximization—0
AutoSeM: Automatic Task Selection and Mixing in Multi-Task Learning—0
Bag of Policies for Distributional Deep Exploration—0
BanditCAT and AutoIRT: Machine Learning Approaches to Computerized Adaptive Testing and Item Calibration—0
Bandit Change-Point Detection for Real-Time Monitoring High-Dimensional Data Under Sampling Control—0
Bandit Convex Optimization: sqrtT Regret in One Dimension—0
Bandit Learning for Diversified Interactive Recommendation—0
A Note on Information-Directed Sampling and Thompson Sampling—0
Show:102550
← PrevPage 11 of 66Next →

No leaderboard results yet.