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 451–500 of 655 papers

TitleStatusHype
New Insights into Bootstrapping for Bandits—0
No Algorithmic Collusion in Two-Player Blindfolded Game with Thompson Sampling—0
Nonparametric General Reinforcement Learning—0
Non-Stationary Bandit Learning via Predictive Sampling—0
Non-Stationary Dynamic Pricing Via Actor-Critic Information-Directed Pricing—0
Non-Stationary Latent Bandits—0
No Regrets for Learning the Prior in Bandits—0
Observation-Free Attacks on Stochastic Bandits—0
On Adaptive Estimation for Dynamic Bernoulli Bandits—0
On Batch Bayesian Optimization—0
On Dynamic Pricing with Covariates—0
On Efficiency in Hierarchical Reinforcement Learning—0
On Improved Regret Bounds In Bayesian Optimization with Gaussian Noise—0
On Kernelized Multi-Armed Bandits with Constraints—0
On learning Whittle index policy for restless bandits with scalable regret—0
Online Algorithms For Parameter Mean And Variance Estimation In Dynamic Regression Models—0
Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits—0
Online Causal Inference for Advertising in Real-Time Bidding Auctions—0
Online Learning and Distributed Control for Residential Demand Response—0
Online Learning-based Waveform Selection for Improved Vehicle Recognition in Automotive Radar—0
Online Learning of Energy Consumption for Navigation of Electric Vehicles—0
Online Learning of Network Bottlenecks via Minimax Paths—0
Online Residential Demand Response via Contextual Multi-Armed Bandits—0
Only Pay for What Is Uncertain: Variance-Adaptive Thompson Sampling—0
On Multi-Armed Bandit Designs for Dose-Finding Clinical Trials—0
On Online Learning in Kernelized Markov Decision Processes—0
On The Differential Privacy of Thompson Sampling With Gaussian Prior—0
On the Importance of Uncertainty in Decision-Making with Large Language Models—0
On the Performance of Thompson Sampling on Logistic Bandits—0
On the Prior Sensitivity of Thompson Sampling—0
On Thompson Sampling for Smoother-than-Lipschitz Bandits—0
On Thompson Sampling with Langevin Algorithms—0
On Frequentist Regret of Linear Thompson Sampling—0
Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment—0
Optimal Exploration is no harder than Thompson Sampling—0
Optimality of Thompson Sampling with Noninformative Priors for Pareto Bandits—0
Optimal Learning for Dynamic Coding in Deadline-Constrained Multi-Channel Networks—0
Optimal No-regret Learning in Repeated First-price Auctions—0
Optimal Recommendation to Users that React: Online Learning for a Class of POMDPs—0
Optimistic posterior sampling for reinforcement learning: worst-case regret bounds—0
Optimistic Thompson Sampling for No-Regret Learning in Unknown Games—0
Optimization of a SSP's Header Bidding Strategy using Thompson Sampling—0
Optimizing Adaptive Experiments: A Unified Approach to Regret Minimization and Best-Arm Identification—0
Ordinal Bayesian Optimisation—0
Parallel and Distributed Thompson Sampling for Large-scale Accelerated Exploration of Chemical Space—0
Parallel Bayesian Optimization Using Satisficing Thompson Sampling for Time-Sensitive Black-Box Optimization—0
Parallel Contextual Bandits in Wireless Handover Optimization—0
Parallelizing Thompson Sampling—0
Partial Likelihood Thompson Sampling—0
Partially Observable Contextual Bandits with Linear Payoffs—0
Show:102550
← PrevPage 10 of 14Next →

No leaderboard results yet.