A Latent Variational Framework for Stochastic Optimization
Machine Learning
2019-10-29 v5 Probability
Computation
Machine Learning
Abstract
This paper provides a unifying theoretical framework for stochastic optimization algorithms by means of a latent stochastic variational problem. Using techniques from stochastic control, the solution to the variational problem is shown to be equivalent to that of a Forward Backward Stochastic Differential Equation (FBSDE). By solving these equations, we recover a variety of existing adaptive stochastic gradient descent methods. This framework establishes a direct connection between stochastic optimization algorithms and a secondary Bayesian inference problem on gradients, where a prior measure on noisy gradient observations determines the resulting algorithm.
Cite
@article{arxiv.1905.01707,
title = {A Latent Variational Framework for Stochastic Optimization},
author = {Philippe Casgrain},
journal= {arXiv preprint arXiv:1905.01707},
year = {2019}
}
Comments
8 pages main content, 8 pages appendix