mlsanityData to 7 Oct 2026

Concentration analysis of multivariate elliptic diffusion processes

arXiv 2206.03329 ↗First posted 7 Jun 2022math.PR math.ST stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

We prove concentration inequalities and associated PAC bounds for continuous- and discrete-time additive functionals for possibly unbounded functions of multivariate, nonreversible diffusion processes. Our analysis relies on an approach via the Poisson equation allowing us to consider a very broad class of subexponentially ergodic processes. These results add to existing concentration inequalities for additive functionals of diffusion processes which have so far been only available for either bounded functions or for unbounded functions of processes from a significantly smaller class. We demonstrate the power of these exponential inequalities by two examples of very different areas. Considering a possibly high-dimensional parametric nonlinear drift model under sparsity constraints, we apply the continuous-time concentration results to validate the restricted eigenvalue condition for Lasso estimation, which is fundamental for the derivation of oracle inequalities. The results for discrete additive functionals are used to investigate the unadjusted Langevin MCMC algorithm for sampling of moderately heavy-tailed densities π. In particular, we provide PAC bounds for the sample Monte Carlo estimator of integrals π(f) for polynomially growing functions f that quantify sufficient sample and step sizes for approximation within a prescribed margin with high probability.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 48 references that are in the map. First posted on arXiv 7 Jun 2022.

Builds on

10 of 48 references.

References · 10

  1. 2014Theoretical guarantees for approximate sampling from smooth and log-concave densitiescited by 206
  2. 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 195
  3. 2016High-dimensional Bayesian inference via the Unadjusted Langevin Algorithmcited by 144
  4. 2018Analysis of Langevin Monte Carlo via convex optimizationcited by 126
  5. 2017User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradientcited by 116
  6. 2014Consistency and fluctuations for stochastic gradient Langevin dynamicscited by 65
  7. 2020On the Convergence of Langevin Monte Carlo: The Interplay between Tail Growth and Smoothnesscited by 55
  8. 2018Global Non-convex Optimization with Discretized Diffusionscited by 44
  9. 2013Regularized estimation in sparse high-dimensional time series modelscited by 40
  10. 2017Sparse inference of the drift of a high-dimensional Ornstein-Uhlenbeck processcited by 1

Built on by

Not cited yet.