Papers › Uncertainty-aware and Data-efficient Cosmological Emulation using Gaussian Processes and PCA
Uncertainty-aware and Data-efficient Cosmological Emulation using Gaussian Processes and PCA
Sven Günther
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Bayesian parameter inference is one of the key elements for model selection in cosmological research. However, the available inference tools require a large number of calls to simulation codes which can lead to high and sometimes even infeasible computational costs. In this work we propose a new way of emulating simulation codes for Bayesian parameter inference. In particular, this novel approach emphasizes the uncertainty-awareness of the emulator, which allows to state the emulation accuracy and ensures reliable performance. With a focus on data efficiency, we implement an active learning algorithm based on a combination of Gaussian Processes and Principal Component Analysis. We find that for an MCMC analysis of Planck and BAO data on the ΛCDM model (6 model and 21 nuisance parameters) we can reduce the number of simulation calls by a factor of ∼500 and save about 96% of the computational costs.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections