Cover Image

Optimal Sample Complexity for Average Reward Markov Decision Processes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Shengbo, Blanchet, Jose, Glynn, Peter
Format:	Preprint
Published:	2023
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

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

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

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

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

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

An Efficient High-Dimensional Gradient Estimator for Stochastic Differential Equations
by: Wang, Shengbo, et al.
Published: (2024)

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

Achieving Instance-dependent Sample Complexity for Constrained Markov Decision Process
by: Jiang, Jiashuo, et al.
Published: (2024)

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

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

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

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)

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

Near-Optimal Policy Identification in Robust Constrained Markov Decision Processes via Epigraph Form
by: Kitamura, Toshinori, et al.
Published: (2024)

Optimal Non-Asymptotic Rates of Value Iteration for Average-Reward Markov Decision Processes
by: Lee, Jongmin, et al.
Published: (2025)

Robustifying Conditional Portfolio Decisions via Optimal Transport
by: Nguyen, Viet Anh, et al.
Published: (2021)

Weakly Time-Coupled Approximation of Markov Decision Processes
by: Soheili, Negar, et al.
Published: (2026)

Online Markov Decision Processes with Terminal Law Constraints
by: Moreno, Bianca Marin, et al.
Published: (2026)

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

Finite-Time Complexity of Online Primal-Dual Natural Actor-Critic Algorithm for Constrained Markov Decision Processes
by: Zeng, Sihan, et al.
Published: (2021)

Flipping-based Policy for Chance-Constrained Markov Decision Processes
by: Shen, Xun, et al.
Published: (2024)

Unifying Distributionally Robust Optimization via Optimal Transport Theory
by: Blanchet, Jose, et al.
Published: (2023)

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

Computable Bounds on Convergence of Markov Chains in Wasserstein Distance via Contractive Drift
by: Qu, Yanlin, et al.
Published: (2023)

Efficient Algorithms for Robust Markov Decision Processes with $s$-Rectangular Ambiguity Sets
by: Ho, Chin Pang, et al.
Published: (2026)

Non-stationary and Varying-discounting Markov Decision Processes for Reinforcement Learning
by: Chen, Zhizuo, et al.
Published: (2025)

Closing the Gaps: Optimality of Sample Average Approximation for Data-Driven Newsvendor Problems
by: Lyu, Jiameng, et al.
Published: (2024)

Online Reinforcement Learning in Markov Decision Process Using Linear Programming
by: Leon, Vincent, et al.
Published: (2023)

Risk-sensitive Markov Decision Process and Learning under General Utility Functions
by: Wu, Zhengqi, et al.
Published: (2023)

Safe Reinforcement Learning for Constrained Markov Decision Processes with Stochastic Stopping Time
by: Mazumdar, Abhijit, et al.
Published: (2024)

Automatic Outlier Rectification via Optimal Transport
by: Blanchet, Jose, et al.
Published: (2024)

Identification and Adaptive Control of Markov Jump Systems: Sample Complexity and Regret Bounds
by: Sattar, Yahya, et al.
Published: (2021)

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

Online Linear Programming with Batching
by: Xu, Haoran, et al.
Published: (2024)

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

Bayesian Ambiguity Contraction-based Adaptive Robust Markov Decision Processes for Adversarial Surveillance Missions
by: Choi, Jimin, et al.
Published: (2025)

Wasserstein Distributionally Robust Regret Optimization
by: Fiechtner, Lukas-Benedikt, et al.
Published: (2025)

Policy Mirror Descent with Temporal Difference Learning: Sample Complexity under Online Markov Data
by: Li, Wenye, et al.
Published: (2025)

Provably Efficient Representation Selection in Low-rank Markov Decision Processes: From Online to Offline RL
by: Zhang, Weitong, et al.
Published: (2021)