Pith. sign in

Nonlinear Hamiltonian Monte Carlo & its Particle Approximation

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

We present a nonlinear (in the sense of McKean) generalization of Hamiltonian Monte Carlo (HMC) termed nonlinear HMC (nHMC) capable of sampling from nonlinear probability measures of mean-field type. When the underlying confinement potential is $K$-strongly convex and $L$-gradient Lipschitz, and the underlying interaction potential is gradient Lipschitz, nHMC can produce an $\varepsilon$-accurate approximation of a $d$-dimensional nonlinear probability measure in $L^1$-Wasserstein distance using $O((L/K) \log(1/\varepsilon))$ steps. Owing to a uniform-in-steps propagation of chaos phenomenon, and without further regularity assumptions, unadjusted HMC with randomized time integration for the corresponding particle approximation can achieve $\varepsilon$-accuracy in $L^1$-Wasserstein distance using $O( (L/K)^{5/3} (d/K)^{4/3} (1/\varepsilon)^{8/3} \log(1/\varepsilon) )$ gradient evaluations. These mixing/complexity upper bounds are a specific case of more general results developed in the paper for a larger class of non-logconcave, nonlinear probability measures of mean-field type.

fields

math.NA 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.

  • Analysis of Langevin midpoint methods using an anticipative Girsanov theorem math.NA · 2025-07-17 · conditional · none · ref 2008 · internal anchor

    A Malliavin-calculus Girsanov analysis yields process-level KL and Rényi bounds for midpoint Langevin discretizations and a O~(kappa^{5/4} d^{1/4}/epsilon^{1/2}) query complexity for a new deterministic double midpoint sampler.