← Search

Chirag Modi

7 accepted papers

2026

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

ICML 2026poster

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 combinat…

Cited by 0SourceScholar
2026

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

ICLR 2026poster

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 gen…

Cited by 0SourcecodeScholar
2025

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

AISTATS 2025poster

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…

Cited by 0SourcecodeScholar
2025

Sampling From Multiscale Densities With Delayed Rejection Generalized Hamiltonian Monte Carlo

AISTATS 2025poster

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 smal…

Cited by 0SourceScholar
2024

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

ICML 2024spotlight

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 p…

Cited by 7SourcePDFScholar
2024

EigenVI: score-based variational inference with orthogonal function expansions

NeurIPS 2024spotlight

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 approxi…

Cited by 3SourcePDFScholar
2023

Variational Inference with Gaussian Score Matching

NeurIPS 2023poster

Variational inference (VI) is a method to approximate the computationally intractable posterior distributions that arise in Bayesian statistics. Typically, VI fits a simple parametric distribution to be close to the target posterior, optimizing an appropriate objective such as the evidence lower b…

Cited by 13SourcePDFScholar