REVIEW 7 cited by
A Parameter-Masked Mock Data Challenge for Beyond-Two-Point Galaxy Clustering Statistics
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
The last few years have seen the emergence of a wide array of novel techniques for analyzing high-precision data from upcoming galaxy surveys, which aim to extend the statistical analysis of galaxy clustering data beyond the linear regime and the canonical two-point (2pt) statistics. We test and benchmark some of these new techniques in a community data challenge "Beyond-2pt", initiated during the Aspen 2022 Summer Program "Large-Scale Structure Cosmology beyond 2-Point Statistics," whose first round of results we present here. The challenge dataset consists of high-precision mock galaxy catalogs for clustering in real space, redshift space, and on a light cone. Participants in the challenge have developed end-to-end pipelines to analyze mock catalogs and extract unknown ("masked") cosmological parameters of the underlying $\Lambda$CDM models with their methods. The methods represented are density-split clustering, nearest neighbor statistics, BACCO power spectrum emulator, void statistics, LEFTfield field-level inference using effective field theory (EFT), and joint power spectrum and bispectrum analyses using both EFT and simulation-based inference. In this work, we review the results of the challenge, focusing on problems solved, lessons learned, and future research needed to perfect the emerging beyond-2pt approaches. The unbiased parameter recovery demonstrated in this challenge by multiple statistics and the associated modeling and inference frameworks supports the credibility of cosmology constraints from these methods. The challenge data set is publicly available and we welcome future submissions from methods that are not yet represented.
Forward citations
Cited by 7 Pith papers
-
Control variates from Eulerian and Lagrangian perturbation theory: Application to the bispectrum
A shifted, Zeldovich-resummed control variate with tree-level bispectrum reduces N-body matter-bispectrum variance by up to 10^4 at low k, enabling sub-2% precision from a single 1 (Gpc/h)^3 box.
-
Constraining Dynamical Dark Energy from Galaxy Clustering with Simulation-Based Priors
Adding BOSS galaxy clustering with simulation-based priors modeled as Gaussian mixtures shifts the DESI plus CMB plus supernova constraints on dark energy toward a cosmological constant and improves the w0-wa figure o...
-
Cosmological gravity on all scales V: MCMC forecasts combining large scale structure and CMB lensing for binned phenomenological modified gravity
Emulation of binned modified gravity power spectra to <1% accuracy enables MCMC forecasts that constrain μ and η via LSST large-scale structure combined with CMB lensing, with best sensitivity along the lensing combination Σ.
-
Reanalyzing DESI DR1: 4. Percent-Level Cosmological Constraints from Combined Probes and Robust Evidence for the Normal Neutrino Mass Hierarchy
A combined-analysis of DESI galaxy clustering, CMB lensing, BAO, CMB, and supernovae yields percent-level Lambda-CDM parameters, improved dark-energy figure-of-merit, and neutrino-mass bounds that disfavor the inverte...
-
Equivalence of the field-level inference and conventional analyses on large scales
A joint power spectrum, bispectrum and trispectrum analysis achieves the same precision on the density amplitude as field-level inference for halos on large scales.
-
Low-redshift constraints on structure growth from CMB lensing tomography
Low-redshift galaxy clustering and CMB lensing tomography with hybrid effective field theory gives S8=0.79±0.06, consistent with Planck, while data alone prefer Ωm=0.245±0.024.
-
Fisher Score Matching for Simulation-Based Forecasting and Inference
A neural network trained to predict latent parameter scores can approximate the Fisher score and support Fisher forecasting and gradient-based Bayesian inference from simulations.
Discussion (0). Sign in to comment.