SearcharxivSearch

arXiv · 2412.03560

Non-asymptotic entropic bounds for non-linear kinetic Langevin sampler with second-order splitting scheme

Abstract

The problem of sampling according to the probability distribution minimizing a given free energy, using interacting particles unadjusted kinetic Langevin Monte Carlo, is addressed. In this setting, three sources of error arise, related to three parameters: the number of particles $N$, the discretization step size $h$, and the length of the trajectory $n$. The main result of the present work is a quantitative estimate of strong convergence in relative entropy, implying non-asymptotic bounds for the quadratic risk of Monte Carlo estimators for bounded observables. The numerical discretization scheme considered here is a second-order splitting method, as commonly used in practice. In addition to $N,h,n$, the dependency in the ambient dimension $d$ of the problem is also made explicit, under suitable conditions. The main results are proven under general conditions (regularity, moments, log-Sobolev inequality), for which tractable conditions are then provided. In particular, a Lyapunov analysis is conducted under more general conditions than previous works; the nonlinearity may not be small and it may not be convex along linear interpolations between measures.

Explore related subjects

Keep this discovery

BibTeXRIS

Pierre Monmarché, Katharina Schuh. 2024-12-04. Non-asymptotic entropic bounds for non-linear kinetic Langevin sampler with second-order splitting scheme. https://arxiv.org/abs/2412.03560

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR