Towards Global Optimality for Practical Average Reward Reinforcement Learning without Mixing Time Oracles
<|reference_start|>Towards Global Optimality for Practical Average Reward Reinforcement Learning without Mixing Time Oracles: In the context of average-reward reinforcement learning, the requirement for oracle knowledge of the mixing time, a measure of the duration a Markov chain under a fixed policy needs to achieve its stationary distribution, poses a significant challenge for the global convergence of policy gradient methods. This requirement is particularly problematic due to the difficulty and expense of estimating mixing time in environments with large state spaces, leading to the necessity of impractically long trajectories for effective gradient estimation in practical applications. To address this limitation, we consider the Multi-level Actor-Critic (MAC) framework, which incorporates a Multi-level Monte-Carlo (MLMC) gradient estimator. With our approach, we effectively alleviate the dependency on mixing time knowledge, a first for average-reward MDPs global convergence. Furthermore, our approach exhibits the tightest available dependence of $\mathcal{O}\left( \sqrt{\tau_{mix}} \right)$known from prior work. With a 2D grid world goal-reaching navigation experiment, we demonstrate that MAC outperforms the existing state-of-the-art policy gradient-based method for average reward settings.<|reference_end|>
@article{patel2024towards,
    title={Towards Global Optimality for Practical Average Reward Reinforcement
  Learning without Mixing Time Oracles},
    author={Bhrij Patel, Wesley A. Suttle, Alec Koppel, Vaneet Aggarwal, Brian M.
  Sadler, Amrit Singh Bedi, Dinesh Manocha},
    journal={arXiv preprint arXiv:2403.11925},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.11925},
    primaryClass={cs.LG}
}