SimBIG: Field-level Simulation-Based Inference of Galaxy Clustering

• URL: http://arxiv.org/abs/2310.15256v1
• Date: Mon, 23 Oct 2023 18:05:32 GMT
• Title: SimBIG: Field-level Simulation-Based Inference of Galaxy Clustering
• Authors: Pablo Lemos, Liam Parker, ChangHoon Hahn, Shirley Ho, Michael Eickenberg, Jiamin Hou, Elena Massara, Chirag Modi, Azadeh Moradinezhad Dizgah, Bruno Regaldo-Saint Blancard, David Spergel
• Abstract summary: We present the first simulation-based inference ( SBI) of cosmological parameters from field-level analysis of galaxy clustering. We apply SimBIG to a subset of the BOSS CMASS galaxy sample using a convolutional neural network with weight averaging to perform massive data compression of the galaxy field. This work not only presents competitive cosmological constraints but also introduces novel methods for leveraging additional cosmological information in upcoming galaxy surveys like DESI, PFS, and Euclid.
• Score: 2.3988372195566443
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: We present the first simulation-based inference (SBI) of cosmological parameters from field-level analysis of galaxy clustering. Standard galaxy clustering analyses rely on analyzing summary statistics, such as the power spectrum, $P_\ell$, with analytic models based on perturbation theory. Consequently, they do not fully exploit the non-linear and non-Gaussian features of the galaxy distribution. To address these limitations, we use the {\sc SimBIG} forward modelling framework to perform SBI using normalizing flows. We apply SimBIG to a subset of the BOSS CMASS galaxy sample using a convolutional neural network with stochastic weight averaging to perform massive data compression of the galaxy field. We infer constraints on $\Omega_m = 0.267^{+0.033}_{-0.029}$ and $\sigma_8=0.762^{+0.036}_{-0.035}$. While our constraints on $\Omega_m$ are in-line with standard $P_\ell$ analyses, those on $\sigma_8$ are $2.65\times$ tighter. Our analysis also provides constraints on the Hubble constant $H_0=64.5 \pm 3.8 \ {\rm km / s / Mpc}$ from galaxy clustering alone. This higher constraining power comes from additional non-Gaussian cosmological information, inaccessible with $P_\ell$. We demonstrate the robustness of our analysis by showcasing our ability to infer unbiased cosmological constraints from a series of test simulations that are constructed using different forward models than the one used in our training dataset. This work not only presents competitive cosmological constraints but also introduces novel methods for leveraging additional cosmological information in upcoming galaxy surveys like DESI, PFS, and Euclid.

Related papers

• Learning Galaxy Intrinsic Alignment Correlations [16.805775045014578]
  The intrinsic alignments (IA) of galaxies represent the correlation of galaxy shapes due to gravitational tidal interactions and galaxy formation processes. We present a deep learning approach to emulate galaxy position-position, position-orientation, and orientation-orientation correlation function measurements and uncertainties.
  arXiv  Detail & Related papers  (2024-04-21T16:16:56Z)
• Cosmology from Galaxy Redshift Surveys with PointNet [65.89809800010927]
  In cosmology, galaxy redshift surveys resemble such a permutation invariant collection of positions in space. We employ a textitPointNet-like neural network to regress the values of the cosmological parameters directly from point cloud data. Our implementation of PointNets can analyse inputs of $mathcalO(104) - mathcalO(105)$ galaxies at a time, which improves upon earlier work for this application by roughly two orders of magnitude.
  arXiv  Detail & Related papers  (2022-11-22T15:35:05Z)
• The SZ flux-mass ($Y$-$M$) relation at low halo masses: improvements with symbolic regression and strong constraints on baryonic feedback [2.436653298863297]
  AGN and supernovae feedback can affect measurements of integrated SZ flux of halos from CMB surveys. We search for analogues of the $Y-M$ relation which are more robust to feedback processes for low masses. Our results can be useful for using upcoming SZ surveys to constrain the nature of baryonic feedback.
  arXiv  Detail & Related papers  (2022-09-05T18:00:00Z)
• Learning cosmology and clustering with cosmic graphs [0.0]
  We train deep learning models on thousands of galaxy catalogues from the state-of-the-art hydrodynamic simulations of the CAMELS project. We first show that GNNs can learn to compute the power spectrum of galaxy catalogues with a few percent accuracy. We then train GNNs to perform likelihood-free inference at the galaxy-field level.
  arXiv  Detail & Related papers  (2022-04-28T18:00:02Z)
• DeepLSS: breaking parameter degeneracies in large scale structure with deep learning analysis of combined probes [0.0]
  We show that a deep learning analysis of combined probes of weak gravitational lensing and galaxy clustering, which we call DeepS, can effectively break these degeneracies. These degeneracies lead to a significant gain in constraining power for $sigma_8$ and $Omega_m$, with the figure of merit improved by 15x. These results indicate that the fully numerical, map-based forward modeling approach to cosmological inference with machine learning may play an important role in upcoming LSS surveys.
  arXiv  Detail & Related papers  (2022-03-17T21:08:31Z)
• Satellite galaxy abundance dependency on cosmology in Magneticum simulations [101.18253437732933]
  We build an emulator of satellite abundance based on cosmological parameters. We find that $A$ and $beta$ depend on cosmological parameters, even if weakly. We also show that satellite abundance cosmology dependency differs between full-physics (FP) simulations, dark-matter only (DMO) and non-radiative simulations.
  arXiv  Detail & Related papers  (2021-10-11T18:00:02Z)
• Topological Echoes of Primordial Physics in the Universe at Large Scales [0.0]
  We compute persistence diagrams and derived statistics for simulations of dark matter halos. Our pipeline computes persistence in sub-boxes of full simulations and simulations are subsampled to uniform halo number.
  arXiv  Detail & Related papers  (2020-12-07T12:08:55Z)
• Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity [67.02490430380415]
  We show that model-based MARL achieves a sample complexity of $tilde O(|S||B|(gamma)-3epsilon-2)$ for finding the Nash equilibrium (NE) value up to some $epsilon$ error. We also show that such a sample bound is minimax-optimal (up to logarithmic factors) if the algorithm is reward-agnostic, where the algorithm queries state transition samples without reward knowledge.
  arXiv  Detail & Related papers  (2020-07-15T03:25:24Z)
• The Generalized Lasso with Nonlinear Observations and Generative Priors [63.541900026673055]
  We make the assumption of sub-Gaussian measurements, which is satisfied by a wide range of measurement models. We show that our result can be extended to the uniform recovery guarantee under the assumption of a so-called local embedding property.
  arXiv  Detail & Related papers  (2020-06-22T16:43:35Z)
• Computationally efficient sparse clustering [67.95910835079825]
  We provide a finite sample analysis of a new clustering algorithm based on PCA. We show that it achieves the minimax optimal misclustering rate in the regime $|theta infty$.
  arXiv  Detail & Related papers  (2020-05-21T17:51:30Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.