activity
20142026
most citedNon-asymptotic convergence analysis for the Unadjusted Langevin Algorithm

88 citations · 487 across the 78 of their papers we have counts for

collaborators
Showing 2021Show all

14 papers · 1 filter

stat.ML2021★ 4 cited

Local-Global MCMC kernels: the best of both worlds

Sergey Samsonov, Evgeny Lagutin, Marylou Gabrié +3

Recent works leveraging learning to enhance sampling have shown promising results, in particular by designing effective non-local moves and global proposals. However, learning accu…

math.PR2021

Probability and moment inequalities for additive functionals of geometrically ergodic Markov chains

Alain Durmus, Eric Moulines, Alexey Naumov +1

In this paper, we establish moment and Bernstein-type inequalities for additive functionals of geometrically ergodic Markov chains. These inequalities extend the corresponding ineq…

math.PR2021

Asymptotic bias of inexact Markov Chain Monte Carlo methods in high dimension

Alain Oliviero Durmus, Andreas Eberle

Inexact Markov Chain Monte Carlo methods rely on Markov chains that do not exactly preserve the target distribution. Examples include the unadjusted Langevin algorithm (ULA) and un…

math.PR2021★ 5 cited

Uniform minorization condition and convergence bounds for discretizations of kinetic Langevin dynamics

Alain Durmus, Aurélien Enfroy, Éric Moulines +1

We study the convergence in total variation and -norm of discretization schemes of the underdamped Langevin dynamics. Such algorithms are very popular and commonly used in molec…

stat.ML2021★ 10 cited

Monte Carlo Variational Auto-Encoders

Achille Thin, Nikita Kotelevskii, Arnaud Doucet +3

Variational auto-encoders (VAE) are popular deep latent variable models which are trained by maximizing an Evidence Lower Bound (ELBO). To obtain tighter ELBO and hence better vari…

stat.ME2021★ 2 cited

DG-LMC: A Turn-key and Scalable Synchronous Distributed MCMC Algorithm via Langevin Monte Carlo within Gibbs

Vincent Plassier, Maxime Vono, Alain Durmus +1

Performing reliable Bayesian inference on a big data scale is becoming a keystone in the modern era of machine learning. A workhorse class of methods to achieve this task are Marko…

stat.ML2021★ 8 cited

Tight High Probability Bounds for Linear Stochastic Approximation with Fixed Stepsize

Alain Durmus, Eric Moulines, Alexey Naumov +3

This paper provides a non-asymptotic analysis of linear stochastic approximation (LSA) algorithms with fixed stepsize. This family of methods arises in many machine learning tasks…

stat.ML2021★ 4 cited

Fast Approximation of the Sliced-Wasserstein Distance Using Concentration of Random Projections

Kimia Nadjahi, Alain Durmus, Pierre E. Jacob +2

The Sliced-Wasserstein distance (SW) is being increasingly used in machine learning applications as an alternative to the Wasserstein distance and offers significant computational…

cs.LG2021★ 3 cited

QLSD: Quantised Langevin stochastic dynamics for Bayesian federated learning

Maxime Vono, Vincent Plassier, Alain Durmus +2

The objective of Federated Learning (FL) is to perform statistical inference for data which are decentralised and stored locally on networked clients. FL raises many constraints wh…

math.PR2021★ 2 cited

Discrete sticky couplings of functional autoregressive processes

Alain Durmus, Andreas Eberle, Aurélien Enfroy +2

In this paper, we provide bounds in Wasserstein and total variation distances between the distributions of the successive iterates of two functional autoregressive processes with i…

stat.CO2021★ 2 cited

NEO: Non Equilibrium Sampling on the Orbit of a Deterministic Transform

Achille Thin, Yazid Janati, Sylvain Le Corff +5

Sampling from a complex distribution and approximating its intractable normalizing constant Z are challenging problems. In this paper, a novel family of importance samplers (IS…

stat.ME2021★ 9 cited

Bayesian imaging using Plug & Play priors: when Langevin meets Tweedie

Rémi Laumont, Valentin de Bortoli, Andrés Almansa +3

Since the seminal work of Venkatakrishnan et al. in 2013, Plug & Play (PnP) methods have become ubiquitous in Bayesian imaging. These methods derive Minimum Mean Square Error (MMSE…

stat.ML2021★ 2 cited

On Riemannian Stochastic Approximation Schemes with Fixed Step-Size

Alain Durmus, Pablo Jiménez, Éric Moulines +1

This paper studies fixed step-size stochastic approximation (SA) schemes, including stochastic gradient schemes, in a Riemannian framework. It is motivated by several applications,…

stat.ML2021★ 5 cited

On the Stability of Random Matrix Product with Markovian Noise: Application to Linear Stochastic Approximation and TD Learning

Alain Durmus, Eric Moulines, Alexey Naumov +2

This paper studies the exponential stability of random matrix products driven by a general (possibly unbounded) state space Markov chain. It is a cornerstone in the analysis of sto…