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 101–150 of 655 papers

TitleStatusHype
Smart Routing with Precise Link Estimation: DSEE-Based Anypath Routing for Reliable Wireless Networking—0
Analyzing and Enhancing Queue Sampling for Energy-Efficient Remote Control of Bandits—0
Thompson Sampling for Infinite-Horizon Discounted Decision Processes—0
Constructing Adversarial Examples for Vertical Federated Learning: Optimal Client Corruption through Multi-Armed BanditCode0
Efficient and Adaptive Posterior Sampling Algorithms for Bandits—0
Bayesian Optimization with LLM-Based Acquisition Functions for Natural Language Preference Elicitation—0
Bayesian-Guided Generation of Synthetic Microbiomes with Minimized Pathogenicity—0
Randomized Exploration in Cooperative Multi-Agent Reinforcement Learning—0
Online Learning of Decision Trees with Thompson SamplingCode0
Feel-Good Thompson Sampling for Contextual Dueling Bandits—0
A Reinforcement Learning based Reset Policy for CDCL SAT Solvers—0
On the Importance of Uncertainty in Decision-Making with Large Language Models—0
Meta Learning in Bandits within Shared Affine Subspaces—0
A resource-constrained stochastic scheduling algorithm for homeless street outreach and gleaning edible food—0
Cramming Contextual Bandits for On-policy Statistical Evaluation—0
ε-Neural Thompson Sampling of Deep Brain Stimulation for Parkinson Disease Treatment—0
TS-RSR: A provably efficient approach for batch Bayesian Optimization—0
Chained Information-Theoretic bounds and Tight Regret Rate for Linear Bandit Problems—0
Epsilon-Greedy Thompson Sampling to Bayesian Optimization—0
Influencing Bandits: Arm Selection for Preference Shaping—0
Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits—0
Optimizing Adaptive Experiments: A Unified Approach to Regret Minimization and Best-Arm Identification—0
Thompson Sampling in Partially Observable Contextual Bandits—0
Diffusion Models Meet Contextual Bandits with Large Action Spaces—0
Tree Ensembles for Contextual Bandits—0
Optimistic Thompson Sampling for No-Regret Learning in Unknown Games—0
Context in Public Health for Underserved Communities: A Bayesian Approach to Online Restless Bandits—0
Efficient Exploration for LLMs—0
Accelerating Approximate Thompson Sampling with Underdamped Langevin Monte CarloCode0
Thompson Sampling for Stochastic Bandits with Noisy Contexts: An Information-Theoretic Regret Analysis—0
Model-Free Approximate Bayesian Learning for Large-Scale Conversion Funnel Optimization—0
Decentralized Multi-Agent Active Search and Tracking when Targets Outnumber Agents—0
Improving sample efficiency of high dimensional Bayesian optimization with MCMC—0
Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood SearchCode1
Zero-Inflated Bandits—0
Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse HypergraphsCode0
Best Arm Identification in Batched Multi-armed Bandit Problems—0
Bayesian Analysis of Combinatorial Gaussian Process Bandits—0
RoME: A Robust Mixed-Effects Bandit Algorithm for Optimizing Mobile Health InterventionsCode0
Sample-based Dynamic Hierarchical Transformer with Layer and Head Flexibility via Contextual Bandit—0
The Sliding Regret in Stochastic Bandits: Discriminating Index and Randomized Policies—0
Thompson sampling for zero-inflated count outcomes with an application to the Drink Less mobile health study—0
Probabilistic Inference in Reinforcement Learning Done Right—0
A Distributed Neural Linear Thompson Sampling Framework to Achieve URLLC in Industrial IoT—0
Adaptive Interventions with User-Defined Goals for Health Behavior ChangeCode0
Exploration via linearly perturbed loss minimisation—0
Posterior Sampling-Based Bayesian Optimization with Tighter Bayesian Regret Bounds—0
Batch Bayesian Optimization for Replicable Experimental Design—0
Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning—0
Dual-Directed Algorithm Design for Efficient Pure Exploration—0
Show:102550
← PrevPage 3 of 14Next →

No leaderboard results yet.