activity
20162026
most citedSampling from a log-concave distribution with compact support with proximal Langevin Monte Carlo

19 citations · 79 across the 28 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

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

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

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

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…