arXiv Machine Learning By Maria Nareklishvili, Nick Polson, Vadim Sokolov

Generative Modeling: A Review

Read the original on arXiv Machine Learning →

The paper reviews generative modeling by categorizing generators into three types: those estimating counterfactual outcome distributions in causal inference, those recovering posteriors from simulated parameter–outcome pairs, and those forming predictive outcome distributions. It introduces generative Bayesian computation, a quantile neural network trained on simulated pairs using the pinball loss, which directly targets posterior distributions without requiring invertible architectures or density evaluation. The method is demonstrated on an agent-based Ebola transmission model, showing accurate posterior recovery at lower computational cost than rejection-based simulation inference.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Oct 1

BayesNDE: Bayesian Generative Modeling for Neural Density Estimation

BayesNDE is a neural density estimator that uses Bayesian generative modeling to estimate densities without relying on invertible networks or Jacobian-determinant calculations. It constructs an adaptive proposal for each observation by inferring a sample-specific latent posterior, and then applies bridge sampling to combine proposal samples with separate posterior samples for density estimation. Experiments on synthetic datasets show improved density estimation and structure recovery, while real-world applications demonstrate better anomaly detection.

By Chenglin Li, Qiao Liu
arXiv Machine Learning
Oct 28

Active Learning of Conditional Generative Models via the Transport Neural Tangent Kernel

The paper introduces the transport Neural Tangent Kernel (tNTK) to enable active learning for conditional generative models that produce distributional outputs. By decomposing the Wasserstein test risk into mean and shape components, the authors show that mean‑based active learning misses distributional shape, and propose tNTK as a tractable kernel that captures sensitivity of the predicted distribution to model parameters. Using tNTK as a Gaussian process covariance, they greedily select inputs that minimize posterior variance, and demonstrate that this distribution‑aware strategy outperforms mean‑based NTK baselines across several generative model types and datasets.

By Jayoung Ryu, Kyunghyun Cho, Romain Lopez
arXiv Statistics ML
Aug 28

On the approximation of posterior laws in compound loss models by conditional Wasserstein GANs

The paper introduces a conditional Wasserstein GAN to approximate posterior distributions in compound loss models, conditioning on sufficient statistics, prior mean, coefficient of variation, and mixture weights. A single generator can learn the posteriors for both Poisson intensity and Pareto shape parameters across Gamma, inverse‑Gaussian, and lognormal priors. The authors validate the approach with simulation‑based calibration, analytical comparisons, and extensive MCMC, and apply it to extreme natural catastrophe loss data to generate rolling one‑year posterior predictive distributions and assess tail risk under heavy‑tailed severity and prior uncertainty.

By Aleksandar Arandjelovic, Pavel V. Shevchenko, George Tzougas
arXiv AI
Aug 26

Generative AI for Validating Physics Laws

arXiv:2503.17894v3 Announce Type: replace-cross Abstract: We propose generative learner for estimating heterogeneous treatment effects and characterizing the full distribution of causal effects. The...

By Maria Nareklishvili, Nicholas Polson, Vadim Sokolov
arXiv Machine Learning
Oct 8

Causal Posterior Estimation

The paper introduces Causal Posterior Estimation (CPE), a new Bayesian inference technique for simulator models where the likelihood is intractable but simulation is easy. CPE uses flow matching to approximate the posterior while embedding the model’s conditional dependencies directly into the neural network architecture. Experiments show that this hard‑coded structure yields highly accurate inference, matching or surpassing current state‑of‑the‑art methods.

By Simon Dirmeier, Antonietta Mira