Cover Image

Near-Optimal Sample Complexity for Online Constrained MDPs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Chang, Li, Yunfan, Yang, Lin F.
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Near-Optimal Sample Complexity Bounds for Constrained Average-Reward MDPs
by: Wei, Yukuan, et al.
Published: (2025)

Sample Complexity Bounds for Linear Constrained MDPs with a Generative Model
by: Liu, Xingtu, et al.
Published: (2025)

Soft Robust MDPs and Risk-Sensitive MDPs: Equivalence, Policy Gradient, and Sample Complexity
by: Zhang, Runyu, et al.
Published: (2023)

Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs
by: Li, Long-Fei, et al.
Published: (2024)

Span-Based Optimal Sample Complexity for Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2023)

Sample Complexity Characterization for Linear Contextual MDPs
by: Deng, Junze, et al.
Published: (2024)

Projection by Convolution: Optimal Sample Complexity for Reinforcement Learning in Continuous-Space MDPs
by: Maran, Davide, et al.
Published: (2024)

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

Confident Natural Policy Gradient for Local Planning in $q_π$-realizable Constrained MDPs
by: Tian, Tian, et al.
Published: (2024)

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

Near Optimal Non-asymptotic Sample Complexity of 1-Identification
by: Li, Zitian, et al.
Published: (2025)

Private Realizable-to-Agnostic Transformation with Near-Optimal Sample Complexity
by: Li, Bo, et al.
Published: (2025)

The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis
by: Zurek, Matthew, et al.
Published: (2024)

Time-Constrained Robust MDPs
by: Zouitine, Adil, et al.
Published: (2024)

Nearly Optimal Sample Complexity for Learning with Label Proportions
by: Busa-Fekete, Robert, et al.
Published: (2025)

Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2024)

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

Truly No-Regret Learning in Constrained MDPs
by: Müller, Adrian, et al.
Published: (2024)

Near-Optimal Learning and Planning in Separated Latent MDPs
by: Chen, Fan, et al.
Published: (2024)

Augmented Lagrangian Method for Last-Iterate Convergence for Constrained MDPs
by: Lu, Michael, et al.
Published: (2026)

Near-Optimal Regret for Policy Optimization in Contextual MDPs with General Offline Function Approximation
by: Levy, Orin, et al.
Published: (2026)

Near-Optimal Sample Complexities of Divergence-based S-rectangular Distributionally Robust Reinforcement Learning
by: Li, Zhenghao, et al.
Published: (2025)

Constrained Online Two-stage Stochastic Optimization: Near Optimal Algorithms via Adversarial Learning
by: Jiang, Jiashuo
Published: (2023)

On the Model-Misspecification in Reinforcement Learning
by: Li, Yunfan, et al.
Published: (2023)

Efficient Policy Optimization in Robust Constrained MDPs with Iteration Complexity Guarantees
by: Ganguly, Sourav, et al.
Published: (2025)

Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning
by: Kayal, Aya, et al.
Published: (2025)

Data- and Variance-dependent Regret Bounds for Online Tabular MDPs
by: Li, Mingyi, et al.
Published: (2026)

Near-Optimal Solutions of Constrained Learning Problems
by: Elenter, Juan, et al.
Published: (2024)

Efficient Exploration in Average-Reward Constrained Reinforcement Learning: Achieving Near-Optimal Regret With Posterior Sampling
by: Provodin, Danil, et al.
Published: (2024)

Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity
by: Shi, Laixi, et al.
Published: (2022)

Online Learning in MDPs with Partially Adversarial Transitions and Losses
by: Schlisselberg, Ofir, et al.
Published: (2026)

Near-Optimal Online Deployment and Routing for Streaming LLMs
by: Li, Shaoang, et al.
Published: (2025)

Uniform Last-Iterate Guarantee for Bandits and Reinforcement Learning
by: Liu, Junyan, et al.
Published: (2024)

Near-Optimal Sample Complexity for Iterated CVaR Reinforcement Learning with a Generative Model
by: Deng, Zilong, et al.
Published: (2025)

Regret Analysis of Unichain Average Reward Constrained MDPs with General Parameterization
by: Satheesh, Anirudh, et al.
Published: (2026)

Online Generalized-mean Welfare Maximization: Achieving Near-Optimal Regret from Samples
by: Yang, Zongjun, et al.
Published: (2026)

Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity
by: Lau, Ivan, et al.
Published: (2025)

Sample-efficient Learning of Infinite-horizon Average-reward MDPs with General Function Approximation
by: He, Jianliang, et al.
Published: (2024)

Last-Iterate Convergence of General Parameterized Policies in Constrained MDPs
by: Mondal, Washim Uddin, et al.
Published: (2024)

A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints
by: Germano, Jacopo, et al.
Published: (2023)