Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Abhinav Agrawal 0001

dblp:73/3655-1 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
3since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 4 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Probabilistic and Bayesian machine learning · 93% Generative modeling · 7%

Topics — the 11 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.922021
Amortized Variational Inference for Simple Hierarchical Models · NeurIPS 2021
Advances in Black-Box VI: Normalizing Flows, Importance Weighting, and Optimization · NeurIPS 2020
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
approximate inference
0.912025
Understanding the difficulties of posterior predictive estimation · ICML 2025
Machine learning › Probabilistic and Bayesian machine learning
monte carlo methods
0.912025
Understanding the difficulties of posterior predictive estimation · ICML 2025
Machine learning › Probabilistic and Bayesian machine learning
signal-to-noise ratio analysis
0.912025
Understanding the difficulties of posterior predictive estimation · ICML 2025
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference › variational inference › amortized inference
amortized variational inference
0.512021
Amortized Variational Inference for Simple Hierarchical Models · NeurIPS 2021
Machine learning › Probabilistic and Bayesian machine learning › hierarchical modeling
hierarchical model
0.512021
Amortized Variational Inference for Simple Hierarchical Models · NeurIPS 2021
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
scalable inference
0.512021
Amortized Variational Inference for Simple Hierarchical Models · NeurIPS 2021
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference › variational inference › gradient-based variational inference
black-box variational inference
0.412020
Advances in Black-Box VI: Normalizing Flows, Importance Weighting, and Optimization · NeurIPS 2020
Machine learning › Generative modeling
normalizing flow
0.412020
Advances in Black-Box VI: Normalizing Flows, Importance Weighting, and Optimization · NeurIPS 2020
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › importance sampling
adaptive importance sampling
0.312025
Understanding the difficulties of posterior predictive estimation · ICML 2025
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
importance sampling
0.312025
Understanding the difficulties of posterior predictive estimation · ICML 2025

Methods — techniques the papers use, named apart from their topics

variational proxy optimization · 0.9monte carlo estimation · 0.9subsampling · 0.5structured variational family · 0.5amortized inference · 0.5step-size scheme · 0.4importance weighting · 0.4gradient estimator · 0.4
YearPublicationVenuePosition
2025 Disentangling impact of capacity, objective, batchsize, estimators, and step-size on flow VI
abstract
Normalizing flow-based variational inference (flow VI) is a promising approximate inference approach, but its performance remains inconsistent across studies. Numerous algorithmic choices influence flow VI’s performance. We conduct a step-by-step analysis to disentangle the impact of some of the key factors: capacity, objectives, gradient estimators, number of gradient estimates (batchsize), and step-sizes. Each step examines one factor while neutralizing others using insights from the previous steps and/or using extensive parallel computation. To facilitate high-fidelity evaluation, we curate a benchmark of synthetic targets that represent common posterior pathologies and allow for exact sampling. We provide specific recommendations for different factors and propose a flow VI recipe that matches or surpasses leading turnkey Hamiltonian Monte Carlo (HMC) methods.
Abhinav Agrawal 0001, Justin Domke
AISTATS1
2025 Understanding the difficulties of posterior predictive estimation
abstract
Predictive posterior densities (PPDs) are essential in approximate inference for quantifying predictive uncertainty and comparing inference methods. Typically, PPDs are estimated by simple Monte Carlo (MC) averages. In this paper, we expose a critical under-recognized issue: the signal-to-noise ratio (SNR) of the simple MC estimator can sometimes be extremely low, leading to unreliable estimates. Our main contribution is a theoretical analysis demonstrating that even with exact inference, SNR can decay rapidly with an increase in (a) the mismatch between training and test data, (b) the dimensionality of the latent space, or (c) the size of test data relative to training data. Through several examples, we empirically verify these claims and show that these factors indeed lead to poor SNR and unreliable PPD estimates (sometimes, estimates are off by hundreds of nats even with a million samples). While not the primary focus, we also explore an adaptive importance sampling approach as an illustrative way to mitigate the problem, where we learn the proposal distribution by maximizing a variational proxy to the SNR. Taken together, our findings highlight an important challenge and provide essential insights for reliable estimation.
Abhinav Agrawal 0001, Justin Domke
ICML1
2021 Amortized Variational Inference for Simple Hierarchical Models
abstract
It is difficult to use subsampling with variational inference in hierarchical models since the number of local latent variables scales with the dataset. Thus, inference in hierarchical models remains a challenge at a large scale. It is helpful to use a variational family with a structure matching the posterior, but optimization is still slow due to the huge number of local distributions. Instead, this paper suggests an amortized approach where shared parameters simultaneously represent all local distributions. This approach is similarly accurate as using a given joint distribution (e.g., a full-rank Gaussian) but is feasible on datasets that are several orders of magnitude larger. It is also dramatically faster than using a structured variational distribution.
Abhinav Agrawal 0001, Justin Domke
NeurIPS1
2020 Advances in Black-Box VI: Normalizing Flows, Importance Weighting, and Optimization
abstract
Recent research has seen several advances relevant to black-box VI, but the current state of automatic posterior inference is unclear. One such advance is the use of normalizing flows to define flexible posterior densities for deep latent variable models. Another direction is the integration of Monte-Carlo methods to serve two purposes; first, to obtain tighter variational objectives for optimization, and second, to define enriched variational families through sampling. However, both flows and variational Monte-Carlo methods remain relatively unexplored for black-box VI. Moreover, on a pragmatic front, there are several optimization considerations like step-size scheme, parameter initialization, and choice of gradient estimators, for which there are no clear guidance in the existing literature. In this paper, we postulate that black-box VI is best addressed through a careful combination of numerous algorithmic components. We evaluate components relating to optimization, flows, and Monte-Carlo methods on a benchmark of 30 models from the Stan model library. The combination of these algorithmic components significantly advances the state-of-the-art "out of the box" variational inference.
Abhinav Agrawal 0001, Daniel Sheldon, Justin Domke
NeurIPS1