Quasi Monte Carlo methods enable extremely low-dimensional deep generative models
Not on the map. Why?
Abstract (arXiv)
This paper introduces quasi-Monte Carlo latent variable models (QLVMs): a class of deep generative models that are specialized for finding extremely low-dimensional and interpretable embeddings of high-dimensional datasets. Unlike standard approaches, which rely on a learned encoder and variational lower bounds, QLVMs directly approximate the marginal likelihood by randomized quasi-Monte Carlo integration. While this brute force approach has drawbacks in higher-dimensional spaces, we find that it excels in fitting one, two, and three dimensional deep latent variable models. Empirical results on a range of datasets show that QLVMs consistently outperform conventional variational autoencoders (VAEs) and importance weighted autoencoders (IWAEs) with matched latent dimensionality. The resulting embeddings enable transparent visualization and post hoc analyses such as nonparametric density estimation, clustering, and geodesic path computation, which are nontrivial to validate in higher-dimensional spaces. While our approach is compute-intensive and struggles to generate fine-scale details in complex datasets, it offers a compelling solution for applications prioritizing interpretability and latent space analysis.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 28 of its 62 references that are in the map. First posted on arXiv 26 Jan 2026.
Builds on
28 of 62 references.
References · 28
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
- 2014Deep Learning Face Attributes in the Wildcited by 3,693
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
- 2019An Introduction to Variational Autoencoderscited by 1,000
- 2020NVAE: A Deep Hierarchical Variational Autoencodercited by 637
- 2019Variational Autoencoders and Nonlinear ICA: A Unifying Frameworkcited by 503
- 2015Importance Weighted Autoencoderscited by 456
- 2016Tutorial on Variational Autoencoderscited by 409
- 2017Latent Space Oddity: on the Curvature of Deep Generative Modelscited by 174
- 2020Understanding How Dimension Reduction Tools Work: An Empirical Approach to Deciphering t-SNE, UMAP, TriMAP, and PaCMAP for Data Visualizationcited by 173
- 2019Lagging Inference Networks and Posterior Collapse in Variational Autoencoderscited by 124
- 2018Iterative Amortized Inferencecited by 94
16 more
- 2018Semi-Amortized Variational Autoencoderscited by 83
- 2018Tighter Variational Bounds are Not Necessarily Bettercited by 76
- 2019The Usual Suspects? Reassessing Blame for VAE Posterior Collapsecited by 52
- 2018Doubly Reparameterized Gradient Estimators for Monte Carlo Objectivescited by 41
- 2021Efficient Iterative Amortized Inference for Learning Symmetric and Disentangled Multi-Object Representationscited by 36
- 2021Monte Carlo Variational Auto-Encoderscited by 36
- 2017Variational Walkback: Learning a Transition Operator as a Stochastic Recurrent Netcited by 30
- 2017Eigen-Distortions of Hierarchical Representationscited by 26
- 2018Quasi-Monte Carlo Variational Inferencecited by 24
- 2018Improving Explorability in Variational Inference with Annealed Variational Objectivescited by 24
- 2018Leveraging the Exact Likelihood of Deep Latent Variable Modelscited by 23
- 2020Automatic Differentiation Variational Inference with Mixturescited by 19
- 2022Multiple Importance Sampling ELBO and Deep Ensembles of Variational Approximationscited by 12
- 2023Controlling Posterior Collapse by an Inverse Lipschitz Constraint on the Decoder Networkcited by 7
- 2022Bounding Evidence and Estimating Log-Likelihood in VAEcited by 6
- 2024Combining Normalizing Flows and Quasi-Monte Carlocited by 2
Built on by
Not cited yet.