Search arXivSearch

arXiv · 2609.03326

Geometric Ergodicity of Affine Invariant Ensemble Langevin and its Discrete Time Variants

Abstract

Affine-invariant ensemble samplers are widely used in Bayesian applications. However, their quantitative convergence theory, in particular geometric ergodicity, remains a basic open question. We study the affine invariant ensemble Langevin dynamics, an interacting particle system that uses the empirical covariance of the whole ensemble as a preconditioner. While effective in practice, theoretical understanding of this method is not available beyond plain qualitative convergence in total variation; a central difficulty is that the empirical covariance can approach singularity. This paper addresses this challenge. For potentials with bounded Hessian that are strongly convex outside a ball, we prove geometric ergodicity using a novel Lyapunov function that combines an inverse-covariance barrier with a coercive exponential energy. We then show that directly applying the Euler--Maruyama scheme can diverge with positive probability, even for a one-dimensional Gaussian target. This motivates a covariance-trace time regularization. We prove geometric ergodicity of the regularized diffusion and, for sufficiently small step size, of its unadjusted Euler--Maruyama discretization. We also show that the invariant distributions of the discretization converge weakly to the product target distribution as the step size tends to zero.

Explore related subjects

Keep this discovery

BibTeXRIS

Hong Ye Tan, Yifan Chen. 2026-09-03. Geometric Ergodicity of Affine Invariant Ensemble Langevin and its Discrete Time Variants. https://arxiv.org/abs/2609.03326

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Bernstein--von Mises theorems for Bayesian probabilistic numerics

We study probabilistic numerical methods for solving nonlinear PDEs from a Bayesian nonparametric perspective. Given noisy evaluations at random collocation points, we place a truncated Gaussian series prior on the unknown solution and establish contraction at the minimax nonparametric rate, up to a logarithmic factor. Our main results give Gaussian approximations of the posterior in positive-order Sobolev spaces and, under suitable conditions, in the uniform topology. This contrasts with classical ill-posed inverse problems, where Bernstein--von Mises theorems typically require substantially weaker topologies. Here, the observation operator is differential rather than smoothing, and inversion of its linearisation gains regularity, making these strong-topology results possible. The posterior may be centred at either the posterior mean or the posterior mode. We further prove that the Gaussian Laplace approximation is asymptotically equivalent to the true posterior at a $\sqrt{N}$-scale.

math.ST

Windowed thinning and query complexity for the bouncy particle and Zigzag samplers

Let $μ(d x)\propto e^{-U(x)} d x$ on $\R^d$, where $U$ is $m$-strongly convex and $L$-smooth, and denote by $κ=L/m$ the condition number. We consider windowed thinning, an exact simulation method for the bouncy particle sampler and the coordinate Zigzag process. The method divides a trajectory into deterministic windows and uses a gradient evaluation at the beginning of each window to construct a tractable local envelope for the event rate. Combining this construction with quantitative mixing estimates and finite-time bounds on the expected numbers of bounces and flips yields query complexity guarantees from a Gaussian cold start. For total-variation error $\varepsilon$, the expected query counts are $O(κ^{1/2}d\,(d\logκ+\log\frac1\varepsilon))$ gradient queries for the bouncy particle sampler and $O(κd^{1/4}(d\logκ+\log\frac1\varepsilon))$ full-gradient equivalents for Zigzag, where $d$ coordinate-partial queries count as one equivalent.

math.NA

Geometric Optics Approximation Sampling: A Reflector-Induced Transport Map Framework

In this paper, we propose Geometric Optics Approximation Sampling (GOAS), a reflector-induced transport-map framework for sampling from target measures. Once a reflecting surface is constructed, the associated transport map is explicitly determined by the physical law of reflection. As a concrete realization, we develop a supporting-hyperellipsoid construction that requires only a discrete approximation of the target measure and does not require gradient information of the target density. The formulation accommodates both density-based and sample-based target representations. A softmin smoothing technique is introduced to obtain a smooth approximate transport map from this piecewise hyperellipsoidal construction. We establish well-posedness and stability of the reflector-induced push-forward measure and derive quantitative error estimates in the maximum mean discrepancy metric, and convergence of continuous statistical observables, including fixed-order moments. Numerical experiments on an analytically tractable example, strongly non-Gaussian targets, sample-based target approximations, and Bayesian inverse problems demonstrate the accuracy and flexibility of GOAS.

math.NA