Optimistic Policy Optimization is Provably Efficient in Non-stationary MDPs
Abstract
We study episodic reinforcement learning (RL) in non-stationary linear kernel Markov decision processes (MDPs). In this setting, both the reward function and the transition kernel are linear with respect to the given feature maps and are allowed to vary over time, as long as their respective parameter variations do not exceed certain variation budgets. We propose the \underline{p}eriodically \underline{r}estarted \underline{o}ptimistic \underline{p}olicy \underline{o}ptimization algorithm (PROPO), which is an optimistic policy optimization algorithm with linear function approximation. PROPO features two mechanisms: sliding-window-based policy evaluation and periodic-restart-based policy improvement, which are tailored for policy optimization in a non-stationary environment. In addition, only utilizing the technique of sliding window, we propose a value-iteration algorithm. We establish dynamic upper bounds for the proposed methods and a minimax lower bound which shows the (near-) optimality of the proposed methods. To our best knowledge, PROPO is the first provably efficient policy optimization algorithm that handles non-stationarity.
Cite
@article{arxiv.2110.08984,
title = {Optimistic Policy Optimization is Provably Efficient in Non-stationary MDPs},
author = {Han Zhong and Zhongren Chen and Zhuoran Yang and Zhaoran Wang and Csaba Szepesvári},
journal= {arXiv preprint arXiv:2110.08984},
year = {2024}
}