Deep generative models: complexity, dimensionality, and approximation
From MaRDI portal
machine learningapproximation theoryspace-filling curvegenerative adversarial networksmanifold hypothesis
Learning and adaptive systems in artificial intelligence (68T05) Artificial neural networks and deep learning (68T07) Computational aspects of data analysis and big data (68T09) Approximation by other special function classes (41A30) 2-dimensional topology (including mapping class groups of surfaces, Teichmüller theory, curve complexes, etc.) (57K20)
Cites work
- scientific article; zbMATH DE number 3960432 (Why is no real title available?)
- scientific article; zbMATH DE number 52737 (Why is no real title available?)
- scientific article; zbMATH DE number 3533448 (Why is no real title available?)
- A localization property of viscosity solutions to the Monge-Ampère equation and their strict convexity
- Boundary regularity of maps with convex potentials
- Boundary regularity of maps with convex potentials. II
- Interior \(W^{2,p}\) estimates for solutions of the Monge-Ampère equation
- Multilayer feedforward networks are universal approximators
- On the Volume of Tubes
- On the capacity of deep generative networks for approximating distributions
- Optimal Transport
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- Some regularity properties of solutions of Monge Ampère equation
- Statistical guarantees for generative models without domination
- Testing the manifold hypothesis
- The Regularity of Mappings with a Convex Potential
- Tubes
- Visual Feature Extraction by a Multilayered Network of Analog Threshold Elements
This page was built for publication: Deep generative models: complexity, dimensionality, and approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6887414)
