Maximal compression of the redshift space galaxy power spectrum and bispectrum
Davide Gualdi, Marc Manera, Benjamin Joachimi, Ofer Lahav

TL;DR
This paper introduces two efficient data compression methods for redshift space galaxy power spectrum and bispectrum analysis, enabling faster cosmological parameter inference with minimal loss of accuracy for future surveys.
Contribution
It presents two novel compression techniques that significantly reduce data dimensionality and computational time while maintaining accurate posterior distributions for cosmological parameters.
Findings
Both methods recover 68% credible regions within 0.7% and 2% of MCMC results.
Compression reduces data size from ~1000 to 7 parameters, speeding up analysis.
Using combined power spectrum and bispectrum improves parameter constraints over power spectrum alone.
Abstract
We explore two methods of compressing the redshift space galaxy power spectrum and bispectrum with respect to a chosen set of cosmological parameters. Both methods involve reducing the dimension of the original data-vector ( e.g. 1000 elements ) to the number of cosmological parameters considered ( e.g. seven ) using the Karhunen-Lo\`eve algorithm. In the first case, we run MCMC sampling on the compressed data-vector in order to recover the one-dimensional (1D) and two-dimensional (2D) posterior distributions. The second option, approximately 2000 times faster, works by orthogonalising the parameter space through diagonalisation of the Fisher information matrix before the compression, obtaining the posterior distributions without the need of MCMC sampling. Using these methods for future spectroscopic redshift surveys like DESI, EUCLID and PFS would drastically reduce the number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
