Fetching the paper…
Reading the bibliography…
Likelihood-free inference involves inferring parameter values given observed data and a simulator model.
The theory of queues with a single server
Lindley, D. V. (1952) · 1952
Earlier work this paper cites.
On random graphs
Erdős, P. and Rényi, A. (1959) · 1959
Earlier work this paper cites.
Bayesian statistics without tears: a sampling–resampling perspective
Smith, A. F. M. and Gelfand, A. E. (1992) · 1992
Earlier work this paper cites.
Metropolized independent sampling with comparisons to rejection sampling and importance sampling
Liu, J. S. (1996) · 1996
Earlier work this paper cites.
Estimation for an M/G/ ∞ \infty queue with incomplete information
Pickands, III, J. and Stine, R. A. (1997) · 1997
Earlier work this paper cites.
The cross-entropy method for combinatorial and continuous optimization
Rubinstein, R. (1999) · 1999
Earlier work this paper cites.
Estimation of distribution algorithms: A new tool for evolutionary computation
Larrañaga, P. and Lozano, J. A. (2002) · 2002
Earlier work this paper cites.
Information theory, inference and learning algorithms
MacKay, D. J. C. (2003) · 2003
Earlier work this paper cites.
Truncated importance sampling
Ionides, E. L. (2008) · 2008
Earlier work this paper cites.
Correction: Sequential Monte Carlo without likelihoods
Sisson, S. A., Fan, Y., and Tanaka, M. M. (2009) · 2009
Earlier work this paper cites.
Approximate Bayesian computation scheme for parameter inference and model selection in dynamical systems
Toni, T., Welch, D., Strelkowa, N., Ipsen, A., and Stumpf, M. (2009) · 2009
Earlier work this paper cites.
Adaptive multiple importance sampling
Cornuet, J.-M., Marin, J.-M., Mira, A., and Robert, C. P. (2012) · 2012
Earlier work this paper cites.
An adaptive sequential Monte Carlo method for approximate Bayesian computation
Del Moral, P., Doucet, A., and Jasra, A. (2012) · 2012
Earlier work this paper cites.
Approximate Bayesian computational methods
Marin, J.-M., Pudlo, P., Robert, C. P., and Ryder, R. J. (2012) · 2012
Earlier work this paper cites.
On the difficulty of training recurrent neural networks
Pascanu, R., Mikolov, T., and Bengio, Y. (2013) · 2013
Earlier work this paper cites.
Monte Carlo statistical methods
Robert, C. P. and Casella, G. (2013) · 2013
Earlier work this paper cites.
Approximate Bayesian computation (ABC) gives exact results under the assumption of model error
Wilkinson, R. D. (2013) · 2013
Earlier work this paper cites.
Bornschein, J. and Bengio, Y. (2014) · 2014
Earlier work this paper cites.
On Bayesian inference for the M/G/1 queue with efficient MCMC sampling
Shestopaloff, A. Y. and Neal, R. M. (2014) · 2014
Earlier work this paper cites.
MADE: Masked autoencoder for distribution estimation
Germain, M., Gregor, K., Murray, I., and Larochelle, H. (2015) · 2015
Cited alongside, same era.
Adam: A method for stochastic optimization
Kingma, D. P. and Ba, J. (2015) · 2015
Cited alongside, same era.
Optimization Monte Carlo: Efficient and embarrassingly parallel likelihood-free inference
Meeds, T. and Welling, M. (2015) · 2015
Cited alongside, same era.
Density estimation using real NVP
Dinh, L., Sohl-Dickstein, J., and Bengio, S. (2016) · 2016
Cited alongside, same era.
Fast ε \varepsilon -free inference of simulation models with Bayesian conditional density estimation
Papamakarios, G. and Murray, I. (2016) · 2016
Cited alongside, same era.
Simulation and the Monte Carlo method
Neural spline flows
Durkan, C., Bekasov, A., Murray, I., and Papamakarios, G. (2019) · 2019
Closest in time.
A review of approximate Bayesian computation methods via density estimation: Inference for simulator-models
Grazian, C. and Fan, Y. (2019) · 2019
Closest in time.
Neural importance sampling
Müller, T., Mcwilliams, B., Rousselle, F., Gross, M., and Novák, J. (2019) · 2019
Closest in time.
Autoregressive energy machines
Nash, C. and Durkan, C. (2019) · 2019
Closest in time.
Sequential neural likelihood: Fast likelihood-free inference with autoregressive flows
Papamakarios, G., Sterratt, D., and Murray, I. (2019) · 2019
Closest in time.
Pytorch: An imperative style, high-performance deep learning library
Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., et al. (2019) · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Rubinstein, R. Y. and Kroese, D. P. (2016) · 2016
Cited alongside, same era.
An overview of gradient descent optimization algorithms
Ruder, S. (2016) · 2016
Cited alongside, same era.
Importance sampling: Intrinsic dimension and computational cost
Agapiou, S., Papaspiliopoulos, O., Sanz-Alonso, D., and Stuart, A. M. (2017) · 2017
Cited alongside, same era.
Variational inference via χ \chi upper bound minimization
Dieng, A. B., Tran, D., Ranganath, R., Paisley, J., and Blei, D. (2017) · 2017
Cited alongside, same era.
Asymptotically exact inference in differentiable generative models
Graham, M. M. and Storkey, A. J. (2017) · 2017
Cited alongside, same era.
Inference compilation and universal probabilistic programming
Le, T. A., Baydin, A. G., and Wood, F. (2017) · 2017
Cited alongside, same era.
Approximate inference with amortised MCMC
Li, Y., Turner, R. E., and Liu, Q. (2017) · 2017
Cited alongside, same era.
Transport map accelerated adaptive importance sampling, and application to inverse problems arising from multiscale stochastic reaction networks
Cotter, S. L., Kevrekidis, I. G., and Russell, P. (2020) · 2020
Closest in time.
Practical posterior error bounds from variational objectives
Huggins, J. H., Kasprzak, M., Campbell, T., and Broderick, T. (2020) · 2020
Closest in time.
Robust optimisation Monte Carlo
Ikonomov, B. and Gutmann, M. U. (2020) · 2020
Closest in time.
Monte Carlo gradient estimation in machine learning
Mohamed, S., Rosca, M., Figurnov, M., and Mnih, A. (2020) · 2020
Closest in time.
Annealed flow transport Monte Carlo
Arbel, M., Matthews, A., and Doucet, A. (2021) · 2021
Closest in time.
Transport Monte Carlo: high-accuracy posterior approximation via random transport
Duan, L. L. (2021) · 2021
Closest in time.
Variational refinement for importance sampling using the forward Kullback-Leibler divergence
Jerfel, G., Wang, S., Fannjiang, C., Heller, K. A., Ma, Y., and Jordan, M. I. (2021) · 2021
Closest in time.
Markovian score climbing: Variational inference with K L ( p | | q ) KL(p||q)
Naesseth, C. A., Lindsten, F., and Blei, D. (2021) · 2021
Closest in time.
Normalizing flows for probabilistic modeling and inference
Papamakarios, G., Nalisnick, E., Rezende, D. J., Mohamed, S., and Lakshminarayanan, B. (2021) · 2021
Closest in time.
Rethinking the effective sample size
Elvira, V., Martino, L., and Robert, C. P. (2022) · 2022
Closest in time.
Parallel tempering with a variational reference
Surjanovic, N., Syed, S., Bouchard-Côté, A., and Campbell, T. (2022) · 2022
Closest in time.
Adaptive approximate Bayesian computation
Beaumont, M. A., Cornuet, J.-M., Marin, J.-M., and Robert, C. P. (2009) · 2035
Closest in time.