Related papers: Hypocoercivity properties of adaptive Langevin dyn…
Langevin dynamics (LD) is widely used for sampling from distributions and for optimization. In this work, we derive a closed-form expression for the expected loss of preconditioned LD near stationary points of the objective function. We use…
We develop a new method for proving hypocoercivity for a large class of linear kinetic equations with only one conservation law. Local mass conservation is assumed at the level of the collision kernel, while transport involves a confining…
This paper is committed to investigate an extension of the classical adaptive biasing force method, which is used to compute the free energy related to the Boltzmann-Gibbs measure and a reaction coordinate function. The issue of this…
Hypoelliptic diffusion processes can be used to model a variety of phenomena in applications ranging from molecular dynamics to audio signal analysis. We study parameter estimation for such processes in situations where we observe some…
The Langevin Markov chain algorithms are widely deployed methods to sample from distributions in challenging high-dimensional and non-convex statistics and machine learning applications. Despite this, current bounds for the Langevin…
Many living and complex systems exhibit second order emergent dynamics. Limited experimental access to the configurational degrees of freedom results in data that appears to be generated by a non-Markovian process. This poses a challenge in…
In this paper, we propose a novel technique to implement stochastic gradient methods, which are beneficial for learning from large datasets, through accelerated stochastic dynamics. A stochastic gradient method is based on mini-batch…
We present a theoretical analysis of some popular adaptive Stochastic Gradient Descent (SGD) methods in the small learning rate regime. Using the stochastic modified equations framework introduced by Li et al., we derive effective…
We establish generalization error bounds for stochastic gradient Langevin dynamics (SGLD) with constant learning rate under the assumptions of dissipativity and smoothness, a setting that has received increased attention in the…
Proposals for Metropolis-Hastings MCMC derived by discretizing Langevin diffusion or Hamiltonian dynamics are examples of stochastic autoregressive proposals that form a natural wider class of proposals with equivalent computability. We…
Langevin diffusion is a powerful method for nonconvex optimization, which enables the escape from local minima by injecting noise into the gradient. In particular, the temperature parameter controlling the noise level gives rise to a…
We introduce a numerical method for Brownian dynamics with position dependent diffusion tensor which is second order accurate for sampling the invariant measure while requiring only one force evaluation per timestep. Analysis of the…
Memory effects, sometimes, can not be neglected. In the framework of continuous time random walk, memory effect is modeled by the correlated waiting times. In this paper, we derive the two-point probability distribution of the stochastic…
Discretizations of Langevin diffusions provide a powerful method for sampling and Bayesian inference. However, such discretizations require evaluation of the gradient of the potential function. In several real-world scenarios, obtaining…
A general method is proposed which allows one to estimate drift and diffusion coefficients of a stochastic process governed by a Langevin equation. It extends a previously devised approach [R. Friedrich et al., Physics Letters A 271, 217…
The stochastic motion in a nonhomogeneous medium with traps is studied and diffusion properties of that system are discussed. The particle is subjected to a stochastic stimulation obeying a general L\'evy stable statistics and experiences…
In this work, we take a step towards understanding overdamped Langevin dynamics for the minimization of a general class of objective functions $\mathcal{L}$. We establish well-posedness and regularity of the law $\rho_t$ of the process…
A new (unadjusted) Langevin Monte Carlo (LMC) algorithm with improved rates in total variation and in Wasserstein distance is presented. All these are obtained in the context of sampling from a target distribution $\pi$ that has a density…
The Lorenz equations [1] are a severe Galerkin-truncation of the Oberbeck-Boussinesq (OB) equations describing Rayleigh-B\'enard convection (RBC). Here we examine the mathematical connections between the chaotic lobe-switching behavior of a…
Sampling Gibbs measures at low temperatures is an important task but computationally challenging. Numerical evidence suggests that the infinite-swapping algorithm (isa) is a promising method. The isa can be seen as an improvement of the…