Finite-Sample Analysis of Policy Evaluation for Robust Average Reward Reinforcement Learning
This addresses a gap in robust reinforcement learning theory by providing the first finite-sample guarantees, which is incremental but important for theoretical foundations.
The paper tackles the problem of finite-sample analysis for policy evaluation in robust average-reward Markov Decision Processes, achieving an order-optimal sample complexity of ε^{-2} for robust policy evaluation and robust average reward estimation.
We present the first finite-sample analysis of policy evaluation in robust average-reward Markov Decision Processes (MDPs). Prior work in this setting have established only asymptotic convergence guarantees, leaving open the question of sample complexity. In this work, we address this gap by showing that the robust Bellman operator is a contraction under a carefully constructed semi-norm, and developing a stochastic approximation framework with controlled bias. Our approach builds upon Multi-Level Monte Carlo (MLMC) techniques to estimate the robust Bellman operator efficiently. To overcome the infinite expected sample complexity inherent in standard MLMC, we introduce a truncation mechanism based on a geometric distribution, ensuring a finite expected sample complexity while maintaining a small bias that decays exponentially with the truncation level. Our method achieves the order-optimal sample complexity of $\tilde{\mathcal{O}}(ε^{-2})$ for robust policy evaluation and robust average reward estimation, marking a significant advancement in robust reinforcement learning theory.