Linearized iterative least-squares (LIL): A parameter fitting algorithm for component separation in multifrequency CMB experiments such as Planck
Rishi Khatri

TL;DR
The paper introduces LIL, an efficient, scalable algorithm for component separation in multi-frequency CMB experiments, capable of full-resolution analysis and uncertainty propagation, demonstrated on Planck data.
Contribution
LIL leverages the quasi-linear foreground model to perform fast, full-resolution parameter fitting without resolution degradation, improving efficiency over existing methods.
Findings
LIL fits 6 parameters to 7 Planck channels in under 160 CPU-minutes.
The algorithm scales well to higher resolutions and more frequency channels.
LIL naturally propagates uncertainties and degeneracies in parameter estimates.
Abstract
We present an efficient algorithm for the least squares parameter fitting optimized for component separation in multi-frequency CMB experiments. We sidestep some of the problems associated with non-linear optimization by taking advantage of the quasi-linear nature of the foreground model. We demonstrate our algorithm, linearized iterative least-squares (LIL), on the publicly available Planck sky model FFP6 simulations and compare our result with the other algorithms. We work at full Planck resolution and show that degrading the resolution of all channels to that of the lowest frequency channel is not necessary. Finally we present results for the publicly available Planck data. Our algorithm is extremely fast, fitting 6 parameters to 7 lowest Planck channels at full resolution (50 million pixels) in less than 160 CPU-minutes (or few minutes running in parallel on few tens of cores). LIL…
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.
