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 431440 of 655 papers

TitleStatusHype
Online Learning with Cumulative Oversampling: Application to Budgeted Influence Maximization0
Adaptive Operator Selection Based on Dynamic Thompson Sampling for MOEA/D0
Thompson Sampling for Linearly Constrained BanditsCode0
Optimal No-regret Learning in Repeated First-price Auctions0
A Reliability-aware Multi-armed Bandit Approach to Learn and Select Users in Demand Response0
Delay-Adaptive Learning in Generalized Linear Contextual Bandits0
Online Residential Demand Response via Contextual Multi-Armed Bandits0
Odds-Ratio Thompson Sampling to Control for Time-Varying EffectCode0
MOTS: Minimax Optimal Thompson Sampling0
An Online Learning Framework for Energy-Efficient Navigation of Electric Vehicles0
Show:102550
← PrevPage 44 of 66Next →

No leaderboard results yet.