preprint
Open access
Regret of exploratory policy improvement and $q$-learning
Research footprint
At a glance
- Citations
- 0
- References
- 0
- Comments
- 0
Paper overview
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.
Record transparency
Publication details
- DOI
- 10.48550/arxiv.2411.01302
- OpenAlex
- W4404351649
- Document type
- preprint
- Language
- EN
- Source
- arXiv (Cornell University)
- Last metadata update
Comments
Log in to join the discussion.