No article text was recorded for this version.
asymptotic regret optimality
Version 1 of 143 papers51 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Logarithmic Bayes Regret Bounds
- Blog: Finite-Time Logarithmic Bayes Regret Upper Bounds
- Blog: Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis
- Blog: Learning to Optimize Via Posterior Sampling
- Blog: Thompson Sampling for 1-Dimensional Exponential Family Bandits
- Blog: Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays
- Blog: Analysis of Thompson Sampling for the Multi-armed Bandit Problem
- Blog: Thompson Sampling on Symmetric Alpha-Stable Bandits
- Blog: The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond
- Blog: Bandit Algorithms Based on Thompson Sampling for Bounded Reward Distributions
- Blog: Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits
- Blog: Solving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling
- Blog: Posterior Sampling-Based Bayesian Optimization with Tighter Bayesian Regret Bounds
- Blog: When Combinatorial Thompson Sampling meets Approximation Regret
- Blog: Analysis of Thompson Sampling for Combinatorial Multi-armed Bandit with Probabilistically Triggered Arms
- Blog: Feel-Good Thompson Sampling for Contextual Dueling Bandits
- Blog: Prior-free and prior-dependent regret bounds for Thompson Sampling
- Blog: Regret Bounds for Thompson Sampling in Episodic Restless Bandit Problems.
- Blog: Thompson Sampling with Information Relaxation Penalties
- Blog: (More) Efficient Reinforcement Learning via Posterior Sampling
- Blog: Exchangeability Characterizes Optimality of Sequential Normalized Maximum Likelihood and Bayesian Prediction with Jeffreys Prior
- Blog: Unimodal Thompson Sampling for Graph-Structured Arms
- Blog: Analysis and Design of Thompson Sampling for Stochastic Partial Monitoring
- Blog: MOTS: Minimax Optimal Thompson Sampling
- Blog: Randomized Exploration in Generalized Linear Bandits
- Blog: Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox
- Blog: MINTS: Minimalist Thompson Sampling
- Blog: Exploration via linearly perturbed loss minimisation
- Blog: Variational Bayesian Reinforcement Learning with Regret Bounds
- Blog: Thompson Sampling with Less Exploration is Fast and Optimal
- Blog: Tight Regret and Complexity Bounds for Thompson Sampling via Langevin Monte Carlo
- Blog: Thompson Sampling for Contextual Bandits with Linear Payoffs
- Blog: Thompson Sampling for Bandit Learning in Matching Markets
- Blog: Eluder Dimension and the Sample Complexity of Optimistic Exploration
- Blog: A Self-Play Posterior Sampling Algorithm for Zero-Sum Markov Games
- Blog: A Thompson Sampling Algorithm for Cascading Bandits
- Blog: Online learning of network bottlenecks via minimax paths
- Blog: A Multiarmed Bandit Based Incentive Mechanism for a Subset Selection of Customers for Demand Response in Smart Grids
- Blog: Improved Worst-Case Regret Bounds for Randomized Least-Squares Value Iteration
- Blog: Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning
- Blog: Thompson Sampling Regret Bounds for Contextual Bandits with sub-Gaussian rewards
- Blog: An Information-Theoretic Analysis of Thompson Sampling with Infinite Action Spaces
- Blog: Residual bootstrap exploration for stochastic linear bandit
History & citation
Current · Permanent link
- This direction split from Theoretical Foundations of Thompson Sampling and Posterior Sampling (58% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_asymptotic_regret_optimality_7aef04c7,
title = {asymptotic regret optimality},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/asymptotic-regret-optimality/rdr_7aef04c7409848319dbd293f313ebc36},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_asymptotic_regret_optimality_7aef04c7_v1,
title = {asymptotic regret optimality},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/asymptotic-regret-optimality/rdr_7aef04c7409848319dbd293f313ebc36/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}