Related papers: An explicit splitting SAV scheme for the kinetic L…
It is well known that adding any skew symmetric matrix to the gradient of Langevin dynamics algorithm results in a non-reversible diffusion with improved convergence rate. This paper presents a gradient algorithm to adaptively optimize the…
We consider the convergence of kinetic Langevin dynamics to its ergodic invariant measure, which is Gibbs distribution. Instead of the standard setup where the friction coefficient is a constant scalar, we investigate position-dependent…
The generalized Langevin equation (GLE) constitutes a fundamental model for describing nonequilibrium dynamics with memory effects. To overcome the numerical challenges arising from superquadratically growing potentials and degenerate…
Langevin algorithms are gradient descent methods with additive noise. They have been used for decades in Markov chain Monte Carlo (MCMC) sampling, optimization, and learning. Their convergence properties for unconstrained non-convex…
We propose a stochastic modified equations (SME) for modeling the asynchronous stochastic gradient descent (ASGD) algorithms. The resulting SME of Langevin type extracts more information about the ASGD dynamics and elucidates the…
The scalar auxiliary variable (SAV) approach \cite{shen2018scalar} and its generalized version GSAV proposed in \cite{huang2020highly} are very popular methods to construct efficient and accurate energy stable schemes for nonlinear…
Analogue to the well-known Langevin Monte Carlo method, in this article we provide a method to sample from a target distribution \(\pi\) by simulating a solution of a stochastic differential equation. Hereby, the stochastic differential…
In this paper, we consider numerical approximations for the anisotropic Cahn-Hilliard equation. The main challenge of constructing numerical schemes with unconditional energy stabilities for this model is how to design proper temporal…
We proposed a new technique to accelerate sampling methods for solving difficult optimization problems. Our method investigates the intrinsic connection between posterior distribution sampling and optimization with Langevin dynamics, and…
Sampling from probability distributions of the form $\sigma \propto e^{-\beta V}$, where $V$ is a continuous potential, is a fundamental task across physics, chemistry, biology, computer science, and statistics. However, when $V$ is…
This article focuses on the development of high-order energy stable schemes for the multi-length-scale incommensurate phase-field crystal model which is able to study the phase behavior of aperiodic structures. These high-order schemes…
This article focuses on the development of high-order energy stable schemes for the multi-length-scale incommensurate phase-field crystal model which is able to study the phase behavior of aperiodic structures. These high-order schemes…
We propose a Markov chain Monte Carlo (MCMC) algorithm based on third-order Langevin dynamics for sampling from distributions with log-concave and smooth densities. The higher-order dynamics allow for more flexible discretization schemes,…
We study the problem of non-convex optimization using Stochastic Gradient Langevin Dynamics (SGLD). SGLD is a natural and popular variation of stochastic gradient descent where at each step, appropriately scaled Gaussian noise is added. To…
In this paper, we propose and analyze a linear, structure-preserving scalar auxiliary variable (SAV) method for solving the Allen--Cahn equation based on the second-order backward differentiation formula (BDF2) with variable time steps. To…
Adaptive second-order Crank-Nicolson time-stepping methods using the recent scalar auxiliary variable (SAV) approach are developed for the time-fractional Molecular Beam Epitaxial models with Caputo's derivative. Based on the piecewise…
Bayesian neural networks (BNNs) require scalable sampling algorithms to approximate posterior distributions over parameters. Existing stochastic gradient Markov Chain Monte Carlo (SGMCMC) methods are highly sensitive to the choice of…
Separation of variables (SoV) is an extremely efficient and elegant technique for analysing physical systems but its application to integrable spin chains was limited until recently to the simplest su(2) cases. In this paper we continue…
In this article we consider sampling from log concave distributions in Hamiltonian setting, without assuming that the objective gradient is globally Lipschitz. We propose two algorithms based on monotone polygonal (tamed) Euler schemes, to…
Nonlinear non-Gaussian state-space models arise in numerous applications in statistics and signal processing. In this context, one of the most successful and popular approximation techniques is the Sequential Monte Carlo (SMC) algorithm,…