Cover Image

Near-optimal Per-Action Regret Bounds for Sleeping Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nguyen, Quan, Mehta, Nishant A.
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Data-dependent Bounds with $T$-Optimal Best-of-Both-Worlds Guarantees in Multi-Armed Bandits using Stability-Penalty Matching
by: Nguyen, Quan, et al.
Published: (2025)

Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits
by: Huang, Zhiming, et al.
Published: (2026)

Regret Analysis of Sleeping Competing Bandits
by: Uba, Shinnosuke, et al.
Published: (2026)

Data-Driven Upper Confidence Bounds with Near-Optimal Regret for Heavy-Tailed Bandits
by: Tamás, Ambrus, et al.
Published: (2024)

Near-Optimal Regret in Adversarial Kernel Bandits
by: Zhang, Yu-Jie, et al.
Published: (2026)

Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback
by: Lancewicki, Tal, et al.
Published: (2025)

Improved Regret Bounds for Bandits with Expert Advice
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)

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

Information Capacity Regret Bounds for Bandits with Mediator Feedback
by: Eldowa, Khaled, et al.
Published: (2024)

Queue Length Regret Bounds for Contextual Queueing Bandits
by: Bae, Seoungbin, et al.
Published: (2026)

Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity
by: Nguyen, Quan, et al.
Published: (2024)

Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion
by: Lee, Junghyun, et al.
Published: (2023)

Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback
by: Cassel, Asaf, et al.
Published: (2024)

Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits
by: Iwazaki, Shogo
Published: (2025)

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

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

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

Variance-Dependent Regret Lower Bounds for Contextual Bandits
by: He, Jiafan, et al.
Published: (2025)

Revisiting Social Welfare in Bandits: UCB is (Nearly) All You Need
by: Sarkar, Dhruv, et al.
Published: (2025)

Variance-Dependent Regret Bounds for Non-stationary Linear Bandits
by: Wang, Zhiyong, et al.
Published: (2024)

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
by: Di, Qiwei, et al.
Published: (2023)

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

Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
by: Qiu, Hao, et al.
Published: (2026)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
by: Ye, Zichun, et al.
Published: (2025)

Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback
by: Levy, Orin, et al.
Published: (2025)

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

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
by: Yang, Junwen, et al.
Published: (2024)

Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
by: Tran-The, Hung, et al.
Published: (2022)

Improved Regret Bounds for Online Fair Division with Bandit Learning
by: Schiffer, Benjamin, et al.
Published: (2025)

Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment
by: Hu, Bingshan, et al.
Published: (2021)

Tighter Regret Lower Bound for Gaussian Process Bandits with Squared Exponential Kernel in Hypersphere
by: Iwazaki, Shogo
Published: (2026)

Threshold-Based Optimal Arm Selection in Monotonic Bandits: Regret Lower Bounds and Algorithms
by: Varude, Chanakya, et al.
Published: (2025)

Tighter Regret Bounds for Contextual Action-Set Reinforcement Learning
by: Chen, Zijun, et al.
Published: (2026)

Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds
by: Güçlü, Arda, et al.
Published: (2024)

Regret minimization in Linear Bandits with offline data via extended D-optimal exploration
by: Vijayan, Sushant, et al.
Published: (2025)

Bayesian Regret Minimization in Offline Bandits
by: Petrik, Marek, et al.
Published: (2023)

Optimal Regret for Single Index Bandits
by: Dey, Devdan, et al.
Published: (2026)

Bayesian Optimization from Human Feedback: Near-Optimal Regret Bounds
by: Kayal, Aya, et al.
Published: (2025)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
by: Bernasconi, Martino, et al.
Published: (2024)

Representative Action Selection for Large Action Space: From Bandits to MDPs
by: Zhou, Quan, et al.
Published: (2025)