Breaking Reversibility Accelerates Langevin Dynamics for Non-Convex Optimization

Neural Information Processing Systems 

Langevin dynamics (LD) has been proven to be a powerful technique for optimizing a non-convex objective as an efficient algorithm to find local minima while eventually visiting a global minimum on longer time-scales.