Implicit generative models based on deep neural networks have revolutionized many scientific fields, from weather research to language generation. They successfully model complex random objects arisin...
arXiv:2511. 05924v4 Announce Type: replace Abstract: Estimating probability density and its score from samples remains a core problem in generative modeling, Bayesian inference, and kinetic theory.
By Vasily Ilin, Peter Sushko, Ranjay Krishna
arXiv:2608. 09348v1 Announce Type: new Abstract: Density estimation underlies many unsupervised tasks on tabular data such as anomaly detection, out-of-distribution detection, and data augmentation.
By Patryk Marsza{\l}ek, Jacek Tabor, Marek \'Smieja
The paper introduces additive tree models for estimating the density ratio between two distributions, using a novel balancing loss that enables training with supervised learning algorithms such as forward‑stagewise optimization and gradient boosting. The loss also functions as a pseudo‑likelihood, allowing generalized Bayesian inference via backfitting samplers for Bayesian additive regression trees, which provides uncertainty quantification. Experiments show that the boosting algorithms achieve high accuracy with low computational cost, and the Bayesian approach offers competitive accuracy while delivering uncertainty estimates, demonstrated on microbiome compositional data.
By Naoki Awaya, Yuliang Xu, Li Ma
The paper extends Neural Posterior Estimation (NPE) to handle simulators whose parameter spaces contain both discrete and continuous dimensions. It introduces an inference network that factorizes the joint posterior into discrete and continuous components, using an autoregressive classifier for the discrete part and a generative model for the continuous part, trained jointly with a single simulation-based objective. A diagnostic tool for assessing calibration of the mixed posterior is also proposed, and the method is shown to produce accurate, calibrated posteriors on toy and real scientific simulators.
By Jan Boelts, Cornelius Schr\"oder, Jonas Beck, Jakob H. Macke, Michael Deistler, Daniel Gedon
arXiv:2609.37381v1 Announce Type: new
Abstract: Neural simulation-based inference (SBI) has been widely successful in inferring a relatively small number of interpretable parameters from potentially...
By Lars K\"uhmichel, Stefan T. Radev, Bhanu Prasanna Koppolu, Masoumeh Davoudi, Jerry M. Huang, Paul-Christian B\"urkner
arXiv:2601. 07944v2 Announce Type: replace-cross Abstract: Since the turn of the century, approximate Bayesian inference has steadily evolved as new computational techniques have been incorporated to handle increasingly complex, large-scale predictive problems.
By Roy Shivam Ram Shreshtth, Arnab Hazra, Gourab Mukherjee
arXiv:2610.18945v1 Announce Type: cross
Abstract: Amortized Bayesian inference uses simulations to perform Bayesian estimation when likelihoods are expensive or analytically unavailable. However, lea...
By Niek Stevenson, Paul-Christian B\"urkner, Andrew Heathcote, Stefan T. Radev
arXiv:2605. 13092v2 Announce Type: replace-cross Abstract: Density estimation in high-dimensional settings is an important and challenging statistical problem.
By Ruitong Zhang, Ke Deng
arXiv:2502. 07580v4 Announce Type: replace Abstract: We present a novel view of diffusion-like generative modeling from the perspective of iterative Gaussian posterior inference.
By Marten Lienen, Marcel Kollovieh, Stephan G\"unnemann
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.
By Maria Nareklishvili, Nick Polson, Vadim Sokolov
The paper introduces a lightweight algorithm for modeling tabular data with both continuous and discrete variables. It transforms data into a continuous latent space using empirical marginals and a quantile function, enabling efficient estimation with distributions like a multivariate Gaussian. The method preserves complex marginal distributions and correlations, and handles discrete variables via a Monte Carlo expectation‑maximisation framework that allows conventional maximum‑likelihood estimation.
By Bartosz Barzdajn, Mateusz Krzyszto\'n