arXiv subjects

Hubert Leterme

Publications and source records attributed to Hubert Leterme.

6 recordsLinked to original sources

arXiv2026

A plug-and-play approach with fast uncertainty quantification for weak lensing mass mapping

Upcoming stage-IV surveys such as Euclid and Rubin will deliver vast amounts of high-precision data, opening new opportunities to constrain cosmological models with unprecedented accuracy. A key step in this process is the reconstruction of the dark matter distribution from noisy weak-lensing shear measurements. Current deep-learning-based mass-mapping methods achieve high reconstruction accuracy, but either require retraining a model for each new observed sky region (limiting practicality) or rely on slow Markov chain Monte Carlo sampling. Efficient exploitation of future survey data therefore calls for a new method that is accurate, flexible, and fast at inference. In addition, an uncertainty quantification with coverage guarantees is essential for a reliable cosmological parameter estimation. We introduce PnPMass, a plug-and-play approach for weak-lensing mass mapping. The algorithm produces point estimates by alternating between a gradient descent step with a carefully chosen data fidelity term and a denoising step implemented with a single deep-learning model trained on simulated data corrupted by Gaussian white noise. We also propose a fast sampling-free uncertainty quantification scheme based on moment networks, with calibrated error bars obtained through conformal prediction to ensure coverage guarantees. Finally, we benchmark PnPMass against model-driven and data-driven mass-mapping techniques. PnPMass achieves a performance close to that of the currently best deep-learning methods while offering fast inference. It converges in just a few iterations, and it requires only a single training phase, regardless of the noise covariance of the observations. It therefore combines flexibility, efficiency, and reconstruction accuracy while delivering tighter error bars than existing approaches, making it well suited for upcoming weak-lensing surveys.

astro-ph.CO↗

arXiv2025

Disentangling Modes and Interference in the Spectrogram of Multicomponent Signals

In this paper, we investigate how the spectrogram of multicomponent signals can be decomposed into a mode part and an interference part. We explore two approaches: (i) a variational method inspired by texture-geometry decomposition in image processing, and (ii) a supervised learning approach using a U-Net architecture, trained on a dataset encompassing diverse interference patterns and noise conditions. Once the interference component is identified, we explain how it enables us to define a criterion to locally adapt the window length used in the definition of the spectrogram, for the sake of improving ridge detection in the presence of close modes. Numerical experiments illustrate the advantages and limitations of both approaches for spectrogram decomposition, highlighting their potential for enhancing time-frequency analysis in the presence of strong interference.

cs.CV↗

arXiv2024

Galaxy-Point Spread Function correlations as a probe of weak-lensing systematics with UNIONS data

Weak gravitational lensing requires precise measurements of galaxy shapes and therefore an accurate knowledge of the PSF model. The latter can be a source of systematics that affect the shear two-point correlation function. A key stake of weak lensing analysis is to forecast the systematics due to the PSF. Correlation functions of galaxies and the PSF, the so-called $\rho$- and $\tau$-statistics, are used to evaluate the level of systematics coming from the PSF model and PSF corrections, and contributing to the two-point correlation function used to perform cosmological inference. Our goal is to introduce a fast and simple method to estimate this level of systematics and assess its agreement with state-of-the-art approaches. We introduce a new way to estimate the covariance matrix of the $\tau$-statistics using analytical expressions. The covariance allows us to estimate parameters directly related to the level of systematics associated with the PSF and provides us with a tool to validate the PSF model used in a weak-lensing analysis. We apply those methods to data from the Ultraviolet Near-Infrared Optical Northern Survey (UNIONS). We show that the semi-analytical covariance yields comparable results than using covariances obtained from simulations or jackknife resampling. It requires less computation time and is therefore well suited for rapid comparison of the systematic level obtained from different catalogs. We also show how one can break degeneracies between parameters with a redefinition of the $\tau$-statistics. The methods developed in this work will be useful tools in the analysis of current weak-lensing data but also of Stage IV surveys such as Euclid, LSST or Roman. They provide fast and accurate diagnostics on PSF systematics that are crucial to understand in the context of cosmic shear studies.

