Nuisance hardened data compression for fast likelihood-free inference
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Weak Lensing for Precision Cosmology
Mandelbaum, R. (2018) · Annual Review of Astronomy and Astrophysics · doi:10.1146/annurev-astro-081817-051928 · Cited by 409 · cited 2×
“…alignments (Joachimi et al. 2015), shape and photo-z measurement systematics (Massey et al. 2012; Mandelbaum 2018; Salvato et al. 2018), blending (Mandelbaum 2018), reduced shear corrections (Krause & Hirata 2010), redshift-dependent galaxy-property distributions (Kannawadi et al. 2018),…”
BackgroundThe many flavours of photometric redshifts
Salvato, M., Ilbert, O., & Hoyle, B. (2018) · Nature Astronomy · doi:10.1038/s41550-018-0478-0 · Cited by 234
Non-Gaussian information from weak lensing data via deep learning
Gupta, A., Matilla, J. M. Z., Hsu, D., & Haiman, Z. (2018) · Physical Review D · doi:10.1103/physrevd.97.103515 · Cited by 128 · cited 1×
“An emerging trend in cosmology is to find efficient parameter estimators from complex datasets by training deep neural networks to regress cosmological parameters from simulated data (Ravanbakhsh et al. 2016; Schmelzle et al. 2017; Gupta et al. 2018; Ribli et al. 2018; Fluri et al. 2018a).”
BackgroundCosmological constraints from noisy convergence maps through deep learning
Fluri, J., Kacprzak, T., Refregier, A., Amara, A., Lucchi, A., & Hofmann, T. (2018) · Physical Review D · doi:10.1103/physrevd.98.123518 · Cited by 83 · cited 2×
“An emerging trend in cosmology is to find efficient parameter estimators from complex datasets by training deep neural networks to regress cosmological parameters from simulated data (Ravanbakhsh et al. 2016; Schmelzle et al. 2017; Gupta et al. 2018; Ribli et al. 2018; Fluri et al. 2018a).”
Background
Cited by
Machine learning and the physical sciences
Carleo, G., Cirac, I., Cranmer, K., Daudet, L., Schuld, M., Tishby, N., Vogt-Maranto, L., & Zdeborová, L. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.045002 · Cited by 2,417
The frontier of simulation-based inference
Cranmer, K., Brehmer, J., & Louppe, G. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1912789117 · Cited by 1,032
Villaescusa-Navarro, F., Hahn, C., Massara, E., Banerjee, A., Delgado, A. M., Ramanah, D. K., Charnock, T., Giusarma, E., Li, Y., Allys, E., et al. (2020) · The Astrophysical Journal Supplement Series · doi:10.3847/1538-4365/ab9d82 · Cited by 336
Self-citationThe CAMELS Project: Cosmology and Astrophysics with Machine-learning Simulations
Villaescusa-Navarro, F., Anglés-Alcázar, D., Genel, S., Spergel, D. N., S. Somerville, R., Dave, R., Pillepich, A., Hernquist, L., Nelson, D., Torrey, P., et al. (2021) · The Astrophysical Journal · doi:10.3847/1538-4357/abf7ba · Cited by 304
Mining gold from implicit models to improve likelihood-free inference
Brehmer, J., Louppe, G., Pavez, J., & Cranmer, K. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1915980117 · Cited by 159
Cosmological constraints with deep learning from KiDS-450 weak lensing maps
Fluri, J., Kacprzak, T., Lucchi, A., Refregier, A., Amara, A., Hofmann, T., & Schneider, A. (2019) · Physical Review D · doi:10.1103/physrevd.100.063514 · Cited by 151
Likelihood-free inference with neural compression of DES SV weak lensing map statistics
Jeffrey, N., Alsing, J., & Lanusse, F. (2020) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/staa3594 · Cited by 123
Self-citationThe Dawes Review 10: The impact of deep learning for the analysis of galaxy surveys
Huertas-Company, M., & Lanusse, F. (2023) · Publications of the Astronomical Society of Australia · doi:10.1017/pasa.2022.55 · Cited by 102
Brehmer, J., Mishra-Sharma, S., Hermans, J., Louppe, G., & Cranmer, K. (2019) · The Astrophysical Journal · doi:10.3847/1538-4357/ab4c41 · Cited by 80
Super-resolution emulator of cosmological simulations using deep physical models
Kodi Ramanah, D., Charnock, T., Villaescusa-Navarro, F., & Wandelt, B. D. (2020) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/staa1428 · Cited by 70
“…HR simulations emulated from the same LR field, but different initial conditions, the network will learn to ignore the small-scale fluctuations and produce summaries that are robust to small-scale non-linearities (analogous to the nuisance-hardened summaries in Alsing & Wandelt 2019).”
BackgroundSelf-citationTranslation and rotation equivariant normalizing flow (TRENF) for optimal cosmological analysis
Dai, B., & Seljak, U. (2022) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stac2010 · Cited by 48
Simulation-based inference of dynamical galaxy cluster masses with 3D convolutional neural networks
Kodi Ramanah, D., Wojtak, R., & Arendse, N. (2021) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/staa3922 · Cited by 31
Metadata
- Authors
- Alsing, J., & Wandelt, B.
- Venue
- Monthly Notices of the Royal Astronomical Society
- Publisher
- Oxford University Press (OUP)
- Published
- 2019-07-10
- Volume
- 488
- Issue
- 4
- Pages
- 5093-5103
- ISSN
- 0035-8711 (ISSN-L)
- 1365-2966
- OpenAlex
- W2919751573
- Cited by
- 116
- References
- 5
- FWCI
- 11.43
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.