YGYash Gondhalekar

Yash Gondhalekar

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yash Gondhalekar has a total of 180 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Deconvolution for Large Astronomical Surveys: A Study of the Scaled Gradient Projection Method on Zwicky Transient Facility Data

    by Yash Gondhalekar, Richard M. Feder, Matthew J. Graham, Ajit K. Kembhavi, Margarita Safonova, Snehanshu Saha, Ashish A. Mahabal

    Ground-based astronomical observations will continue to produce resolution-limited images due to atmospheric seeing. Deconvolution reverses such effects and thus can benefit extracted science in multifaceted ways. We apply the Scaled Gradient Projection algorithm for the single-band deconvolution of several observed images from the Zwicky Transient Facility and mainly discuss the performance on stellar sources. The method shows good photometric flux preservation, which deteriorates for fainter sources but significantly reduces flux uncertainties even for the faintest sources. Deconvolved sources have a well-defined Full-Width-at-Half-Maximum of roughly one pixel (one arcsecond for ZTF) regardless of the observed seeing. Detection after deconvolution results in catalogs with ≳99.6% completeness relative to detections in the observed images. A few observed sources that could not be detected in the deconvolved image are found near saturated sources, whereas for others, the deconvolved counterparts are detected when slightly different detection parameters are used. The deconvolution reveals new faint sources previously undetectable, which are confirmed by crossmatching with the deeper DESI Legacy DR10 and with Pan-STARRS1 through forced photometry. The method could identify examples of serendipitous potential deblends that exceeded SExtractor’s deblending capabilities, with as extreme as Δ m ≈ 3 and separations as small as one arcsecond between the deblended components. Our survey-agnostic approach is better and eight times faster than Richardson–Lucy deconvolution and could be a reliable method for incorporation into survey pipelines.

  • Open Access

    Emulation of f(R) modified gravity from ΛCDM using conditional GANs

    by Yash Gondhalekar, Sownak Bose, Baojiu Li, Carolina Cuesta-Lazaro

    A major aim of cosmological surveys is to test deviations from the standard $\Lambda$CDM model, but the full scientific value of these surveys will only be realized through efficient simulation methods that keep up with the increasing volume and precision of observational data. N-body simulations of modified gravity (MG) theories are computationally expensive since highly non-linear equations must be solved. This represents a significant bottleneck in the path to reach the data volume and resolution attained by equivalent $\Lambda$CDM simulations. We develop a field-level neural network-based emulator that generates density and velocity divergence fields under the $f(R)$ gravity MG model from the corresponding $\Lambda$CDM simulated fields. Using attention mechanisms and a complementary frequency-based loss function, our model is able to learn this intricate mapping. We use the idea of latent space extrapolation to generalize our emulator to $f(R)$ models with differing field strengths. The predictions of our emulator agree with the $f(R)$ simulations to within 5 per cent for matter density and to within 10 per cent for velocity divergence power spectra up to $k \sim 2\, h$$\mathrm{Mpc}^{-1}$. But for a few select cases, higher order statistics are reproduced with $\lesssim$10 per cent agreement. Latent extrapolation allows our emulator to generalize to different parametrizations of the $f(R)$ model without explicitly training on those variants. Given a $\Lambda$CDM simulation, the GPU-based emulator can reproduce the equivalent $f(R)$ realization $\sim$600 times faster than full N-body simulations. This lays the foundations for a valuable tool for realistic yet rapid mock field generation and robust cosmological analyses.


  • Open Access

    Emulation of $f(R)$ modified gravity from $Λ$CDM using conditional GANs

    by Yash Gondhalekar, Sownak Bose, Baojiu Li, Carolina Cuesta-Lazaro

    A major aim of current and upcoming cosmological surveys is testing deviations from the standard $\Lambda$CDM model, but the full scientific value of these surveys will only be realised through efficient simulation methods that keep up with the increasing volume and precision of observational data. $N$-body simulations of modified gravity (MG) theories are computationally expensive since highly non-linear equations need to be solved to model the non-linear matter evolution; this represents a significant bottleneck in the path to reach the data volume and resolution attained by equivalent $\Lambda$CDM simulations. We develop a field-level, neural-network-based emulator that generates density and velocity divergence fields under the $f(R)$ gravity MG model from the corresponding $\Lambda$CDM simulated fields. Using attention mechanisms and a complementary frequency-based loss function, our model is able to learn this intricate mapping. We further use the idea of latent space extrapolation to generalise our emulator to $f(R)$ models with differing field strengths. The predictions of our emulator agree with the $f(R)$ simulations to within 5% for matter density and to within 10% for velocity divergence power spectra up to $k \sim 2\,h$ $\mathrm{Mpc}^{-1}$. But for a few select cases, higher-order statistics are reproduced with $\lesssim$10% agreement with the $f(R)$ simulations. Latent extrapolation allows our emulator to generalise to different $f(R)$ model variants without explicitly training on those variants. Given a $\Lambda$CDM simulation, the GPU-based emulator is able to reproduce the equivalent $f(R)$ realisation $\sim$600 times faster than full $N$-body simulations. This lays the foundations for a valuable tool for realistic yet rapid mock field generation and robust cosmological analyses.

  • Open Access

    Systematic analysis of jellyfish galaxy candidates in Fornax, Antlia, and Hydra from the S-PLUS survey: a self-supervised visual identification aid

    by Yash Gondhalekar, Ana L Chies-Santos, Rafael S de Souza, Carolina Queiroz, Amanda R Lopes, Fabricio Ferrari, Gabriel M Azevedo, Hellen Monteiro-Pereira, Roderik Overzier, Analía V Smith Castelli, et al.

    We study 51 jellyfish galaxy candidates in the Fornax, Antlia, and Hydra clusters. These candidates are identified using the JClass scheme based on the visual classification of wide-field, twelve-band optical images obtained from the Southern Photometric Local Universe Survey. A comprehensive astrophysical analysis of the jellyfish (JClass > 0), non-jellyfish (JClass = 0), and independently organized control samples is undertaken. We develop a semi-automated pipeline using self-supervised learning and similarity search to detect jellyfish galaxies. The proposed framework is designed to assist visual classifiers by providing more reliable JClasses for galaxies. We find that jellyfish candidates exhibit a lower Gini coefficient, higher entropy, and a lower 2D Sérsic index as the jellyfish features in these galaxies become more pronounced. Jellyfish candidates show elevated star formation rates (including contributions from the main body and tails) by $\sim$1.75 dex, suggesting a significant increase in the SFR caused by the ram-pressure stripping phenomenon. Galaxies in the Antlia and Fornax clusters preferentially fall towards the cluster’s centre, whereas only a mild preference is observed for Hydra galaxies. Our self-supervised pipeline, applied in visually challenging cases, offers two main advantages: it reduces human visual biases and scales effectively for large data sets. This versatile framework promises substantial enhancements in morphology studies for future galaxy image surveys.


  • Open Access

    A study of two periodogram algorithms for improving the detection of small transiting planets

    by Yash Gondhalekar, Eric D. Feigelson, Gabriel A. Caceres, Marco Montalto, Snehanshu Saha

    The sensitivities of two periodograms are compared for weak signal planet detection in transit surveys: the widely used Box-Least Squares (BLS) algorithm following light curve detrending and the Transit Comb Filter (TCF) algorithm following autoregressive ARIMA modeling. Small depth transits are injected into light curves with different simulated noise characteristics. Two measures of spectral peak significance are examined: the periodogram signal-to-noise ratio (SNR) and a False Alarm Probability (FAP) based on the generalized extreme value distribution. The relative performance of the BLS and TCF algorithms for small planet detection is examined for a range of light curve characteristics, including orbital period, transit duration, depth, number of transits, and type of noise. We find that the TCF periodogram applied to ARIMA fit residuals with the SNR detection metric is preferred when short-memory autocorrelation is present in the detrended light curve and even when the light curve noise had white Gaussian noise. BLS is more sensitive to small planets only under limited circumstances with the FAP metric. BLS periodogram characteristics are inferior when autocorrelated noise is present due to heteroscedastic noise and false period detection. Application of these methods to TESS light curves with known small exoplanets confirms our simulation results. The study ends with a decision tree that advises transit survey scientists on procedures to detect small planets most efficiently. The use of ARIMA detrending and TCF periodograms can significantly improve the sensitivity of any transit survey with regularly spaced cadence.

  • Open Access

    A Study of Two Periodogram Algorithms for Improving the Detection of Small Transiting Planets

    by Yash Gondhalekar, Eric D. Feigelson, Gabriel A. Caceres, Marco Montalto, Snehanshu Saha

    The sensitivities of two periodograms are compared for weak signal planet detection in transit surveys: the widely used Box Least Squares (BLS) algorithm following light curve detrending and the Transit Comb Filter (TCF) algorithm following autoregressive ARIMA modeling. Small depth transits are injected into light curves with different simulated noise characteristics. Two measures of spectral peak significance are examined: the periodogram signal-to-noise ratio (S/N) and a false alarm probability (FAP) based on the generalized extreme value distribution. The relative performance of the BLS and TCF algorithms for small planet detection is examined for a range of light curve characteristics, including orbital period, transit duration, depth, number of transits, and type of noise. We find that the TCF periodogram applied to ARIMA fit residuals with the S/N detection metric is preferred when short-memory autocorrelation is present in the detrended light curve and even when the light curve noise had white Gaussian noise. BLS is more sensitive to small planets only under limited circumstances with the FAP metric. BLS periodogram characteristics are inferior when autocorrelated noise is present due to heteroscedastic noise and false period detection. Application of these methods to TESS light curves with known small exoplanets confirms our simulation results. The study ends with a decision tree that advises transit survey scientists on procedures to detect small planets most efficiently. The use of ARIMA detrending and TCF periodograms can significantly improve the sensitivity of any transit survey with regularly spaced cadence.


  • Open Access

    Towards out-of-distribution generalization in large-scale astronomical surveys: robust networks learn similar representations

    by Yash Gondhalekar, Sultan Hassan, Naomi Saphra, Sambatra Andrianomena

    The generalization of machine learning (ML) models to out-of-distribution (OOD) examples remains a key challenge in extracting information from upcoming astronomical surveys. Interpretability approaches are a natural way to gain insights into the OOD generalization problem. We use Centered Kernel Alignment (CKA), a similarity measure metric of neural network representations, to examine the relationship between representation similarity and performance of pre-trained Convolutional Neural Networks (CNNs) on the CAMELS Multifield Dataset. We find that when models are robust to a distribution shift, they produce substantially different representations across their layers on OOD data. However, when they fail to generalize, these representations change less from layer to layer on OOD data. We discuss the potential application of similarity representation in guiding model design, training strategy, and mitigating the OOD problem by incorporating CKA as an inductive bias during training.

  • Open Access

    $β$-SGP: Scaled Gradient Projection with $β$-divergence for astronomical image restoration

    by Yash Gondhalekar, Margarita Safonova, Snehanshu Saha

    Image restoration in astronomy has been considered a vital step in many ground-based observational programs that often suffer from sub-optimal seeing due to atmospheric turbulence, distortion of stellar shapes due to instrumental aberrations, trailing, and other issues. It holds importance for various tasks: improved astrometry, deblending of overlapping sources, faint source detection, and identification of point sources near bright extended objects, such as galaxies, to name a few. We conduct an empirical study by applying the Scaled Gradient Projection (SGP) iterative image deconvolution algorithm to restore distorted stellar shapes in our observed data. We investigate using a more flexible divergence measure, the $\beta$-divergence, which contains the commonly-used Kullback-Leibler (KL) divergence as a special case and allows automatic adaptation of the parameter $\beta$ to the data. An extensive set of experiments comparing the performance of SGP and its $\beta$-divergence variant ($\beta$-SGP) is carried out on extracted star stamps and on images containing multiple stars (both crowded and relatively sparser fields). We show a consistent enhancement in the flux conservation across all considered scenarios using $\beta$-SGP compared to SGP. Using a few quantifiable metrics such as the Full-Width-at-Half-Maximum (FWHM) and ellipticity of stars, we observe that $\beta$-SGP improves restoration quality, compared to the SGP, in many cases and still preserves restoration quality in others. We conclude that generalized versions of image restoration algorithms are more robust due to their enhanced flexibility and could be a promising modification for astronomical image restoration.

  • Top Cited Papers
    Open Access

    The Astropy Project: Sustaining and Growing a Community-oriented Open-source Project and the Latest Major Release (v5.0) of the Core Package*

    by Adrian M. Price-Whelan, Pey Lian Lim, Nicholas Earl, Nathaniel Starkman, Larry Bradley, David L. Shupe, Aarya A. Patil, Lia Corrales, C. E. Brasseur, Maximilian Nöthe, et al.

    The Astropy Project supports and fosters the development of open-source and openly developed Python packages that provide commonly needed functionality to the astronomical community. A key element of the Astropy Project is the core package astropy, which serves as the foundation for more specialized projects and packages. In this article, we summarize key features in the core package as of the recent major release, version 5.0, and provide major updates on the Project. We then discuss supporting a broader ecosystem of interoperable packages, including connections with several astronomical observatories and missions. We also revisit the future outlook of the Astropy Project and the current status of Learn Astropy. We conclude by raising and discussing the current and future challenges facing the Project.