Cover Image

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yang, Junwen, Jin, Tianyuan, Tan, Vincent Y. F.
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Best Arm Identification with Minimal Regret
by: Yang, Junwen, et al.
Published: (2024)

On the Benefits of Free Exploration for Regret Minimization in Multi-Armed Bandits
by: Hou, Yunlong, et al.
Published: (2026)

Optimal Clustering with Bandit Feedback
by: Yang, Junwen, et al.
Published: (2022)

Almost Minimax Optimal Best Arm Identification in Piecewise Stationary Linear Bandits
by: Hou, Yunlong, et al.
Published: (2024)

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
by: Liu, Yujie, et al.
Published: (2025)

Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality
by: Bongole, Raghav, et al.
Published: (2024)

Regret Bounds for Noise-Free Cascaded Kernelized Bandits
by: Li, Zihan, et al.
Published: (2022)

Optimal Best Arm Identification with Fixed Confidence in Restless Bandits
by: Karthik, P. N., et al.
Published: (2023)

On Instability of Minimax Optimal Optimism-Based Bandit Algorithms
by: Praharaj, Samya, et al.
Published: (2025)

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
by: Tajdini, Artin, et al.
Published: (2025)

Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget
by: Bian, Jie, et al.
Published: (2025)

Almost Asymptotically Optimal Active Clustering Through Pairwise Observations
by: Teo, Rachel S. Y., et al.
Published: (2026)

Quantile Multi-Armed Bandits with 1-bit Feedback
by: Lau, Ivan, et al.
Published: (2025)

Indexed Minimum Empirical Divergence-Based Algorithms for Linear Bandits
by: Bian, Jie, et al.
Published: (2024)

Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
by: Ji, Kaixuan, et al.
Published: (2026)

Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards
by: Panda, Subhodip, et al.
Published: (2026)

Bandit Convex Optimization with Gradient Prediction Adaptivity
by: Wang, Shuche, et al.
Published: (2026)

Optimal Streaming Algorithms for Multi-Armed Bandits
by: Jin, Tianyuan, et al.
Published: (2024)

Diminishing Exploration: A Minimalist Approach to Piecewise Stationary Multi-Armed Bandits
by: Li, Kuan-Ta, et al.
Published: (2024)

Minimax Optimal Simple Regret in Two-Armed Best-Arm Identification
by: Kato, Masahiro
Published: (2024)

Optimal Regret of Bernoulli Bandits under Global Differential Privacy
by: Azize, Achraf, et al.
Published: (2025)

Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits
by: Gu, Yuzhou, et al.
Published: (2025)

On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy
by: Jia, Zeyu, et al.
Published: (2025)

Quantum-Enhanced Neural Contextual Bandit Algorithms
by: Huang, Yuqi, et al.
Published: (2026)

Order Optimal Regret Bounds for Sharpe Ratio Optimization under Thompson Sampling
by: Shah, Mohammad Taha, et al.
Published: (2025)

Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions
by: Zhang, Kaihong, et al.
Published: (2024)

p-Mean Regret for Stochastic Bandits
by: Krishna, Anand, et al.
Published: (2024)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
by: Réveillard, William, et al.
Published: (2025)

Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs
by: Zamir, Guy, et al.
Published: (2026)

Optimal Batched Linear Bandits
by: Ren, Xuanfei, et al.
Published: (2024)

Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference
by: Jamshidi, Fateme, et al.
Published: (2025)

Asymptotically Minimax Regret by Bayes Mixtures
by: Takeuchi, Jun'ichi, et al.
Published: (2024)

Optimal Multi-Objective Best Arm Identification with Fixed Confidence
by: Chen, Zhirui, et al.
Published: (2025)

Minimax Optimality of the Probability Flow ODE for Diffusion Models
by: Cai, Changxiao, et al.
Published: (2025)

Minimax Optimal Variance-Aware Regret Bounds for Multinomial Logistic MDPs
by: Boudart, Pierre, et al.
Published: (2026)

Online Prediction of Stochastic Sequences with High Probability Regret Bounds
by: Frey, Matthias, et al.
Published: (2026)

Lower Bounds for Time-Varying Kernelized Bandits
by: Cai, Xu, et al.
Published: (2024)

Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces
by: Tran-The, Hung, et al.
Published: (2020)

Optimal Arm Elimination Algorithms for Combinatorial Bandits
by: Wen, Yuxiao, et al.
Published: (2025)

Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
by: Lee, Joongkyu, et al.
Published: (2024)