183 citations · 724 across the 42 of their papers we have counts for
8 papers · 1 filter
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…
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…
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…
The perturbed prox-preconditioned spider algorithm: non-asymptotic convergence bounds
Gersende Fort, E Moulines
A novel algorithm named Perturbed Prox-Preconditioned SPIDER (3P-SPIDER) is introduced. It is a stochastic variancereduced proximal-gradient type algorithm built on Stochastic Path…
The Perturbed Prox-Preconditioned SPIDER algorithm for EM-based large scale learning
Gersende Fort, Eric Moulines
Incremental Expectation Maximization (EM) algorithms were introduced to design EM for the large scale learning framework by avoiding the full data set to be processed at each itera…
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…