Uniform Stability and High Order Approximation of the Langevin Algorithm in Non-Convex Learning
Speaker:
Mufan Li, University of Toronto
Date and Time:
Thursday, April 25, 2019 - 10:00am to 10:30am
Location:
Fields Institute, Room 230
Abstract:
We study the global convergence of discrete algorithms for optimizing non-convex empirical loss functions. Many of these algorithms correspond to the Euler discretization of a diffusion process. One limitation by previous work is that the stationary distribution of the discretized process has been only approximated by the Gibbs’ distribution. In this work we improve the approximation by using weak backward error analysis to construct higher order approximate measures, and prove this type of approximate measures are uniformly stable.