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

TitleStatusHype
Accelerating Grasp Exploration by Leveraging Learned Priors0
Thompson sampling for linear quadratic mean-field teams0
Multi-Agent Active Search using Realistic Depth-Aware Noise ModelCode0
Asymptotic Convergence of Thompson Sampling0
Adaptive Combinatorial Allocation0
Multi-armed Bandits with Cost Subsidy0
Greedy k-Center from Noisy Distance Samples0
Screening for an Infectious Disease as a Problem in Stochastic Control0
Bandit Policies for Reliable Cellular Network Handovers in Extreme Mobility0
Sub-sampling for Efficient Non-Parametric Bandit ExplorationCode0
Improved Worst-Case Regret Bounds for Randomized Least-Squares Value Iteration0
Bayesian Algorithms for Decentralized Stochastic BanditsCode0
Federated Bayesian Optimization via Thompson SamplingCode1
Reinforcement Learning for Efficient and Tuning-Free Link Adaptation0
Double-Linear Thompson Sampling for Context-Attentive Bandits0
Asynchronous ε-Greedy Bayesian OptimisationCode0
Online Learning and Distributed Control for Residential Demand Response0
Effects of Model Misspecification on Bayesian Bandits: Case Studies in UX Optimization0
Neural Thompson SamplingCode1
Stage-wise Conservative Linear Bandits0
Neural Model-based Optimization with Right-Censored Observations0
Position-Based Multiple-Play Bandits with Thompson Sampling0
Bandit Change-Point Detection for Real-Time Monitoring High-Dimensional Data Under Sampling Control0
Partially Observable Online Change Detection via Smooth-Sparse Decomposition0
Bandits Under The Influence (Extended Version)0
Show:102550
← PrevPage 16 of 27Next →

No leaderboard results yet.