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 201–210 of 655 papers

TitleStatusHype
Diffusion Models Meet Contextual Bandits with Large Action Spaces—0
DISCO: An End-to-End Bandit Framework for Personalised Discount Allocation—0
The Choice of Noninformative Priors for Thompson Sampling in Multiparameter Bandit Models—0
Distilled Thompson Sampling: Practical and Efficient Thompson Sampling via Imitation Learning—0
A General Recipe for the Analysis of Randomized Multi-Armed Bandit Algorithms—0
Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits—0
Diversified Sampling for Batched Bayesian Optimization with Determinantal Point Processes—0
Double Doubly Robust Thompson Sampling for Generalized Linear Contextual Bandits—0
Double-Linear Thompson Sampling for Context-Attentive Bandits—0
Counterfactual Inference under Thompson Sampling—0
Show:102550
← PrevPage 21 of 66Next →

No leaderboard results yet.