Global optimality of softmax policy gradient with single hidden layer neural networks in the mean-field regime
Machine Learning
2020-10-23 v1 Machine Learning
Abstract
We study the problem of policy optimization for infinite-horizon discounted Markov Decision Processes with softmax policy and nonlinear function approximation trained with policy gradient algorithms. We concentrate on the training dynamics in the mean-field regime, modeling e.g., the behavior of wide single hidden layer neural networks, when exploration is encouraged through entropy regularization. The dynamics of these models is established as a Wasserstein gradient flow of distributions in parameter space. We further prove global optimality of the fixed points of this dynamics under mild conditions on their initialization.
Keywords
Cite
@article{arxiv.2010.11858,
title = {Global optimality of softmax policy gradient with single hidden layer neural networks in the mean-field regime},
author = {Andrea Agazzi and Jianfeng Lu},
journal= {arXiv preprint arXiv:2010.11858},
year = {2020}
}
Comments
22 pages, 1 figure