Deep Learning; Machine Learning; Meta Learning; Inference; Likelihood free
Abstract :
[en] Likelihood-free inference is concerned with the estimation of the parameters of
a non-differentiable stochastic simulator that best reproduce real observations.
In the absence of a likelihood function, most of the existing inference methods
optimize the simulator parameters through a handcrafted iterative procedure that
tries to make the simulated data more similar to the observations. In this work,
we explore whether meta-learning can be used in the likelihood-free context, for
learning automatically from data an iterative optimization procedure that would
solve likelihood-free inference problems. We design a recurrent inference machine
that learns a sequence of parameter updates leading to good parameter estimates,
without ever specifying some explicit notion of divergence between the simulated
data and the real data distributions. We demonstrate our approach on toy simulators,
showing promising results both in terms of performance and robustness.
Disciplines :
Computer science
Author, co-author :
Pesah, Arthur
Wehenkel, Antoine ; Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Big Data
Louppe, Gilles ; Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Big Data
Language :
English
Title :
Recurrent machines for likelihood-free inference
Publication date :
08 December 2018
Number of pages :
5 + 4
Event name :
Workshop of Meta-Learning at Thirty-second Conference on Neural Information Processing Systems 2018