:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Qian, Jian, Wei, Chen-Yu
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2602.07418
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

How Does Variance Shape the Regret in Contextual Bandits?
by: Jia, Zeyu, et al.
Published: (2024)

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

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

Dynamic Regret Reduces to Kernelized Static Regret
by: Jacobsen, Andrew, et al.
Published: (2025)

Optimal Regret for Policy Optimization in Contextual Bandits
by: Levy, Orin, et al.
Published: (2026)

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

Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update
by: Zhang, Yu-Jie, et al.
Published: (2025)

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

Revisiting Matrix Sketching in Linear Bandits: Achieving Sublinear Regret via Dyadic Block Sketching
by: Wen, Dongxie, et al.
Published: (2024)

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

On the Optimal Regret of Locally Private Linear Contextual Bandit
by: Li, Jiachun, et al.
Published: (2024)

Preference-centric Bandits: Optimality of Mixtures and Regret-efficient Algorithms
by: Tatlı, Meltem, et al.
Published: (2025)

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

Parameter-Free Dynamic Regret for Unconstrained Linear Bandits
by: Rumi, Alberto, et al.
Published: (2026)

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
by: Barakat, Anas, et al.
Published: (2026)

Learning What to Recommend: Minimax Optimal Simple Regret in Logistic Bandits
by: Liu, Shuai, et al.
Published: (2026)

Risk-sensitive Bandits: Arm Mixture Optimality and Regret-efficient Algorithms
by: Tatlı, Meltem, et al.
Published: (2025)

An Equivalence Between Static and Dynamic Regret Minimization
by: Jacobsen, Andrew, et al.
Published: (2024)

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

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
by: Ye, Zichun, 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 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)

Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously
by: Pasteris, Stephen, et al.
Published: (2024)

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

No-Regret Linear Bandits under Gap-Adjusted Misspecification
by: Liu, Chong, et al.
Published: (2025)

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

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

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

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

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

Achieving Tractable Minimax Optimal Regret in Average Reward MDPs
by: Boone, Victor, et al.
Published: (2024)

Prior Diffusiveness and Regret in the Linear-Gaussian Bandit
by: Zhu, Yifan, et al.
Published: (2026)

Efficient Swap Regret Minimization in Combinatorial Bandits
by: Kontogiannis, Andreas, et al.
Published: (2026)

Fast Best-in-Class Regret for Contextual Bandits
by: Girard, Samuel, et al.
Published: (2025)

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

Optimal Dynamic Regret by Transformers for Non-Stationary Reinforcement Learning
by: Chen, Baiyuan, et al.
Published: (2025)

Adaptive Regret for Bandits Made Possible: Two Queries Suffice
by: Lu, Zhou, et al.
Published: (2024)

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

Not-a-Bandit: Provably No-Regret Drafter Selection in Speculative Decoding for LLMs
by: Liu, Hongyi, et al.
Published: (2025)