:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Feng, Qing, Ma, Tianyi, Zhu, Ruihao
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2406.06802
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Peril of (Even a Little) Nonstationarity in Satisficing Regret Minimization
by: Zhang, Yixuan, et al.
Published: (2026)

$(ε, u)$-Adaptive Regret Minimization in Heavy-Tailed Bandits
by: Genalti, Gianmarco, et al.
Published: (2023)

Regret Distribution in Stochastic Bandits: Optimal Trade-off between Expectation and Tail Risk
by: Simchi-Levi, David, et al.
Published: (2023)

Neural Risk-sensitive Satisficing in Contextual Bandits
by: Ito, Shogo, et al.
Published: (2025)

Identifying All ε-Best Arms in (Misspecified) Linear Bandits
by: Li, Zhekai, et al.
Published: (2025)

Catoni-Style Change Point Detection for Regret Minimization in Non-Stationary Heavy-Tailed Bandits
by: Genalti, Gianmarco, et al.
Published: (2025)

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

Multi-User mmWave Beam and Rate Adaptation via Combinatorial Satisficing Bandits
by: Özyıldırım, Emre, et al.
Published: (2026)

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

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

Bandits with Stochastic Experts: Constant Regret, Empirical Experts and Episodes
by: Sharma, Nihal, et al.
Published: (2021)

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

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

Efficient and Interpretable Bandit Algorithms
by: Mukherjee, Subhojyoti, et al.
Published: (2023)

Robust Satisficing Gaussian Process Bandits Under Adversarial Attacks
by: Saday, Artun, 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)

Risk-Aware Linear Bandits: Theory and Applications in Smart Order Routing
by: Ji, Jingwei, et al.
Published: (2022)

Tail Distribution of Regret in Optimistic Reinforcement Learning
by: Khodadadian, Sajad, et al.
Published: (2025)

Order-Optimal Regret in Distributed Kernel Bandits using Uniform Sampling with Shared Randomness
by: Pavlovic, Nikola, et al.
Published: (2024)

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

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

Chained Information-Theoretic bounds and Tight Regret Rate for Linear Bandit Problems
by: Gouverneur, Amaury, et al.
Published: (2024)

Multi-Armed Bandits With Machine Learning-Generated Surrogate Rewards
by: Ji, Wenlong, et al.
Published: (2025)

Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning
by: Lee, Harin, et al.
Published: (2026)

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

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
by: Ba, Wenjia, et al.
Published: (2021)

Beyond the Lower Bound: Bridging Regret Minimization and Best Arm Identification in Lexicographic Bandits
by: Xue, Bo, et al.
Published: (2025)

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

Statistical Properties of Robust Satisficing
by: Li, Zhiyi, et al.
Published: (2024)

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

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

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

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

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

A Simple and Optimal Policy Design with Safety against Heavy-Tailed Risk for Stochastic Bandits
by: Simchi-Levi, David, et al.
Published: (2022)

On the KL-Divergence-based Robust Satisficing Model
by: Yan, Haojie, et al.
Published: (2024)

Satisficing Exploration for Deep Reinforcement Learning
by: Arumugam, Dilip, et al.
Published: (2024)

Imitation Learning via Focused Satisficing
by: Shah, Rushit N., et al.
Published: (2025)

Distributed Linear Bandits under Communication Constraints
by: Salgia, Sudeep, et al.
Published: (2022)

Distributed No-Regret Learning for Multi-Stage Systems with End-to-End Bandit Feedback
by: Hou, I-Hong
Published: (2024)