Nonconvex optimization and convergence of stochastic gradient descent, and solution of asynchronous game
We review convergence and behavior of stochastic gradient descent for convex and nonconvex optimization, establishing various conditions for convergence to zero of the variance of the gradient of the objective function, and presenting a number of simple examples demonstrating the approximate evolution of the probability density under iteration, including applications to both classical two-player and asynchronous multiplayer games
PDF AbstractCode
Categories
Optimization and Control
