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 251–260 of 655 papers

TitleStatusHype
From Predictions to Decisions: The Importance of Joint Predictive Distributions—0
Evaluation of Explore-Exploit Policies in Multi-result Ranking Systems—0
Bayesian Learning of Optimal Policies in Markov Decision Processes with Countably Infinite State-Space—0
Expected Improvement-based Contextual Bandits—0
A Copula approach for hyperparameter transfer learning—0
Bayesian Optimization with LLM-Based Acquisition Functions for Natural Language Preference Elicitation—0
Bayesian Optimization with Inexact Acquisition: Is Random Grid Search Sufficient?—0
An Information-Theoretic Analysis of Thompson Sampling—0
An Information-Theoretic Analysis for Thompson Sampling with Many Actions—0
Adaptively Learning to Select-Rank in Online Platforms—0
Show:102550
← PrevPage 26 of 66Next →

No leaderboard results yet.