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 411–420 of 655 papers

TitleStatusHype
Scalable Generalized Linear Bandits: Online Computation and Hashing—0
Scalable Neural Contextual Bandit for Recommender Systems—0
Scalable regret for learning to control network-coupled subsystems with unknown dynamics—0
Scalable Thompson Sampling using Sparse Gaussian Process Models—0
Scalable Thompson Sampling via Optimal Transport—0
Scaling Multi-Armed Bandit Algorithms—0
Screening for an Infectious Disease as a Problem in Stochastic Control—0
Semi-Parametric Contextual Bandits with Graph-Laplacian Regularization—0
Sequential Best-Arm Identification with Application to Brain-Computer Interface—0
Sequential Matrix Completion—0
Show:102550
← PrevPage 42 of 66Next →

No leaderboard results yet.