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

Showing 261270 of 655 papers

TitleStatusHype
Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits0
Bandit Theory and Thompson Sampling-Guided Directed Evolution for Sequence Optimization0
Incentivizing Combinatorial Bandit Exploration0
Mixed-Effect Thompson SamplingCode0
Surrogate modeling for Bayesian optimization beyond a single Gaussian process0
Lifting the Information Ratio: An Information-Theoretic Analysis of Thompson Sampling for Contextual Bandits0
Information-Directed Selection for Top-Two AlgorithmsCode0
Fast Change Identification in Multi-Play Bandits and its Applications in Wireless Networks0
Semi-Parametric Contextual Bandits with Graph-Laplacian Regularization0
Adjusted Expected Improvement for Cumulative Regret Minimization in Noisy Bayesian Optimization0
Show:102550
← PrevPage 27 of 66Next →

No leaderboard results yet.