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 161–170 of 655 papers

TitleStatusHype
Constrained Contextual Bandit Learning for Adaptive Radar Waveform Selection—0
Constrained Thompson Sampling for Real-Time Electricity Pricing with Grid Reliability Constraints—0
Constrained Thompson Sampling for Wireless Link Optimization—0
A Reinforcement Learning based Reset Policy for CDCL SAT Solvers—0
A relaxed technical assumption for posterior sampling-based reinforcement learning for control of unknown linear systems—0
Context Attentive Bandits: Contextual Bandit with Restricted Context—0
Context Attribution with Multi-Armed Bandit Optimization—0
Adaptive Portfolio by Solving Multi-armed Bandit via Thompson Sampling—0
Contextual Bandits for Advertising Budget Allocation—0
An Information-Theoretic Analysis of Thompson Sampling for Logistic Bandits—0
Show:102550
← PrevPage 17 of 66Next →

No leaderboard results yet.