Pith. sign in

REVIEW 1 cited by

Nonlinear Hamiltonian Monte Carlo & its Particle Approximation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2308.11491 v1 pith:43HKUKV7 submitted 2023-08-22 math.PR math.STstat.TH

classification math.PRmath.STstat.TH
keywords nonlinearvarepsilonapproximationgradientprobabilitycarlodistancehamiltonian
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Analysis of Langevin midpoint methods using an anticipative Girsanov theorem

    math.NA 2025-07 conditional novelty 6.0 of 10

    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 midpoin...

Pith tools