Regret of exploratory policy improvement and $q$-learning
Wenpin Tang, Xun Yu Zhou
TL;DR
Under suitable conditions on the growth and regularity of the model parameters, this work provides a quantitative error and regret analysis of both the exploratory policy improvement algorithm and the $q$-learning algorithm.
Abstract
We study the convergence of $q$-learning and related algorithms introduced by Jia and Zhou (J. Mach. Learn. Res., 24 (2023), 161) for controlled diffusion processes. Under suitable conditions on the growth and regularity of the model parameters, we provide a quantitative error and regret analysis of both the exploratory policy improvement algorithm and the $q$-learning algorithm.
