A guide to choosing data compression methods for cosmological inference

RESUMO

We provide a pedagogical guide to help researchers choose an appropriate compression method for cosmological inference and numerical covariance estimation, trading off the balance between information loss and complexity. We describe methods used in the literature, categorising them by the form of the loss function -- Fisher information, mutual information, or mean squared error -- and by whether they are linear or non-linear. We consider in detail the linear compression methods: massively optimised parameter estimation and data compression (MOPED), canonical correlation analysis (CCA), principal component analysis, and linear neural networks. We also investigate simple non-linear methods based on neural networks with similar architectures but different loss functions. We use tomographic weak lensing power spectra as example data vectors, deriving constraints on the cosmological parameters $\Omega_\mathrm{m}$, $\sigma_8$, $w_0$ and $w_a$ from compressed data. For our figure of merit (FoM) we use the log determinant of the Fisher matrix, which approximates the covariance of the full posterior well. MOPED and a Fisher information-based linear neural network both achieve lossless compression. Neural networks with loss functions which optimise mutual information achieve at most 84 per cent of the uncompressed FoM and those which minimise mean squared errors achieve at most 72 per cent. We show how to determine whether MOPED will retain information even if the fiducial cosmology is not known with certainty, and demonstrate a strategy for CCA which results in an FoM close to that of MOPED while requiring only an approximate idea of where the bulk of the posterior mass is located.