Cover Image

Sample Complexity of Distributionally Robust Average-Reward Reinforcement Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Zijun, Wang, Shengbo, Si, Nian
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain
by: Wang, Shengbo, et al.
Published: (2025)

Sample Complexity of Variance-reduced Distributionally Robust Q-learning
by: Wang, Shengbo, et al.
Published: (2023)

On the Foundation of Distributionally Robust Reinforcement Learning
by: Wang, Shengbo, et al.
Published: (2023)

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

Quotient-Categorical Representations for Bellman-Compatible Average-Reward Distributional Reinforcement Learning
by: Kaya, Ege C., et al.
Published: (2026)

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

Central Limit Theorem for Two-Time-Scale Approximate Distributionally Robust RL
by: Wang, Shengbo, et al.
Published: (2026)

Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL
by: Zurek, Matthew, 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)

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

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

Q-Measure-Learning for Continuous State RL: Efficient Implementation and Convergence
by: Wang, Shengbo
Published: (2026)

Achieving $\varepsilon^{-2}$ Dependence for Average-Reward Q-Learning with a New Contraction Principle
by: Chen, Zijun, et al.
Published: (2026)

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

Tractable Robust Markov Decision Processes
by: Grand-Clément, Julien, et al.
Published: (2024)

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

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

On Convergence of Average-Reward Q-Learning in Weakly Communicating Markov Decision Processes
by: Wan, Yi, et al.
Published: (2024)

Learning Sequential Decisions from Multiple Sources via Group-Robust Markov Decision Processes
by: Xu, Mingyuan, et al.
Published: (2026)

Convergence and Sample Complexity of First-Order Methods for Agnostic Reinforcement Learning
by: Sherman, Uri, et al.
Published: (2025)

The Sample Complexity of Online Reinforcement Learning: A Multi-model Perspective
by: Muehlebach, Michael, et al.
Published: (2025)

Sample Complexity of the Linear Quadratic Regulator: A Reinforcement Learning Lens
by: Moghaddam, Amirreza Neshaei, et al.
Published: (2024)

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

Provably Efficient Infinite-Horizon Average-Reward Reinforcement Learning with Linear Function Approximation
by: Chae, Woojin, et al.
Published: (2024)

Robust Q-Learning under Corrupted Rewards
by: Maity, Sreejeet, et al.
Published: (2024)

Reward-Relevance-Filtered Linear Offline Reinforcement Learning
by: Zhou, Angela
Published: (2024)

Wasserstein Distributionally Robust Online Learning
by: Chen, Guixian, et al.
Published: (2026)

Robust Regression over Averaged Uncertainty
by: Bertsimas, Dimitris, et al.
Published: (2023)

Group Distributionally Robust Optimization with Flexible Sample Queries
by: Bai, Haomin, et al.
Published: (2025)

Optimal Complexity in Byzantine-Robust Distributed Stochastic Optimization with Data Heterogeneity
by: Shi, Qiankun, et al.
Published: (2025)

Regularized Q-learning through Robust Averaging
by: Schmitt-Förster, Peter, et al.
Published: (2024)

Planning and Learning in Average Risk-aware MDPs
by: Wang, Weikai, et al.
Published: (2025)

Distributionally-Robust Learning to Optimize
by: Ranjan, Vinit, et al.
Published: (2026)

Distributionally Robust Federated Learning with Outlier Resilience
by: Wang, Zifan, et al.
Published: (2025)

Foundations of Multivariate Distributional Reinforcement Learning
by: Wiltzer, Harley, et al.
Published: (2024)

Wasserstein Distributionally Robust Regret Optimization for Reinforcement Learning from Human Feedback
by: Wang, Yikai, et al.
Published: (2026)

Distributionally Robust Learning in Survival Analysis
by: Jin, Yeping, et al.
Published: (2025)

Sample-Efficient Reinforcement Learning of Koopman eNMPC
by: Mayfrank, Daniel, et al.
Published: (2025)

Sample Efficient Reinforcement Learning with Partial Dynamics Knowledge
by: Alharbi, Meshal, et al.
Published: (2023)