Search arXiv⌕ Search

arXiv · 2610.24295

PICKLES: Covariance-Preconditioned Kinetic Langevin Ensemble Sampler

Abstract

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hong Ye Tan, Stanley Osher, Yifan Chen. 2026-10-16. PICKLES: Covariance-Preconditioned Kinetic Langevin Ensemble Sampler. https://arxiv.org/abs/2610.24295

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Statistical Taylor Expansion: A New and Path-Independent Method for Uncertainty Analysis

Statistical Taylor expansion is a rigorous extension of conventional Taylor expansion that replaces each precise input variable with a random variable of known distribution and sample count, then computes the mean, deviation, and a bounding reliability of every result. By tracking the propagation of input uncertainties through all intermediate steps, it renders the final result path-independent, with precise quantification of the tracking quality. This path-independence sets it fundamentally apart from conventional numerical approaches, which are path-dependent. This study presents an implementation called variance arithmetic and demonstrates its performance across diverse mathematical applications. This study also reveals the potentially substantial impact of numerical errors in library functions, the defect of applying input uncertainties as weights in conventional regression, and the modeling error of the discrete Fourier transformation. The concept of statistical algebra is also introduced.

stat.CO↗

Interacting Annealed Importance Sampling via Population-Based MCMC Kernels

Sampling from a multimodal distribution is a fundamental and challenging problem in computational science and statistics. Among various approaches proposed for this task, one popular method is Annealed Importance Sampling (AIS). In this paper, we propose an interaction-based version of AIS by combining it with population-based Monte Carlo methods to improve its efficiency. By keeping track of an ensemble instead of a single sampler along some continuation path between the starting distribution and the target distribution, we take advantage of the interaction within the ensemble to encourage the exploration of undiscovered modes. Specifically, our main idea is to utilize either the snooker algorithm or the genetic algorithm used in Evolutionary Monte Carlo. We discuss how the proposed algorithm can be implemented and derive a partial differential equation governing the evolution of the ensemble under the continuous time and mean-field limit. We also test the efficiency of the proposed algorithm on various continuous and discrete distributions.

stat.CO↗

Ensemble Control Variates

Control variates have become an increasingly popular variance-reduction technique in Bayesian inference. Many broadly applicable control variates are based on the Langevin-Stein operator, which leverages gradient information available from gradient-based samplers to produce variance-reduced estimators of expectations. These control variates typically require optimising over a function $u(θ)$ within a user-defined functional class $\mathcal{G}$, such as the space of $Q$th-order polynomials or a reproducing kernel Hilbert space. We propose using averaging-based ensemble learning to construct Stein-based control variates. While the proposed framework is broadly applicable, we focus on ensembles constructed from zero-variance control variates (ZVCV), a popular parametric approach based on solving a linear approximation problem that can easily be over-parameterised in medium-to-high dimensional settings. A common remedy is to use regularised ZVCV via penalised regression, but these methods can be prohibitively slow. We introduce ensemble ZVCV methods based on ensembles of OLS estimators and evaluate the proposed methods against established methods in the literature in a simulation study. Our results show that ensemble ZVCV methods are more statistically efficient than regularised ZVCV methods, while also being substantially faster. This work opens a new direction for constructing broadly applicable control variate techniques via ensemble learning.

stat.CO↗