Extreme data compression for the CMB
Alan Zablocki, Scott Dodelson

TL;DR
This paper introduces a fast, data compression technique using Karhunen-Loève methods to efficiently analyze CMB data and estimate cosmological parameters, significantly reducing computation time.
Contribution
The authors develop a novel linear combination approach for CMB data that preserves Fisher matrix properties, enabling rapid likelihood evaluations and parameter inference.
Findings
Method accurately recovers input cosmology from simulated data.
Applied successfully to WMAP seven-year data set.
Achieves parameter estimation in under a minute.
Abstract
We apply the Karhunen-Lo\'eve methods to cosmic microwave background (CMB) data sets, and show that we can recover the input cosmology and obtain the marginalized likelihoods in cold dark matter cosmologies in under a minute, much faster than Markov chain Monte Carlo methods. This is achieved by forming a linear combination of the power spectra at each multipole , and solving a system of simultaneous equations such that the Fisher matrix is locally unchanged. Instead of carrying out a full likelihood evaluation over the whole parameter space, we need evaluate the likelihood only for the parameter of interest, with the data compression effectively marginalizing over all other parameters. The weighting vectors contain insight about the physical effects of the parameters on the CMB anisotropy power spectrum . The shape and amplitude of these vectors give an intuitive feel…
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.
