Copertina

Near-Optimal Sample Complexity Bounds for Constrained Average-Reward MDPs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Wei, Yukuan, Li, Xudong, Yang, Lin F.
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Near-Optimal Sample Complexity for Online Constrained MDPs
di: Liu, Chang, et al.
Pubblicazione: (2026)

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

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

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

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

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

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

Global Convergence for Average Reward Constrained MDPs with Primal-Dual Actor Critic Algorithm
di: Xu, Yang, et al.
Pubblicazione: (2025)

Global Convergence of Average Reward Constrained MDPs with Neural Critic and General Policy Parameterization
di: Satheesh, Anirudh, et al.
Pubblicazione: (2026)

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

Learning Infinite-Horizon Average-Reward Linear Mixture MDPs of Bounded Span
di: Chae, Woojin, et al.
Pubblicazione: (2024)

Reinforcement Learning for Infinite-Horizon Average-Reward Linear MDPs via Approximation by Discounted-Reward MDPs
di: Hong, Kihyuk, et al.
Pubblicazione: (2024)

Non-Rectangular Average-Reward Robust MDPs: Optimal Policies and Their Transient Values
di: Wang, Shengbo, et al.
Pubblicazione: (2026)

Optimal Sample Complexity for Average Reward Markov Decision Processes
di: Wang, Shengbo, et al.
Pubblicazione: (2023)

Order-Optimal Regret with Novel Policy Gradient Approaches in Infinite-Horizon Average Reward MDPs
di: Ganesh, Swetha, et al.
Pubblicazione: (2024)

Two-Timescale Critic-Actor for Average Reward MDPs with Function Approximation
di: Panda, Prashansa, et al.
Pubblicazione: (2024)

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

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

Regret Analysis of Average-Reward Unichain MDPs via an Actor-Critic Approach
di: Ganesh, Swetha, et al.
Pubblicazione: (2025)

Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL
di: Zurek, Matthew, et al.
Pubblicazione: (2025)

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

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

Primal-Only Actor Critic Algorithm for Robust Constrained Average Cost MDPs
di: Satheesh, Anirudh, et al.
Pubblicazione: (2025)

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

Learning General Parameterized Policies for Infinite Horizon Average Reward Constrained MDPs via Primal-Dual Policy Gradient Algorithm
di: Bai, Qinbo, et al.
Pubblicazione: (2024)

Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
di: Zurek, Matthew, et al.
Pubblicazione: (2025)

A Computationally Efficient Algorithm for Infinite-Horizon Average-Reward Linear MDPs
di: Hong, Kihyuk, et al.
Pubblicazione: (2025)

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

Sample Complexity of Distributionally Robust Average-Reward Reinforcement Learning
di: Chen, Zijun, et al.
Pubblicazione: (2025)

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

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

Reducing Blackwell and Average Optimality to Discounted MDPs via the Blackwell Discount Factor
di: Grand-Clément, Julien, et al.
Pubblicazione: (2023)

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

Sample Complexity of Average-Reward Q-Learning: From Single-agent to Federated Reinforcement Learning
di: Jiao, Yuchen, et al.
Pubblicazione: (2026)

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

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

Probabilistic Safety Guarantee for Stochastic Control Systems Using Average Reward MDPs
di: Omidi, Saber, et al.
Pubblicazione: (2025)

Time-Constrained Robust MDPs
di: Zouitine, Adil, et al.
Pubblicazione: (2024)

Optimal Horizon-Free Reward-Free Exploration for Linear Mixture MDPs
di: Zhang, Junkai, et al.
Pubblicazione: (2023)

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