mlsanityData to 7 Oct 2026

A likelihood approach to nonparametric estimation of a singular distribution using deep generative models

arXiv 2105.04046 ↗First posted 9 May 2021stat.ML cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

We investigate statistical properties of a likelihood approach to nonparametric estimation of a singular distribution using deep generative models. More specifically, a deep generative model is used to model high-dimensional data that are assumed to concentrate around some low-dimensional structure. Estimating the distribution supported on this low-dimensional structure, such as a low-dimensional manifold, is challenging due to its singularity with respect to the Lebesgue measure in the ambient space. In the considered model, a usual likelihood approach can fail to estimate the target distribution consistently due to the singularity. We prove that a novel and effective solution exists by perturbing the data with an instance noise, which leads to consistent estimation of the underlying distribution with desirable convergence rates. We also characterize the class of distributions that can be efficiently estimated via deep generative models. This class is sufficiently general to contain various structured distributions such as product distributions, classically smooth distributions and distributions supported on a low-dimensional manifold. Our analysis provides some insights on how deep generative models can avoid the curse of dimensionality for nonparametric distribution estimation. We conduct a thorough simulation study and real data analysis to empirically demonstrate that the proposed data perturbation technique improves the estimation performance significantly.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 41 of its 104 references that are in the map. First posted on arXiv 9 May 2021.

Builds on

41 of 104 references.

References · 41

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
  3. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,067
  4. 2013Auto-Encoding Variational Bayescited by 3,980
  5. 2016Improved Techniques for Training GANscited by 2,938
  6. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  7. 2015Variational Inference with Normalizing Flowscited by 2,161
  8. 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,048
  9. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  10. 2016Improving Variational Inference with Inverse Autoregressive Flowcited by 636
  11. 2016Error bounds for approximations with deep ReLU networkscited by 567
  12. 2015Empirical Evaluation of Rectified Activations in Convolutional Networkcited by 515
29 more
  1. 2015Importance Weighted Autoencoderscited by 454
  2. 2017Nonparametric regression using deep neural networks with ReLU activation functioncited by 431
  3. 2016Ladder Variational Autoencoderscited by 315
  4. 2017MMD GAN: Towards Deeper Understanding of Moment Matching Networkcited by 251
  5. 2016Benefits of depth in neural networkscited by 248
  6. 2017Optimal approximation of piecewise smooth functions using deep ReLU neural networkscited by 176
  7. 2017Generalization and Equilibrium in Generative Adversarial Nets (GANs)cited by 165
  8. 2020Minimum Width for Universal Approximationcited by 92
  9. 2018How Well Generative Adversarial Networks Learn Distributionscited by 78
  10. 2019Deep ReLU network approximation of functions on a manifoldcited by 73
  11. 2019Nonparametric Regression on Low-Dimensional Manifolds using Deep ReLU Networks : Function Approximation and Statistical Recoverycited by 73
  12. 2018Deep Neural Networks Learn Non-Smooth Functions Effectivelycited by 57
  13. 2018Posterior Concentration for Sparse Deep Learningcited by 50
  14. 2017On the Discrimination-Generalization Tradeoff in GANscited by 48
  15. 2017Reinterpreting Importance-Weighted Autoencoderscited by 36
  16. 2019Smooth function approximation by deep neural networks with general activation functionscited by 29
  17. 2017Approximation and Convergence Properties of Generative Adversarial Learningcited by 28
  18. 2018Approximability of Discriminators Implies Diversity in GANscited by 28
  19. 2020Some Theoretical Insights into Wasserstein GANscited by 28
  20. 2018Some Theoretical Properties of GANscited by 27
  21. 2020Statistical guarantees for generative models without dominationcited by 27
  22. 2020Nonconvex sparse regularization for deep neural networks and its optimalitycited by 21
  23. 2021Improved Autoregressive Modeling with Distribution Smoothingcited by 18
  24. 2019On the rate of convergence of fully connected very deep neural network regression estimatescited by 14
  25. 2020Generalization Properties of Optimal Transport GANs with Latent Distribution Learningcited by 13
  26. 2019Reweighted Expectation Maximizationcited by 9
  27. 2020Bounding the expectation of the supremum of empirical processes indexed by H"older classescited by 8
  28. 2019Structure-adaptive manifold estimationcited by 6
  29. 2020Minimax adaptive estimation in manifold inferencecited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 4; 2023: 2; 2024: 2; 2025: 3; 2026: 1.

12 papers.