Cover Image

Non-asymptotic analysis of Langevin-type Monte Carlo algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Nakakita, Shogo
Format:	Preprint
Published:	2023
Subjects:	Statistics Theory Probability Machine Learning 65C05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On sample complexity for covariance estimation via the unadjusted Langevin algorithm
by: Nakakita, Shogo
Published: (2026)

Ballistic Convergence in Hit-and-Run Monte Carlo and a Coordinate-free Randomized Kaczmarz Algorithm
by: Bou-Rabee, Nawaf, et al.
Published: (2024)

HMC and underdamped Langevin united in the unadjusted convex smooth case
by: Gouraud, Nicolaï, et al.
Published: (2022)

Non-asymptotic estimates for accelerated high order Langevin Monte Carlo algorithms
by: Neufeld, Ariel, et al.
Published: (2024)

Unadjusted Hamiltonian MCMC with Stratified Monte Carlo Time Integration
by: Bou-Rabee, Nawaf, et al.
Published: (2022)

Convergence of Langevin AIS for multimodal distributions
by: Agarwal, Akshat, et al.
Published: (2026)

Accelerate Langevin Sampling with Birth-Death Process and Exploration Component
by: Tan, Lezhi, et al.
Published: (2023)

Optimal Scaling Results for Moreau-Yosida Metropolis-adjusted Langevin Algorithms
by: Crucinio, Francesca R., et al.
Published: (2023)

Wasserstein bounds for denoising diffusion probabilistic models via the Föllmer process
by: Koike, Yuta
Published: (2026)

Almost sure convergence rates of adaptive increasingly rare Markov chain Monte Carlo
by: Hofstadler, Julian, et al.
Published: (2024)

Monte Carlo on a single sample
by: Detering, Nils, et al.
Published: (2025)

Randomized Runge-Kutta-Nyström Methods for Unadjusted Hamiltonian and Kinetic Langevin Monte Carlo
by: Bou-Rabee, Nawaf, et al.
Published: (2023)

Projected Langevin Monte Carlo algorithms in non-convex and super-linear setting
by: Pang, Chenxu, et al.
Published: (2023)

Large deviations for Independent Metropolis Hastings and Metropolis-adjusted Langevin algorithm
by: Milinanni, Federica, et al.
Published: (2024)

On couplings for kinetic Langevin diffusions
by: Bou-Rabee, Nawaf, et al.
Published: (2026)

Convergence of a Sequential Monte Carlo algorithm towards multimodal distributions on Rd
by: Han, Ruiyu
Published: (2025)

Parallelized Midpoint Randomization for Langevin Monte Carlo
by: Yu, Lu, et al.
Published: (2024)

A Dynamical System View of Langevin-Based Non-Convex Sampling
by: Karimi, Mohammad Reza, et al.
Published: (2022)

Reflection coupling for unadjusted generalized Hamiltonian Monte Carlo in the nonconvex stochastic gradient case
by: Chak, Martin, et al.
Published: (2023)

Sharp concentration of uniform generalization errors in binary linear classification
by: Nakakita, Shogo
Published: (2025)

Approximating Langevin Monte Carlo with ResNet-like Neural Network architectures
by: Miranda, Charles, et al.
Published: (2023)

User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
by: Dalalyan, Arnak S., et al.
Published: (2017)

Non-asymptotic Analysis of Poisson randomized midpoint Langevin Monte Carlo
by: Shen, Tian, et al.
Published: (2025)

Convergence and non-asymptotic error analysis for kinetic Langevin samplers using the exact harmonic Langevin integrator
by: Schuh, Katharina
Published: (2026)

The No-Underrun Sampler: A Locally-Adaptive, Gradient-Free MCMC Method
by: Bou-Rabee, Nawaf, et al.
Published: (2025)

Convergence of Kinetic Langevin Monte Carlo on Lie groups
by: Kong, Lingkai, et al.
Published: (2024)

An algorithm for simulating Brownian increments on a sphere
by: Mijatović, Aleksandar, et al.
Published: (2020)

Time-complexity of sampling from a multimodal distribution using sequential Monte Carlo
by: Han, Ruiyu, et al.
Published: (2025)

Unbiased Kinetic Langevin Monte Carlo with Inexact Gradients
by: Chada, Neil K., et al.
Published: (2023)

Benign Overfitting in Time Series Linear Models with Over-Parameterization
by: Nakakita, Shogo, et al.
Published: (2022)

Parallel MCMC Algorithms: Theoretical Foundations, Algorithm Design, Case Studies
by: Glatt-Holtz, Nathan E., et al.
Published: (2022)

Theoretical guarantees for neural control variates in MCMC
by: Belomestny, Denis, et al.
Published: (2023)

On The Variance of Schatten $p$-Norm Estimation with Gaussian Sketching Matrices
by: Horesh, Lior, et al.
Published: (2024)

Convergence of stochastic gradient descent schemes for Lojasiewicz-landscapes
by: Dereich, Steffen, et al.
Published: (2021)

Random Reshuffling for Stochastic Gradient Langevin Dynamics
by: Shaw, Luke, et al.
Published: (2025)

Large deviation-based tuning schemes for Metropolis-Hastings algorithms
by: Milinanni, Federica
Published: (2024)

Rosenthal-type inequalities for linear statistics of Markov chains
by: Durmus, Alain, et al.
Published: (2023)

Reversibility of elliptical slice sampling revisited
by: Hasenpflug, Mareike, et al.
Published: (2023)

Variance bounds and robust tuning for pseudo-marginal Metropolis--Hastings algorithms
by: Sherlock, Chris
Published: (2024)

kTULA: A Langevin sampling algorithm with improved KL bounds under super-linear log-gradients
by: Lytras, Iosif, et al.
Published: (2025)