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 231–240 of 655 papers

TitleStatusHype
Asymptotically Optimal Bandits under Weighted Information—0
Efficient Learning in Large-Scale Combinatorial Semi-Bandits—0
A General Theory of the Stochastic Linear Bandit and Its Applications—0
Efficient Model-Based Reinforcement Learning Through Optimistic Thompson Sampling—0
Efficient Multivariate Bandit Algorithm with Path Planning—0
Efficient Online Learning for Cognitive Radar-Cellular Coexistence via Contextual Thompson Sampling—0
Cost-efficient Knowledge-based Question Answering with Large Language Models—0
Efficient Thompson Sampling for Online Matrix-Factorization Recommendation—0
Cost Aware Asynchronous Multi-Agent Active Search—0
Asymptotically Optimal Algorithms for Budgeted Multiple Play Bandits—0
Show:102550
← PrevPage 24 of 66Next →

No leaderboard results yet.