Kalman-Langevin dynamics : exponential convergence, particle approximation and numerical approximation
By: Axel Ringh, Akash Sharma
Potential Business Impact:
Makes computer models learn faster and more accurately.
Langevin dynamics has found a large number of applications in sampling, optimization and estimation. Preconditioning the gradient in the dynamics with the covariance - an idea that originated in literature related to solving estimation and inverse problems using Kalman techniques - results in a mean-field (McKean-Vlasov) SDE. We demonstrate exponential convergence of the time marginal law of the mean-field SDE to the Gibbs measure with non-Gaussian potentials. This extends previous results, obtained in the Gaussian setting, to a broader class of potential functions. We also establish uniform in time bounds on all moments and convergence in $p$-Wasserstein distance. Furthermore, we show convergence of a weak particle approximation, that avoids computing the square root of the empirical covariance matrix, to the mean-field limit. Finally, we prove that an explicit numerical scheme for approximating the particle dynamics converges, uniformly in number of particles, to its continuous-time limit, addressing non-global Lipschitzness in the measure.
Similar Papers
Dynamical mean-field analysis of adaptive Langevin diffusions: Propagation-of-chaos and convergence of the linear response
Statistics Theory
Helps computers learn better from messy data.
Dynamical mean-field analysis of adaptive Langevin diffusions: Replica-symmetric fixed point and empirical Bayes
Statistics Theory
Helps computers learn better from changing information.
Analysis of kinetic Langevin Monte Carlo under the stochastic exponential Euler discretization from underdamped all the way to overdamped
Computation
Makes computer simulations of physics more accurate.