A differentiable perturbation-based weak lensing shear estimator

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Upcoming imaging surveys will use weak gravitational lensing to study the large-scale structure of the Universe, demanding sub-per cent accuracy for precise cosmic shear measurements. We present a new differentiable implementation of our perturbation-based shear estimator (FPFS), using JAX, which is publicly available as part of a new suite of analytic shear algorithms called ANACAL. This code can analytically calibrate the shear response of any non-linear observable constructed with the FPFS shapelets and detection modes utilizing autodifferentiation (AD), generalizing the formalism to include a family of shear estimators with corrections for detection and selection biases. Using the AD capability of JAX, it calculates the full Hessian matrix of the nonlinear observables, which improves the previously presented second-order noise bias correction in the shear estimation. As an illustration of the power of the new ANACAL framework, we optimize the effective galaxy number density in the space of the generalized shear estimators using an LSST-like galaxy image simulation for the 10 yr LSST. For the generic shear estimator, the magnitude of the multiplicative bias |m| is below 3 × 10−3 (99.7 per cent confidence interval), and the effective galaxy number density is improved by 5 per cent . We also discuss some planned future additions to the ANACAL software suite to extend its applicability beyond the FPFS measurements.

Cite

CITATION STYLE

APA

Li, X., Mandelbaum, R., Jarvis, M., Li, Y., Park, A., & Zhang, T. (2024). A differentiable perturbation-based weak lensing shear estimator. Monthly Notices of the Royal Astronomical Society, 527(4), 10388–10396. https://doi.org/10.1093/mnras/stad3895

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free