astro-ph.CO↗

arXiv2024

Distribution-free uncertainty quantification for inverse problems: application to weak lensing mass mapping

In inverse problems, distribution-free uncertainty quantification (UQ) aims to obtain error bars with coverage guarantees that are independent of any prior assumptions about the data distribution. In the context of mass mapping, uncertainties could lead to errors that affects our understanding of the underlying mass distribution, or could propagate to cosmological parameter estimation, thereby impacting the precision and reliability of cosmological models. Current surveys, such as Euclid or Rubin, will provide new weak lensing datasets of very high quality. Accurately quantifying uncertainties in mass maps is therefore critical to perform reliable cosmological parameter inference. In this paper, we extend the conformalized quantile regression (CQR) algorithm, initially proposed for scalar regression, to inverse problems. We compare our approach with another distribution-free approach based on risk-controlling prediction sets (RCPS). Both methods are based on a calibration dataset, and offer finite-sample coverage guarantees that are independent of the data distribution. Furthermore, they are applicable to any mass mapping method, including blackbox predictors. In our experiments, we apply UQ on three mass-mapping method: the Kaiser-Squires inversion, iterative Wiener filtering, and the MCALens algorithm. Our experiments reveal that RCPS tends to produce overconservative confidence bounds with small calibration sets, whereas CQR is designed to avoid this issue. Although the expected miscoverage rate is guaranteed to stay below a user-prescribed threshold regardless of the mass mapping method, selecting an appropriate reconstruction algorithm remains crucial for obtaining accurate estimates, especially around peak-like structures, which are particularly important for inferring cosmological parameters. Additionally, the choice of mass mapping method influences the size of the error bars.

astro-ph.CO↗

arXiv2022

From CNNs to Shift-Invariant Twin Models Based on Complex Wavelets

We propose a novel method to increase shift invariance and prediction accuracy in convolutional neural networks. Specifically, we replace the first-layer combination "real-valued convolutions + max pooling" (RMax) by "complex-valued convolutions + modulus" (CMod), which is stable to translations, or shifts. To justify our approach, we claim that CMod and RMax produce comparable outputs when the convolution kernel is band-pass and oriented (Gabor-like filter). In this context, CMod can therefore be considered as a stable alternative to RMax. To enforce this property, we constrain the convolution kernels to adopt such a Gabor-like structure. The corresponding architecture is called mathematical twin, because it employs a well-defined mathematical operator to mimic the behavior of the original, freely-trained model. Our approach achieves superior accuracy on ImageNet and CIFAR-10 classification tasks, compared to prior methods based on low-pass filtering. Arguably, our approach's emphasis on retaining high-frequency details contributes to a better balance between shift invariance and information preservation, resulting in improved performance. Furthermore, it has a lower computational cost and memory footprint than concurrent work, making it a promising solution for practical implementation.

cs.CV↗

arXiv2022

On the Shift Invariance of Max Pooling Feature Maps in Convolutional Neural Networks

This paper focuses on improving the mathematical interpretability of convolutional neural networks (CNNs) in the context of image classification. Specifically, we tackle the instability issue arising in their first layer, which tends to learn parameters that closely resemble oriented band-pass filters when trained on datasets like ImageNet. Subsampled convolutions with such Gabor-like filters are prone to aliasing, causing sensitivity to small input shifts. In this context, we establish conditions under which the max pooling operator approximates a complex modulus, which is nearly shift invariant. We then derive a measure of shift invariance for subsampled convolutions followed by max pooling. In particular, we highlight the crucial role played by the filter's frequency and orientation in achieving stability. We experimentally validate our theory by considering a deterministic feature extractor based on the dual-tree complex wavelet packet transform, a particular case of discrete Gabor-like decomposition.

cs.CV↗