1. D. Ding. Provable reinforcement learning for constrained and multi-agent control systems. PhD thesis, University of Southern California, 2022. Keyword(s): Constrained Markov decision processes, Constrained nonconvex optimization, Function approximation, Game-agnostic convergence, Multi-agent reinforcement learning, Multi-agent systems, Natural policy gradient, Policy gradient methods, Proximal policy optimization, Primal-dual algorithms, Reinforcement learning, Safe exploration, Safe reinforcement learning, Sample complexity, Stochastic optimization. [bibtex-entry]

1. D. Ding, K. Zhang, J. Duan, T. Basar, and M. R. Jovanovic. Convergence and sample complexity of natural policy gradient primal-dual methods for constrained MDPs. J. Mach. Learn. Res., 2022. Note: Submitted; also arXiv:2206.02346. Keyword(s): Constrained Markov decision processes, Constrained nonconvex optimization, Function approximation, Natural policy gradient, Policy gradient methods, Primal-dual algorithms, Sample complexity. [bibtex-entry]

1. D. Ding, K. Zhang, T. Basar, and M. R. Jovanovic. Natural policy gradient primal-dual method for constrained Markov decision processes. In Proceedings of the 34th Conference on Neural Information Processing Systems, volume 33, Vancouver, Canada, pages 8378-8390, 2020. Keyword(s): Constrained Markov decision processes, Constrained nonconvex optimization, Natural policy gradient, Policy gradient methods, Primal-dual algorithms. [bibtex-entry]

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

This document was translated from BibT_EX by bibtex2html