Nuisance hardened data compression for fast likelihood-free inference

By Justin Alsing, Benjamin Dan Wandelt. 2019

76 citations recorded by the source corpus.

We show how nuisance parameter marginalized posteriors can be inferred directly from simulations in a likelihood-free setting, without having to jointly infer the higher dimensional interesting and nuisance parameter posterior first and marginalize a posteriori. The result is that for an inference task with a given number of interesting parameters, the number of simulations required to perform likelihood-free inference can be kept (roughly) the same irrespective of the number of additional nuisances to be marginalized over. To achieve this, we introduce two extensions to the standard likelihood-free inference set-up. First, we show how nuisance parameters can be recast as latent variables and hence automatically marginalized over in the likelihood-free framework. Secondly, we derive an asymptotically optimal compression from N data to n summaries – one per interesting parameter - such that the Fisher information is (asymptotically) preserved, but the summaries are insensitive to the nuisance parameters. This means that the nuisance marginalized inference task involves learning n interesting parameters from n ‘nuisance hardened’ data summaries, regardless of the presence or number of additional nuisance parameters to be marginalized over. We validate our approach on two examples from cosmology: supernovae and weak-lensing data analyses with nuisance parametrized systematics. For the supernova problem, high-fidelity posterior inference of Ωm and w0 (marginalized over systematics) can be obtained from just a few hundred data simulations. For the weak-lensing problem, six cosmological parameters can be inferred from just $\mathcal {O}(10^3)$ simulations, irrespective of whether 10 additional nuisance parameters are included in the problem or not.

Subfields: Artificial Intelligence, Statistics and Probability, Probabilistic & Bayesian Methods

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Gilles Louppe
  2. J. Brehmer
  3. Kyle Cranmer
  4. Joeri Hermans
  5. Juan Pavez
  6. Sergey I. Nikolenko
  7. Volodimir Begy
  8. Cms Collaboration

In Statistics and Probability

  1. J. Brehmer
  2. Kyle Cranmer
  3. Gilles Louppe
  4. Atlas Collaboration
  5. Cms Collaboration

In Probabilistic & Bayesian Methods

  1. J. Brehmer
  2. Gilles Louppe
  3. Kyle Cranmer
  4. Joeri Hermans
  5. Juan Pavez
  6. Volodimir Begy
  7. Sergey I. Nikolenko
  8. George Papamakarios

Citations in the corpus