Coverage is not enough: Frequentist tests of simulation-based inference for primordial non-Gaussianity
Authors: Toka Alokda, Cristiano Porciani, Alexander Eggemeier
Abstract: (Abridged) Simulation-based inference (SBI) has emerged as a powerful framework for extracting cosmological information from complex, non-linear data where analytical likelihoods are unavailable. Its reliability is commonly assessed using coverage-based diagnostics under the prior predictive distribution, which probe calibration only in an averaged sense and do not constrain posterior behavior at fixed parameter value, the regime relevant for practical inference. We investigate these limitations in the context of primordial non-Gaussianity, parameterized by $f_\mathrm{NL}$, using simulations of the dark matter halo field. We compare SBI based on contrastive neural ratio estimation (CNRE) with likelihood-based inference (LBI) using the power spectrum, bispectrum, and wavelet scattering transform (WST) coefficients across 1000 realizations. SBI and LBI agree well on posterior means and skewness, while the variance agrees on average but shows weaker realization-by-realization consistency. Larger differences arise in the kurtosis, indicating discrepancies in the posterior tails. These effects are already present for the power spectrum - where the Gaussian likelihood assumed in LBI is best justified - and are most pronounced for the combined power spectrum and bispectrum, where SBI posteriors are often underconfident and can yield weaker constraints than either statistic individually, despite passing coverage tests. WST coefficients further tighten constraints on $f_\mathrm{NL}$, even when restricted to large scales. Our results highlight both the potential of higher-order statistics and the need for validation strategies that probe the posterior shape beyond standard coverage diagnostics.
Explore the paper tree
Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant
Look for similar papers (in beta version)
By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.