arXiv subjects

Chirag Modi

Publications and source records attributed to Chirag Modi.

At least 19 recordsLinked to original sources

arXiv2026

Field-Level Inference from Galaxies: BAO Reconstruction

Baryon acoustic oscillations (BAO) underpin the key cosmological results from modern spectroscopic galaxy surveys, but nonlinear gravitational evolution limits the precision achievable with traditional analysis methods. To overcome this, we develop field-level inference for BAO, first reconstructing the initial linear density field and then fitting the BAO signal therein. We benchmark three reconstruction methods: (i) traditional reconstruction based on the Zel'dovich approximation, (ii) explicit field-level inference using differentiable forward modeling with hybrid effective field theory, and (iii) implicit field-level inference using a convolutional neural network to augment traditional reconstruction. Using DESI-like Luminous Red Galaxy (LRG) and Bright Galaxy Survey (BGS) catalogs, we find that field-level approaches significantly sharpen the BAO feature relative to traditional reconstruction. For LRGs, explicit field-level inference improves constraints on the BAO scale parameters ($\alpha_{\rm iso}, \alpha_{\rm ap}$) by 26%, while implicit inference improves constraints by 35%, corresponding to a 2.4$\times$ improvement in figure of merit. For the higher-density, lower-redshift BGS sample, field-level inference enables information extraction from smaller scales, yielding an improvement in constraints of up to 46%, corresponding to a 3.2$\times$ improvement in figure of merit. Crucially, we address longstanding concerns regarding the robustness of field-level reconstruction by leveraging 1,000 mock realizations to perform extensive coverage tests. Our results are both unbiased and statistically well-calibrated, maintaining nominal coverage even when using tight simulation-informed priors and under model misspecification.

astro-ph.CO↗

arXiv2025

Generative Modeling from Black-box Corruptions via Self-Consistent Stochastic Interpolants

Transport-based methods have emerged as a leading paradigm for building generative models from large, clean datasets. However, in many scientific and engineering domains, clean data are often unavailable: instead, we only observe measurements corrupted through a noisy, ill-conditioned channel. A generative model for the original data thus requires solving an inverse problem at the level of distributions. In this work, we introduce a novel approach to this task based on Stochastic Interpolants: we iteratively update a transport map between corrupted and clean data samples using only access to the corrupted dataset as well as black box access to the corruption channel. Under appropriate conditions, this iterative procedure converges towards a self-consistent transport map that effectively inverts the corruption channel, thus enabling a generative model for the clean data. We refer to the resulting method as the self-consistent stochastic interpolant (SCSI). It (i) is computationally efficient compared to variational alternatives, (ii) highly flexible, handling arbitrary nonlinear forward models with only black-box access, and (iii) enjoys theoretical guarantees. We demonstrate superior performance on inverse problems in natural image processing and scientific reconstruction, and establish convergence guarantees of the scheme under appropriate assumptions. Our source code is publicly available at https://github.com/modichirag/SCSI

cs.LG↗

arXiv2025

Galactification: painting galaxies onto dark matter only simulations using a transformer-based model

Connecting the formation and evolution of galaxies to the large-scale structure is crucial for interpreting cosmological observations. While hydrodynamical simulations accurately model the correlated properties of galaxies, they are computationally prohibitive to run over volumes that match modern surveys. We address this by developing a framework to rapidly generate mock galaxy catalogs conditioned on inexpensive dark-matter-only simulations. We present a multi-modal, transformer-based model that takes 3D dark matter density and velocity fields as input, and outputs a corresponding point cloud of galaxies with their physical properties. We demonstrate that our trained model faithfully reproduces a variety of galaxy summary statistics and correctly captures their variation with changes in the underlying cosmological and astrophysical parameters, making it the first accelerated forward model to capture all the relevant galaxy properties, their full spatial distribution, and their conditional dependencies in hydrosimulations.

astro-ph.CO↗

