activity
20042022
most citedOn Upper-Confidence Bound Policies for Non-Stationary Bandit Problems

183 citations · 724 across the 42 of their papers we have counts for

collaborators
Showing 2020Show all

7 papers · 1 filter

stat.CO20203 cited

Nonreversible MCMC from conditional invertible transforms: a complete recipe with convergence guarantees

Achille Thin, Nikita Kotelevskii, Christophe Andrieu +3

Markov Chain Monte Carlo (MCMC) is a class of algorithms to sample complex and high-dimensional probability distributions. The Metropolis-Hastings (MH) algorithm, the workhorse of…

cs.LG20203 cited

A Stochastic Path-Integrated Differential EstimatoR Expectation Maximization Algorithm

Gersende Fort, Eric Moulines, Hoi-To Wai

The Expectation Maximization (EM) algorithm is of key importance for inference in latent variable models including mixture of regressors and experts, missing observations. This pap…

stat.ML2020

Geom-SPIDER-EM: Faster Variance Reduced Stochastic Expectation Maximization for Nonconvex Finite-Sum Optimization

Gersende Fort, Eric Moulines, Hoi-To Wai

The Expectation Maximization (EM) algorithm is a key reference for inference in latent variable models; unfortunately, its computational cost is prohibitive in the large scale lear…

math.ST2020

Variance reduction for dependent sequences with applications to Stochastic Gradient MCMC

D. Belomestny, L. Iosipoi, E. Moulines +2

In this paper we propose a novel and practical variance reduction approach for additive functionals of dependent sequences. Our approach combines the use of control variates with t…

stat.ML20205 cited

MetFlow: A New Efficient Method for Bridging the Gap between Markov Chain Monte Carlo and Variational Inference

Achille Thin, Nikita Kotelevskii, Jean-Stanislas Denain +4

In this contribution, we propose a new computationally efficient method to combine Variational Inference (VI) with Markov Chain Monte Carlo (MCMC). This approach can be used with g…

stat.ML202026 cited

Finite Time Analysis of Linear Two-timescale Stochastic Approximation with Markovian Noise

Maxim Kaledin, Eric Moulines, Alexey Naumov +2

Linear two-timescale stochastic approximation (SA) scheme is an important class of algorithms which has become popular in reinforcement learning (RL), particularly for the policy e…