Image de couverture de livre

Achieving Optimal Static and Dynamic Regret Simultaneously in Bandits with Deterministic Losses

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Qian, Jian, Wei, Chen-Yu
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

How Does Variance Shape the Regret in Contextual Bandits?
par: Jia, Zeyu, et autres
Publié: (2024)

Near-Optimal Regret in Adversarial Kernel Bandits
par: Zhang, Yu-Jie, et autres
Publié: (2026)

Optimal Regret for Single Index Bandits
par: Dey, Devdan, et autres
Publié: (2026)

Dynamic Regret Reduces to Kernelized Static Regret
par: Jacobsen, Andrew, et autres
Publié: (2025)

Optimal Regret for Policy Optimization in Contextual Bandits
par: Levy, Orin, et autres
Publié: (2026)

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

Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
par: Lee, Joongkyu, et autres
Publié: (2024)

Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update
par: Zhang, Yu-Jie, et autres
Publié: (2025)

Revisiting Matrix Sketching in Linear Bandits: Achieving Sublinear Regret via Dyadic Block Sketching
par: Wen, Dongxie, et autres
Publié: (2024)

Preference-centric Bandits: Optimality of Mixtures and Regret-efficient Algorithms
par: Tatlı, Meltem, et autres
Publié: (2025)

Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback
par: Cassel, Asaf, et autres
Publié: (2024)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
par: Réveillard, William, et autres
Publié: (2025)

On the Optimal Regret of Locally Private Linear Contextual Bandit
par: Li, Jiachun, et autres
Publié: (2024)

Parameter-Free Dynamic Regret for Unconstrained Linear Bandits
par: Rumi, Alberto, et autres
Publié: (2026)

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
par: Barakat, Anas, et autres
Publié: (2026)

Learning What to Recommend: Minimax Optimal Simple Regret in Logistic Bandits
par: Liu, Shuai, et autres
Publié: (2026)

Risk-sensitive Bandits: Arm Mixture Optimality and Regret-efficient Algorithms
par: Tatlı, Meltem, et autres
Publié: (2025)

Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards
par: Panda, Subhodip, et autres
Publié: (2026)

An Equivalence Between Static and Dynamic Regret Minimization
par: Jacobsen, Andrew, et autres
Publié: (2024)

Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
par: Qiu, Hao, et autres
Publié: (2026)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
par: Ye, Zichun, et autres
Publié: (2025)

Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously
par: Pasteris, Stephen, et autres
Publié: (2024)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
par: Yang, Junwen, et autres
Publié: (2024)

Bayesian Regret Minimization in Offline Bandits
par: Petrik, Marek, et autres
Publié: (2023)

No-Regret Linear Bandits under Gap-Adjusted Misspecification
par: Liu, Chong, et autres
Publié: (2025)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
par: Bernasconi, Martino, et autres
Publié: (2024)

Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
par: Ji, Kaixuan, et autres
Publié: (2026)

Optimal High-Probability Regret for Online Convex Optimization with Two-Point Bandit Feedback
par: Ye, Haishan
Publié: (2026)

Threshold-Based Optimal Arm Selection in Monotonic Bandits: Regret Lower Bounds and Algorithms
par: Varude, Chanakya, et autres
Publié: (2025)

Data-Driven Upper Confidence Bounds with Near-Optimal Regret for Heavy-Tailed Bandits
par: Tamás, Ambrus, et autres
Publié: (2024)

Prior Diffusiveness and Regret in the Linear-Gaussian Bandit
par: Zhu, Yifan, et autres
Publié: (2026)

Efficient Swap Regret Minimization in Combinatorial Bandits
par: Kontogiannis, Andreas, et autres
Publié: (2026)

Fast Best-in-Class Regret for Contextual Bandits
par: Girard, Samuel, et autres
Publié: (2025)

Improved Regret Bounds for Bandits with Expert Advice
par: Cesa-Bianchi, Nicolò, et autres
Publié: (2024)

Optimal Dynamic Regret by Transformers for Non-Stationary Reinforcement Learning
par: Chen, Baiyuan, et autres
Publié: (2025)

Optimal Regret of Bernoulli Bandits under Global Differential Privacy
par: Azize, Achraf, et autres
Publié: (2025)

Achieving Tractable Minimax Optimal Regret in Average Reward MDPs
par: Boone, Victor, et autres
Publié: (2024)

Adaptive Regret for Bandits Made Possible: Two Queries Suffice
par: Lu, Zhou, et autres
Publié: (2024)

Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion
par: Lee, Junghyun, et autres
Publié: (2023)

Non-stationary Online Learning for Curved Losses: Improved Dynamic Regret via Mixability
par: Zhang, Yu-Jie, et autres
Publié: (2025)