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 2019Show all

8 papers · 1 filter

math.ST2019

Maximum entropy methods for texture synthesis: theory and practice

Valentin De Bortoli, Agnes Desolneux, Alain Durmus +2

Recent years have seen the rise of convolutional neural network techniques in exemplar-based image synthesis. These methods often rely on the minimization of some variational formu…

stat.ME2019★ 5 cited

Maximum likelihood estimation of regularisation parameters in high-dimensional inverse problems: an empirical Bayesian approach. Part I: Methodology and Experiments

Ana F. Vidal, Valentin De Bortoli, Marcelo Pereyra +1

Many imaging problems require solving an inverse problem that is ill-conditioned or ill-posed. Imaging methods typically address this difficulty by regularising the estimation prob…

stat.CO2019

Approximate Bayesian Computation with the Sliced-Wasserstein Distance

Kimia Nadjahi, Valentin De Bortoli, Alain Durmus +2

Approximate Bayesian Computation (ABC) is a popular method for approximate inference in generative models with intractable but easy-to-sample likelihood. It constructs an approxima…

cs.LG2019★ 9 cited

Markov Decision Process for MOOC users behavioral inference

Firas Jarboui, Célya Gruson-daniel, Pierre Chanial +6

Studies on massive open online courses (MOOCs) users discuss the existence of typical profiles and their impact on the learning process of the students. However defining the typica…

stat.CO2019★ 3 cited

Efficient stochastic optimisation by unadjusted Langevin Monte Carlo. Application to maximum marginal likelihood and empirical Bayesian estimation

Valentin De Bortoli, Alain Durmus, Marcelo Pereyra +1

Stochastic approximation methods play a central role in maximum likelihood estimation problems involving intractable likelihood functions, such as marginal likelihoods arising in p…

stat.ML2019★ 8 cited

Asymptotic Guarantees for Learning Generative Models with the Sliced-Wasserstein Distance

Kimia Nadjahi, Alain Durmus, Umut Şimşekli +1

Minimum expected distance estimation (MEDE) algorithms have been widely used for probabilistic models with intractable likelihood functions and they have become increasingly popula…

math.PR2019★ 17 cited

Convergence of diffusions and their discretizations: from continuous to discrete processes and back

Valentin De Bortoli, Alain Durmus

In this paper, we establish new quantitative convergence bounds for a class of functional autoregressive models in weighted total variation metrics. To derive our results, we show…

stat.ML2019★ 1 cited

Copula-like Variational Inference

Marcel Hirt, Petros Dellaportas, Alain Durmus

This paper considers a new family of variational distributions motivated by Sklar's theorem. This family is based on new copula-like densities on the hypercube with non-uniform mar…