arXiv2025

An Exploration of Non-Euclidean Gradient Descent: Muon and its Many Variants

To define a steepest descent method over a neural network, we need to choose a norm for each layer, a way to aggregate these norms across layers, and whether to use normalization. We systematically explore different alternatives for aggregating norms across layers, both formalizing existing combinations of Adam and the recently proposed Muon as a type of non-Euclidean gradient descent, and deriving new variants of the Muon optimizer. Through a comprehensive experimental evaluation of the optimizers within our framework, we find that Muon is sensitive to the choice of learning rate, whereas a new variant we call MuonMax is significantly more robust. We then show how to combine any non-Euclidean gradient method with model based momentum (known as Momo). The new Momo variants of Muon are significantly more robust to hyperparameter tuning, and often achieve a better validation score. Thus for new tasks, where the optimal hyperparameters are not known, we advocate for using Momo in combination with MuonMax to save on costly hyperparameter tuning.

cs.LG↗

arXiv2025

FLORAH-Tree: Emulating Dark Matter Halo Merger Trees with Graph Generative Models

Merger trees track the hierarchical assembly of dark matter halos across cosmic time and serve as essential inputs for semi-analytic models of galaxy formation. However, conventional methods for constructing merger trees rely on ad-hoc assumptions and are unable to incorporate environmental information. Nguyen et al. (2024) introduced FLORAH, a generative model based on recurrent neural networks and normalizing flows, for modeling main progenitor branches of merger trees. In this work, we extend this model, now referred to as FLORAH-Tree, to generate complete merger trees by representing them as graph structures that capture the full branching hierarchy. We trained FLORAH-Tree on merger trees extracted from the Very Small MultiDark Planck cosmological N-body simulation. To validate our approach, we compared the generated merger trees with both the original simulation data and with semi-analytic trees produced using the Extended Press-Schechter (EPS) formalism. We show that FLORAH-Tree accurately reproduces key merger rate statistics across a wide range of mass and redshift, outperforming the conventional EPS-based approach. We demonstrate its utility by applying the Santa Cruz semi-analytic model (SAM) to generated trees and showing that the resulting galaxy-halo scaling relations, such as the stellar-to-halo-mass relation and supermassive black hole mass-halo mass relation, closely match those from applying the SAM to trees extracted directly from the simulation. FLORAH-Tree provides a computationally efficient method for generating merger trees that maintain the statistical fidelity of N-body simulations.

astro-ph.GA↗

arXiv2025

Modeling Galaxy Surveys with Hybrid SBI

Simulation-based inference (SBI) has emerged as a powerful tool for extracting cosmological information from galaxy surveys deep into the non-linear regime. Despite its great promise, its application is limited by the computational cost of running simulations that can describe the increasingly-large cosmological datasets. Recent work proposed a hybrid SBI framework (HySBI), which combines SBI on small-scales with perturbation theory (PT) on large-scales, allowing information to be extracted from high-resolution observations without large-volume simulations. In this work, we lay out the HySBI framework for galaxy clustering, a key step towards its application to next-generation datasets. We study the choice of priors on the parameters for modeling galaxies in PT analysis and in simulation-based analyses, as well as investigate their cosmology dependence. By jointly modeling large- and small-scale statistics and their associated nuisance parameters, we show that HySBI can obtain 20\% and 60\% tighter constraints on $\Omega_m$ and $\sigma_8$, respectively, compared to traditional PT analyses, thus demonstrating the efficacy of this approach to maximally extract information from upcoming spectroscopic datasets.

astro-ph.CO↗

arXiv2024

EigenVI: score-based variational inference with orthogonal function expansions

