arXiv subjects

B. M. O. Fraga

Publications and source records attributed to B. M. O. Fraga.

4 recordsLinked to original sources

arXiv2024

Transient Classifiers for Fink: Benchmarks for LSST

The upcoming Legacy Survey of Space and Time (LSST) is expected to detect a few million transients per night, which will generate a live alert stream during the entire ten years of the survey. This stream will be distributed via community brokers whose task is to select subsets of the stream and direct them to scientific communities. Given the volume and complexity of the anticipated data, machine learning algorithms will be paramount for this task. We present the infrastructure tests and classification methods developed within the Fink broker in preparation for LSST. This work aims to provide detailed information regarding the underlying assumptions and methods behind each classifier and enable users to make informed follow-up decisions from Fink photometric classifications. Using simulated data from ELAsTiCC, we showcase the performance of binary and multi-class ML classifiers available in Fink. These include tree-based classifiers coupled with tailored feature extraction strategies as well as deep learning algorithms. Moreover, we introduce CATS, a deep learning architecture specifically designed for this task. Our results show that Fink classifiers are able to handle the extra complexity that is expected from LSST data. CATS achieved $\geq 93\%$ precision for all classes except `long' (for which it achieved $\sim 83\%$), while our best performing binary classifier achieves $\geq 98\%$ precision and $\geq 99\%$ completeness when classifying the periodic class. ELAsTiCC was an important milestone in preparing the Fink infrastructure to deal with LSST-like data. Our results demonstrate that Fink classifiers are well prepared for the arrival of the new stream, but this work also highlights that transitioning from the current infrastructures to Rubin will require significant adaptation of the currently available tools. This work was the first step in the right direction.

astro-ph.IM↗

arXiv2024

Photometric Redshifts Probability Density Estimation from Recurrent Neural Networks in the DECam Local Volume Exploration Survey Data Release 2

Photometric wide-field surveys are imaging the sky in unprecedented detail. These surveys face a significant challenge in efficiently estimating galactic photometric redshifts while accurately quantifying associated uncertainties. In this work, we address this challenge by exploring the estimation of Probability Density Functions (PDFs) for the photometric redshifts of galaxies across a vast area of 17,000 square degrees, encompassing objects with a median 5$σ$ point-source depth of $g$ = 24.3, $r$ = 23.9, $i$ = 23.5, and $z$ = 22.8 mag. Our approach uses deep learning, specifically integrating a Recurrent Neural Network architecture with a Mixture Density Network, to leverage magnitudes and colors as input features for constructing photometric redshift PDFs across the whole DECam Local Volume Exploration (DELVE) survey sky footprint. Subsequently, we rigorously evaluate the reliability and robustness of our estimation methodology, gauging its performance against other well-established machine learning methods to ensure the quality of our redshift estimations. Our best results constrain photometric redshifts with the bias of $-0.0013$, a scatter of $0.0293$, and an outlier fraction of $5.1\%$. These point estimates are accompanied by well-calibrated PDFs evaluated using diagnostic tools such as Probability Integral Transform and Odds distribution. We also address the problem of the accessibility of PDFs in terms of disk space storage and the time demand required to generate their corresponding parameters. We present a novel Autoencoder model that reduces the size of PDF parameter arrays to one-sixth of their original length, significantly decreasing the time required for PDF generation to one-eighth of the time needed when generating PDFs directly from the magnitudes.

astro-ph.IM↗

arXiv2023

Designing an Optimal Kilonova Search using DECam for Gravitational Wave Events

We address the problem of optimally identifying all kilonovae detected via gravitational wave emission in the upcoming LIGO/Virgo/KAGRA Collaboration observing run, O4, which is expected to be sensitive to a factor of $\sim 7$ more Binary Neutron Stars alerts than previously. Electromagnetic follow-up of all but the brightest of these new events will require $>1$ meter telescopes, for which limited time is available. We present an optimized observing strategy for the Dark Energy Camera during O4. We base our study on simulations of gravitational wave events expected for O4 and wide-prior kilonova simulations. We derive the detectabilities of events for realistic observing conditions. We optimize our strategy for confirming a kilonova while minimizing telescope time. For a wide range of kilonova parameters, corresponding to a fainter kilonova compared to GW170817/AT2017gfo we find that, with this optimal strategy, the discovery probability for electromagnetic counterparts with the Dark Energy Camera is $\sim 80\%$ at the nominal binary neutron star gravitational wave detection limit for the next LVK observing run (190 Mpc), which corresponds to a $\sim 30\%$ improvement compared to the strategy adopted during the previous observing run. For more distant events ($\sim 330$ Mpc), we reach a $\sim 60\%$ probability of detection, a factor of $\sim 2$ increase. For a brighter kilonova model dominated by the blue component that reproduces the observations of GW170817/AT2017gfo, we find that we can reach $\sim 90\%$ probability of detection out to 330 Mpc, representing an increase of $\sim 20 \%$, while also reducing the total telescope time required to follow-up events by $\sim 20\%$.

astro-ph.HE↗

arXiv2022

Developing a Victorious Strategy to the Second Strong Gravitational Lensing Data Challenge

Strong Lensing is a powerful probe of the matter distribution in galaxies and clusters and a relevant tool for cosmography. Analyses of strong gravitational lenses with Deep Learning have become a popular approach due to these astronomical objects' rarity and image complexity. Next-generation surveys will provide more opportunities to derive science from these objects and an increasing data volume to be analyzed. However, finding strong lenses is challenging, as their number densities are orders of magnitude below those of galaxies. Therefore, specific Strong Lensing search algorithms are required to discover the highest number of systems possible with high purity and low false alarm rate. The need for better algorithms has prompted the development of an open community data science competition named Strong Gravitational Lensing Challenge (SGLC). This work presents the Deep Learning strategies and methodology used to design the highest-scoring algorithm in the II SGLC. We discuss the approach used for this dataset, the choice for a suitable architecture, particularly the use of a network with two branches to work with images in different resolutions, and its optimization. We also discuss the detectability limit, the lessons learned, and prospects for defining a tailor-made architecture in a survey in contrast to a general one. Finally, we release the models and discuss the best choice to easily adapt the model to a dataset representing a survey with a different instrument. This work helps to take a step towards efficient, adaptable and accurate analyses of strong lenses with deep learning frameworks.

astro-ph.GA↗