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 351–400 of 655 papers

TitleStatusHype
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
Partially Observable Online Change Detection via Smooth-Sparse Decomposition—0
PG-TS: Improved Thompson Sampling for Logistic Contextual Bandits—0
Planning and Learning in Risk-Aware Restless Multi-Arm Bandit Problem—0
Policy Gradient Optimization of Thompson Sampling Policies—0
Position-Based Multiple-Play Bandits with Thompson Sampling—0
Posterior Sampling-Based Bayesian Optimization with Tighter Bayesian Regret Bounds—0
Posterior sampling for reinforcement learning: worst-case regret bounds—0
Posterior Sampling via Autoregressive Generation—0
Practical Adversarial Attacks on Stochastic Bandits via Fake Data Injection—0
Preferential Multi-Objective Bayesian Optimization—0
Prior-free and prior-dependent regret bounds for Thompson Sampling—0
Probabilistic Inference in Reinforcement Learning Done Right—0
Profitable Bandits—0
QoS-Aware Multi-Armed Bandits—0
Racing Thompson: an Efficient Algorithm for Thompson Sampling with Non-conjugate Priors—0
Random Effect Bandits—0
Random Hypervolume Scalarizations for Provable Multi-Objective Black Box Optimization—0
Randomised Bayesian Least-Squares Policy Iteration—0
Randomized Exploration in Cooperative Multi-Agent Reinforcement Learning—0
Regenerative Particle Thompson Sampling—0
Regret Analysis of Bandit Problems with Causal Background Knowledge—0
Regret Analysis of the Finite-Horizon Gittins Index Strategy for Multi-Armed Bandits—0
Regret Bounds for Information-Directed Reinforcement Learning—0
Regularized-OFU: an efficient algorithm for general contextual bandit with optimization oracles—0
Reinforcement Learning for Efficient and Tuning-Free Link Adaptation—0
Reinforcement learning techniques for Outer Loop Link Adaptation in 4G/5G systems—0
Reinforcement Learning with Subspaces using Free Energy Paradigm—0
Reinforcement Learning with Trajectory Feedback—0
Remote Contextual Bandits—0
Residual Bootstrap Exploration for Bandit Algorithms—0
Revised Progressive-Hedging-Algorithm Based Two-layer Solution Scheme for Bayesian Reinforcement Learning—0
Reward Biased Maximum Likelihood Estimation for Reinforcement Learning—0
Risk and optimal policies in bandit experiments—0
Risk-averse Contextual Multi-armed Bandit Problem with Linear Payoffs—0
Risk-Constrained Thompson Sampling for CVaR Bandits—0
Show:102550
← PrevPage 8 of 14Next →

No leaderboard results yet.