We propose a covariance-preconditioned kinetic Langevin ensemble sampler named PICKLES. This is a kinetic analogue of the affine invariant interacting Langevin dynamics (ALDI). PICKLES uses a rectangular covariance square root as a preconditioner to avoid computing matrix inverses or square roots, leading to position and momentum variables of different dimensions. Theoretically, the continuous-time dynamics are ergodic under mild regularity and growth conditions on the potential, assuming $N>d+1$ particles and a full-rank initial ensemble. We discretize PICKLES using BAOAB or OBABO splitting, with the latter convenient for Metropolization. For Gaussian targets at stationarity, we demonstrate that Metropolized PICKLES achieves an integration step size scaling of $d^{-1/4}$ to achieve fixed acceptance probabilities, as the ensemble size and dimension increase at a fixed ratio. This matches the scaling of single particle Metropolized Hamiltonian and kinetic samplers. Numerical experiments compare sampling efficiency and estimation error with non-preconditioned, overdamped, and single-chain counterparts, demonstrating improved efficiency per gradient evaluation. On a Dark Energy Survey Year 1 3x2pt cosmology benchmark, we obtain competitive effective sample size per gradient evaluation compared to a densely preconditioned No-U-Turn Sampler.
A stochastic first-order version of the Mirror Langevin Algorithm (sFO-MLA) is studied and finite-time Wasserstein guarantees for sFO-MLA are established that explicitly separate mixing, Euler--Maruyama discretization, and stochastic-gradient errors.
Rui-Ting Tong, Antik Chakraborty, R. Pasupathy· 0 citations
Random-batch methods accelerate molecular dynamics by replacing full interaction sums with stochastic force estimators. In Langevin simulations, however, random-batch force errors can cause artificial heating and distort equilibrium and dynamical observables, especially for small batch sizes or under weak thermostat co...
In recent years, statistical physics tools have been used to study the dynamics of macroscopic quantum and classical integrable models. These studies have shown that, in the thermodynamic limit, long term time-averages of local observables equal statistical averages calculated with a Generalized Gibbs Ensemble (GGE). I...
R. González-Albaladejo, L. Cugliandolo, G. Lozano et al.· 0 citations
Stochastic Gradient Langevin Dynamics (SGLD) reduces the cost of Langevin-based sampling by replacing full-dataset drift evaluations with mini-batch approximations, but the resulting subsampling error may offset this computational saving. We study this trade-off for stochastic differential equations with finite-sum dri...
Mateusz B. Majka, Tigran Nagapetyan, Łukasz Szpruch et al.· 0 citations
Nii-MALA is introduced, a high-performance C implementation of the Metropolis-Adjusted Langevin Algorithm, which leverages Message Passing Interface for parallelization and incorporates automatic differentiation backends for gradient evaluation and benchmark it against several other codes using radial velocity data fro...
Jia-Men Jiao, Sheng Jin, Wen-Xin Jiang et al.· Publications of the Astronom...· 0 citations
Classical Langevin Monte Carlo algorithms, such as the unadjusted Langevin algorithm (ULA), are based on discretization schemes of the overdamped Langevin dynamics and are widely used for sampling in machine learning because they scale to high dimensions and large datasets. However, they require differentiable log-dens...
Qi Feng, Hoang M. Nguyen, Ling-Jiong Zhu· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.