REVIEW 2 cited by
Cosmology from Galaxy Redshift Surveys with PointNet
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
In recent years, deep learning approaches have achieved state-of-the-art results in the analysis of point cloud data. In cosmology, galaxy redshift surveys resemble such a permutation invariant collection of positions in space. These surveys have so far mostly been analysed with two-point statistics, such as power spectra and correlation functions. The usage of these summary statistics is best justified on large scales, where the density field is linear and Gaussian. However, in light of the increased precision expected from upcoming surveys, the analysis of -- intrinsically non-Gaussian -- small angular separations represents an appealing avenue to better constrain cosmological parameters. In this work, we aim to improve upon two-point statistics by employing a \textit{PointNet}-like neural network to regress the values of the cosmological parameters directly from point cloud data. Our implementation of PointNets can analyse inputs of $\mathcal{O}(10^4) - \mathcal{O}(10^5)$ galaxies at a time, which improves upon earlier work for this application by roughly two orders of magnitude. Additionally, we demonstrate the ability to analyse galaxy redshift survey data on the lightcone, as opposed to previously static simulation boxes at a given fixed redshift.
Forward citations
Cited by 2 Pith papers
-
Simulation-Based Inference for Cluster Cosmology with Set-Based Neural Network Architectures
SBI framework with GNN-on-sets and masked autoregressive flow recovers input cosmologies from eRASS1 mocks at 11.5% precision on Ω_m and 4.4% on σ_8 using 3259 clusters.
-
Learning Cosmology from Nearest Neighbour Statistics
Nearest-neighbour distance maps, combined with kNN-CDFs in a hybrid neural network, constrain Ωm and σ8 from Quijote halos with R2=0.80 and 0.93, matching or beating point-cloud methods at a fraction of the compute.
Discussion (0). Sign in to comment.