No article text was recorded for this version.
minimax-optimal regret bounds
Version 1 of 123 papers28 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Cost-Aware Optimal Pairwise Pure Exploration
- Blog: Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
- Blog: Continuous Time Bandits with Sampling Costs
- Blog: Every Call is Precious: Global Optimization of Black-Box Functions with Unknown Lipschitz Constants
- Blog: Cost Aware Best Arm Identification
- Blog: Bandit Convex Optimization: Towards Tight Bounds
- Blog: An Optimal Algorithm for Bandit Convex Optimization with Strongly-Convex and Smooth Loss
- Blog: Bandit Convex Optimization: \(\sqrt{T}\) Regret in One Dimension
- Blog: Pairwise Elimination with Instance-Dependent Guarantees for Bandits with Cost Subsidy
- Blog: Volumetric Spanners: An Efficient Exploration Basis for Learning
- Blog: Linear Thompson Sampling Revisited
- Blog: Stochastic Convex Optimization with Bandit Feedback
- Blog: Fusing Reward and Dueling Feedback in Stochastic Bandits
- Blog: Thompson Sampling for Budgeted Multi-Armed Bandits
- Blog: Budget-Constrained Multi-Armed Bandits With Multiple Plays
- Blog: An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
- Blog: The K-Nearest Neighbour UCB Algorithm for Multi-Armed Bandits with Covariates
- Blog: On Thompson Sampling for Smoother-than-Lipschitz Bandits
- Blog: A minimax and asymptotically optimal algorithm for stochastic bandits
- Blog: Asymptotically optimal algorithms for budgeted multiple play bandits
- Blog: Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization
- Blog: Online convex optimization in the bandit setting: gradient descent without a gradient
- Blog: Budgeted Multi-Armed Bandits with Multiple Plays
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_minimax_optimal_regret_bounds_536d11db,
title = {minimax-optimal regret bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/minimax-optimal-regret-bounds/rdr_536d11dbbc924c95b124e3763eed49f0},
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_minimax_optimal_regret_bounds_536d11db_v1,
title = {minimax-optimal regret bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/minimax-optimal-regret-bounds/rdr_536d11dbbc924c95b124e3763eed49f0/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}