mlsanityData to 7 Oct 2026

Ensemble Inference Methods for Models With Noisy and Expensive Likelihoods

arXiv 2104.03384 ↗First posted 7 Apr 2021math.NA cs.NA stat.MLcited by 8

Not on the map. Why?

Abstract (arXiv)

The increasing availability of data presents an opportunity to calibrate unknown parameters which appear in complex models of phenomena in the biomedical, physical and social sciences. However, model complexity often leads to parameter-to-data maps which are expensive to evaluate and are only available through noisy approximations. This paper is concerned with the use of interacting particle systems for the solution of the resulting inverse problems for parameters. Of particular interest is the case where the available forward model evaluations are subject to rapid fluctuations, in parameter space, superimposed on the smoothly varying large scale parametric structure of interest. {A motivating example from climate science is presented, and ensemble Kalman methods (which do not use the derivative of the parameter-to-data map) are shown, empirically, to perform well. Multiscale analysis is then used to analyze the behaviour of interacting particle system algorithms when rapid fluctuations, which we refer to as noise, pollute the large scale parametric dependence of the parameter-to-data map. Ensemble Kalman methods and Langevin-based methods} (the latter use the derivative of the parameter-to-data map) are compared in this light. The ensemble Kalman methods are shown to behave favourably in the presence of noise in the parameter-to-data map, whereas Langevin methods are adversely affected. On the other hand, Langevin methods have the correct equilibrium distribution in the setting of noise-free forward models, whilst ensemble Kalman methods only provide an uncontrolled approximation, except in the linear case. Therefore a new class of algorithms, ensemble Gaussian process samplers, which combine the benefits of both ensemble Kalman and Langevin methods, are introduced and shown to perform favourably.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 12 of its 92 references that are in the map. First posted on arXiv 7 Apr 2021.

Builds on

12 of 92 references.

References · 12

  1. 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 498
  2. 2020Interacting particle solutions of Fokker-Planck equations through gradient-log-density estimationcited by 87
  3. 2019On the geometry of Stein variational gradient descentcited by 82
  4. 2018Comparing Dynamics: Deep Neural Networks versus Glassy Systemscited by 42
  5. 2018Ensemble Kalman Inversion: A Derivative-Free Technique For Machine Learning Taskscited by 36
  6. 2018Scaling limit of the Stein variational gradient descent: the mean field regimecited by 35
  7. 2017Deep Relaxation: partial differential equations for optimizing deep neural networkscited by 27
  8. 2017The prior can generally only be understood in the context of the likelihoodcited by 18
  9. 2016Ensemble preconditioning for Markov chain Monte Carlo simulationcited by 16
  10. 2015Gradient-free Hamiltonian Monte Carlo with Efficient Kernel Exponential Familiescited by 15
  11. 2019Ensemble Kalman Methods With Constraintscited by 6
  12. 2018Bayeslands: A Bayesian inference approach for parameter uncertainty quantification in Badlandscited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 2; 2025: 1; 2026: 1.

8 papers.