We develop EigenVI, an eigenvalue-based approach for black-box variational inference (BBVI). EigenVI constructs its variational approximations from orthogonal function expansions. For distributions over $\mathbb{R}^D$, the lowest order term in these expansions provides a Gaussian variational approximation, while higher-order terms provide a systematic way to model non-Gaussianity. These approximations are flexible enough to model complex distributions (multimodal, asymmetric), but they are simple enough that one can calculate their low-order moments and draw samples from them. EigenVI can also model other types of random variables (e.g., nonnegative, bounded) by constructing variational approximations from different families of orthogonal functions. Within these families, EigenVI computes the variational approximation that best matches the score function of the target distribution by minimizing a stochastic estimate of the Fisher divergence. Notably, this optimization reduces to solving a minimum eigenvalue problem, so that EigenVI effectively sidesteps the iterative gradient-based optimizations that are required for many other BBVI algorithms. (Gradient-based methods can be sensitive to learning rates, termination criteria, and other tunable hyperparameters.) We use EigenVI to approximate a variety of target distributions, including a benchmark suite of Bayesian models from posteriordb. On these distributions, we find that EigenVI is more accurate than existing methods for Gaussian BBVI.

stat.ML↗

arXiv2024

Batch, match, and patch: low-rank approximations for score-based variational inference

Black-box variational inference (BBVI) scales poorly to high-dimensional problems when it is used to estimate a multivariate Gaussian approximation with a full covariance matrix. In this paper, we extend the batch-and-match (BaM) framework for score-based BBVI to problems where it is prohibitively expensive to store such covariance matrices, let alone to estimate them. Unlike classical algorithms for BBVI, which use stochastic gradient descent to minimize the reverse Kullback-Leibler divergence, BaM uses more specialized updates to match the scores of the target density and its Gaussian approximation. We extend the updates for BaM by integrating them with a more compact parameterization of full covariance matrices. In particular, borrowing ideas from factor analysis, we add an extra step to each iteration of BaM--a patch--that projects each newly updated covariance matrix into a more efficiently parameterized family of diagonal plus low rank matrices. We evaluate this approach on a variety of synthetic target distributions and real-world problems in high-dimensional inference.

stat.ML↗

arXiv2024

ATLAS: Adapting Trajectory Lengths and Step-Size for Hamiltonian Monte Carlo

Hamiltonian Monte-Carlo (HMC) and its auto-tuned variant, the No U-Turn Sampler (NUTS) can struggle to accurately sample distributions with complex geometries, e.g., varying curvature, due to their constant step size for leapfrog integration and fixed mass matrix. In this work, we develop a strategy to locally adapt the step size parameter of HMC at every iteration by evaluating a low-rank approximation of the local Hessian and estimating its largest eigenvalue. We combine it with a strategy to similarly adapt the trajectory length by monitoring the no U-turn condition, resulting in an adaptive sampler, ATLAS: adapting trajectory length and step-size. We further use a delayed rejection framework for making multiple proposals that improves the computational efficiency of ATLAS, and develop an approach for automatically tuning its hyperparameters during warmup. We compare ATLAS with state-of-the-art samplers like NUTS on a suite of synthetic and real world examples, and show that i) unlike NUTS, ATLAS is able to accurately sample difficult distributions with complex geometries, ii) it is computationally competitive to NUTS for simpler distributions, and iii) it is more robust to the tuning of hyperparamters.

stat.CO↗

arXiv2024

Teaching dark matter simulations to speak the halo language

