:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Zhou, Zihan, Wei, Honghao, Ying, Lei
Format:	Preprint
Published:	2023
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2309.15395
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Best-of-Both-Worlds Policy Optimization for CMDPs with Bandit Feedback
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

Fast and Regret Optimal Best Arm Identification: Fundamental Limits and Low-Complexity Algorithms
by: Zhang, Qining, et al.
Published: (2023)

Learning Weakly Communicating Average-Reward CMDPs: Strong Duality and Improved Regret
by: Yu, Kihyun, et al.
Published: (2026)

Reinforcement Learning from Human Feedback without Reward Inference: Model-Free Algorithm and Instance-Dependent Analysis
by: Zhang, Qining, et al.
Published: (2024)

Beyond Slater's Condition in Online CMDPs with Stochastic and Adversarial Constraints
by: Stradi, Francesco Emanuele, et al.
Published: (2025)

Primal-Dual Policy Optimization for Linear CMDPs with Adversarial Losses
by: Yu, Kihyun, et al.
Published: (2026)

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

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

Cost Aware Best Arm Identification
by: Kanarios, Kellen, et al.
Published: (2024)

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

Near-Optimal Primal-Dual Algorithm for Learning Linear Mixture CMDPs with Adversarial Rewards
by: Yu, Kihyun, et al.
Published: (2026)

Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets
by: Yang, Zixian, et al.
Published: (2025)

Near-Constant Strong Violation and Last-Iterate Convergence for Online CMDPs via Decaying Safety Margins
by: Zuo, Qian, et al.
Published: (2026)

Towards Fast Safe Online Reinforcement Learning via Policy Finetuning
by: Chen, Keru, et al.
Published: (2024)

Horizon-Free Regret for Linear Markov Decision Processes
by: Zhang, Zihan, et al.
Published: (2024)

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

Optimal Batched Best Arm Identification
by: Jin, Tianyuan, et al.
Published: (2023)

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

Optimizing Adaptive Experiments: A Unified Approach to Regret Minimization and Best-Arm Identification
by: Qin, Chao, et al.
Published: (2024)

A Regret Perspective on Online Multiple Testing
by: Hao, Qingyang, et al.
Published: (2026)

Optimal Multi-Fidelity Best-Arm Identification
by: Poiani, Riccardo, et al.
Published: (2024)

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

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

Minimax-Optimal Policy Regret in Partially Observable Markov Games
by: Arora, Raman
Published: (2026)

Optimal Design for Multinomial Logit Model with Applications to Best Assortment Identification
by: Lee, Joongkyu, et al.
Published: (2026)

Optimal Best Arm Identification under Differential Privacy
by: Jourdan, Marc, et al.
Published: (2025)

Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications
by: Yang, Sifan, et al.
Published: (2026)

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

WFR-FM: Simulation-Free Dynamic Unbalanced Optimal Transport
by: Peng, Qiangwei, et al.
Published: (2026)

Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

Nearly Optimal Best Arm Identification for Semiparametric Bandits
by: Kim, Seok-Jin
Published: (2026)

Tight Sample Complexity Bounds for Entropic Best Policy Identification
by: Essakine, Amer, et al.
Published: (2026)

Online Tensor Learning: Computational and Statistical Trade-offs, Adaptivity and Optimal Regret
by: Li, Jingyang, et al.
Published: (2023)

Near Optimal Best Arm Identification for Clustered Bandits
by: Yash, et al.
Published: (2025)

Minimax and Bayes Optimal Best-Arm Identification
by: Kato, Masahiro
Published: (2025)

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

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

Optimal Convergence Rates of Deep Neural Network Classifiers
by: Zhang, Zihan, et al.
Published: (2025)

Best of Both Worlds: Regret Minimization versus Minimax Play
by: Müller, Adrian, et al.
Published: (2025)

Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback
by: Schlisselberg, Ofir, et al.
Published: (2025)