We develop a transformer-based conditional generative model for discrete point objects and their properties. We use it to build a model for populating cosmological simulations with gravitationally collapsed structures called dark matter halos. Specifically, we condition our model with dark matter distribution obtained from fast, approximate simulations to recover the correct three-dimensional positions and masses of individual halos. This leads to a first model that can recover the statistical properties of the halos at small scales to better than 3% level using an accelerated dark matter simulation. This trained model can then be applied to simulations with significantly larger volumes which would otherwise be computationally prohibitive with traditional simulations, and also provides a crucial missing link in making end-to-end differentiable cosmological simulations. The code, named GOTHAM (Generative cOnditional Transformer for Halo's Auto-regressive Modeling) is publicly available at \url{https://github.com/shivampcosmo/GOTHAM}.

astro-ph.CO↗

arXiv2024

CHARM: Creating Halos with Auto-Regressive Multi-stage networks

To maximize the amount of information extracted from cosmological datasets, simulations that accurately represent these observations are necessary. However, traditional simulations that evolve particles under gravity by estimating particle-particle interactions (N-body simulations) are computationally expensive and prohibitive to scale to the large volumes and resolutions necessary for the upcoming datasets. Moreover, modeling the distribution of galaxies typically involves identifying virialized dark matter halos, which is also a time- and memory-consuming process for large N-body simulations, further exacerbating the computational cost. In this study, we introduce CHARM, a novel method for creating mock halo catalogs by matching the spatial, mass, and velocity statistics of halos directly from the large-scale distribution of the dark matter density field. We develop multi-stage neural spline flow-based networks to learn this mapping at redshift z=0.5 directly with computationally cheaper low-resolution particle mesh simulations instead of relying on the high-resolution N-body simulations. We show that the mock halo catalogs and painted galaxy catalogs have the same statistical properties as obtained from $N$-body simulations in both real space and redshift space. Finally, we use these mock catalogs for cosmological inference using redshift-space galaxy power spectrum, bispectrum, and wavelet-based statistics using simulation-based inference, performing the first inference with accelerated forward model simulations and finding unbiased cosmological constraints with well-calibrated posteriors. The code was developed as part of the Simons Collaboration on Learning the Universe and is publicly available at \url{https://github.com/shivampcosmo/CHARM}.

astro-ph.CO↗

arXiv2024

Sampling From Multiscale Densities With Delayed Rejection Generalized Hamiltonian Monte Carlo

Hamiltonian Monte Carlo (HMC) is the mainstay of applied Bayesian inference for differentiable models. However, HMC still struggles to sample from hierarchical models that induce densities with multiscale geometry: a large step size is needed to efficiently explore low curvature regions while a small step size is needed to accurately explore high curvature regions. We introduce the delayed rejection generalized HMC (DR-G-HMC) sampler that overcomes this challenge by employing dynamic step size selection, inspired by differential equation solvers. In generalized HMC, each iteration does a single leapfrog step. DR-G-HMC sequentially makes proposals with geometrically decreasing step sizes upon rejection of earlier proposals. This simulates Hamiltonian dynamics that can adjust its step size along a (stochastic) Hamiltonian trajectory to deal with regions of high curvature. DR-G-HMC makes generalized HMC competitive by decreasing the number of rejections which otherwise cause inefficient backtracking and prevents directed movement. We present experiments to demonstrate that DR-G-HMC (1) correctly samples from multiscale densities, (2) makes generalized HMC methods competitive with the state of the art No-U-Turn sampler, and (3) is robust to tuning parameters.

stat.CO↗

arXiv2024

A Parameter-Masked Mock Data Challenge for Beyond-Two-Point Galaxy Clustering Statistics

The last few years have seen the emergence of a wide array of novel techniques for analyzing high-precision data from upcoming galaxy surveys, which aim to extend the statistical analysis of galaxy clustering data beyond the linear regime and the canonical two-point (2pt) statistics. We test and benchmark some of these new techniques in a community data challenge "Beyond-2pt", initiated during the Aspen 2022 Summer Program "Large-Scale Structure Cosmology beyond 2-Point Statistics," whose first round of results we present here. The challenge dataset consists of high-precision mock galaxy catalogs for clustering in real space, redshift space, and on a light cone. Participants in the challenge have developed end-to-end pipelines to analyze mock catalogs and extract unknown ("masked") cosmological parameters of the underlying $\Lambda$CDM models with their methods. The methods represented are density-split clustering, nearest neighbor statistics, BACCO power spectrum emulator, void statistics, LEFTfield field-level inference using effective field theory (EFT), and joint power spectrum and bispectrum analyses using both EFT and simulation-based inference. In this work, we review the results of the challenge, focusing on problems solved, lessons learned, and future research needed to perfect the emerging beyond-2pt approaches. The unbiased parameter recovery demonstrated in this challenge by multiple statistics and the associated modeling and inference frameworks supports the credibility of cosmology constraints from these methods. The challenge data set is publicly available and we welcome future submissions from methods that are not yet represented.

astro-ph.CO↗

arXiv2024

{\sc SimBIG}: Cosmological Constraints using Simulation-Based Inference of Galaxy Clustering with Marked Power Spectra

We present the first $\Lambda$CDM cosmological analysis performed on a galaxy survey using marked power spectra. The marked power spectrum is the two-point function of a marked field, where galaxies are weighted by a function that depends on their local density. The presence of the mark leads these statistics to contain higher-order information of the original galaxy field, making them a good candidate to exploit the non-Gaussian information of a galaxy catalog. In this work we make use of \simbig, a forward modeling framework for galaxy clustering analyses, and perform simulation-based inference using normalizing flows to infer the posterior distribution of the $\Lambda$CDM cosmological parameters. We consider different mark configurations (ways to weight the galaxy field) and deploy them in the \simbig~pipeline to analyze the corresponding marked power spectra measured from a subset of the BOSS galaxy sample. We analyze the redshift-space mark power spectra decomposed in $\ell = 0, 2, 4$ multipoles and include scales up to the non-linear regime. Among the various mark configurations considered, the ones that give the most stringent cosmological constraints produce posterior median and $68\%$ confidence limits on the growth of structure parameters equal to $\Omega_m=0.273^{+0.040}_{-0.030}$ and $\sigma_8=0.777^{+0.077}_{-0.071}$. Compared to a perturbation theory analysis using the power spectrum of the same dataset, the \simbig~marked power spectra constraints on $\sigma_8$ are up to $1.2\times$ tighter, while no improvement is seen for the other cosmological parameters.

astro-ph.CO↗

arXiv2024

Neural Simulation-Based Inference of the Neutron Star Equation of State directly from Telescope Spectra

Neutron stars provide a unique opportunity to study strongly interacting matter under extreme density conditions. The intricacies of matter inside neutron stars and their equation of state are not directly visible, but determine bulk properties, such as mass and radius, which affect the star's thermal X-ray emissions. However, the telescope spectra of these emissions are also affected by the stellar distance, hydrogen column, and effective surface temperature, which are not always well-constrained. Uncertainties on these nuisance parameters must be accounted for when making a robust estimation of the equation of state. In this study, we develop a novel methodology that, for the first time, can infer the full posterior distribution of both the equation of state and nuisance parameters directly from telescope observations. This method relies on the use of neural likelihood estimation, in which normalizing flows use samples of simulated telescope data to learn the likelihood of the neutron star spectra as a function of these parameters, coupled with Hamiltonian Monte Carlo methods to efficiently sample from the corresponding posterior distribution. Our approach surpasses the accuracy of previous methods, improves the interpretability of the results by providing access to the full posterior distribution, and naturally scales to a growing number of neutron star observations expected in the coming years.

astro-ph.HE↗

arXiv2024

Batch and match: black-box variational inference with a score-based divergence

Most leading implementations of black-box variational inference (BBVI) are based on optimizing a stochastic evidence lower bound (ELBO). But such approaches to BBVI often converge slowly due to the high variance of their gradient estimates and their sensitivity to hyperparameters. In this work, we propose batch and match (BaM), an alternative approach to BBVI based on a score-based divergence. Notably, this score-based divergence can be optimized by a closed-form proximal update for Gaussian variational families with full covariance matrices. We analyze the convergence of BaM when the target distribution is Gaussian, and we prove that in the limit of infinite batch size the variational parameter updates converge exponentially quickly to the target mean and covariance. We also evaluate the performance of BaM on Gaussian and non-Gaussian target distributions that arise from posterior inference in hierarchical and deep generative models. In these experiments, we find that BaM typically converges in fewer (and sometimes significantly fewer) gradient evaluations than leading implementations of BBVI based on ELBO maximization.

stat.ML↗

arXiv2024

LtU-ILI: An All-in-One Framework for Implicit Inference in Astrophysics and Cosmology

This paper presents the Learning the Universe Implicit Likelihood Inference (LtU-ILI) pipeline, a codebase for rapid, user-friendly, and cutting-edge machine learning (ML) inference in astrophysics and cosmology. The pipeline includes software for implementing various neural architectures, training schemata, priors, and density estimators in a manner easily adaptable to any research workflow. It includes comprehensive validation metrics to assess posterior estimate coverage, enhancing the reliability of inferred results. Additionally, the pipeline is easily parallelizable and is designed for efficient exploration of modeling hyperparameters. To demonstrate its capabilities, we present real applications across a range of astrophysics and cosmology problems, such as: estimating galaxy cluster masses from X-ray photometry; inferring cosmology from matter power spectra and halo point clouds; characterizing progenitors in gravitational wave signals; capturing physical dust parameters from galaxy colors and luminosities; and establishing properties of semi-analytic models of galaxy formation. We also include exhaustive benchmarking and comparisons of all implemented methods as well as discussions about the challenges and pitfalls of ML inference in astronomical sciences. All code and examples are made publicly available at https://github.com/maho3/ltu-ili.

astro-ph.IM↗

arXiv2024

${\rm S{\scriptsize IM}BIG}$: Cosmological Constraints from the Redshift-Space Galaxy Skew Spectra

Extracting the non-Gaussian information of the cosmic large-scale structure (LSS) is vital in unlocking the full potential of the rich datasets from the upcoming stage-IV galaxy surveys. Galaxy skew spectra serve as efficient beyond-two-point statistics, encapsulating essential bispectrum information with computational efficiency akin to power spectrum analysis. This paper presents the first cosmological constraints from analyzing the full set of redshift-space galaxy skew spectra of the data from the SDSS-III BOSS, accessing cosmological information down to nonlinear scales. Employing the ${\rm S{\scriptsize IM}BIG}$ forward modeling framework and simulation-based inference via normalizing flows, we analyze the CMASS-SGC sub-sample, which constitute approximately 10\% of the full BOSS data. Analyzing the scales up to $k_{\rm max}=0.5 \, {\rm Mpc}^{-1}h$, we find that the skew spectra improve the constraints on $\Omega_{\rm m}, \Omega_{\rm b}, h$, and $n_s$ by 34\%, 35\%, 18\%, 10\%, respectively, compared to constraints from previous ${\rm S{\scriptsize IM}BIG}$ power spectrum multipoles analysis, yielding $\Omega_{\rm m}=0.288^{+0.024}_{-0.034}$, $\Omega_{\rm b}= 0.043^{+0.005}_{-0.007}$, $h=0.759^{+0.104}_{-0.050}$, $n_{\rm s} = 0.918^{+0.041}_{-0.090}$ (at 68\% confidence limit). On the other hand, the constraints on $\sigma_8$ are weaker than from the power spectrum. Including the Big Bang Nucleosynthesis (BBN) prior on baryon density reduces the uncertainty on the Hubble parameter further, achieving $h=0.750^{+0.034}_{-0.032}$, which is a 38\% improvement over the constraint from the power spectrum with the same prior. Compared to the ${\rm S{\scriptsize IM}BIG}$ bispectrum (monopole) analysis, skew spectra offer comparable constraints on larger scales ($k_{\rm max}<0.3\, {\rm Mpc}^{-1}h$) for most parameters except for $\sigma_8$.

astro-ph.CO↗