Constructive Universal High-Dimensional Distribution Generation through Deep ReLU Networks
Dmytro Perekrestenko, Stephan Müller, Helmut Bölcskei
Abstract
We present an explicit deep neural network construction that transforms uniformly distributed one-dimensional noise into an arbitrarily close approximation of any two-dimensional Lipschitz-continuous target distribution. The key ingredient of our design is a generalization of the "space-filling" property of sawtooth functions discovered in (Bailey & Telgarsky, 2018). We elicit the importance of depth - in our neural network construction - in driving the Wasserstein distance between the target distribution and the approximation realized by the network to zero. An extension to output distributions of arbitrary dimension is outlined. Finally, we show that the proposed construction does not incur a cost - in terms of error measured in Wasserstein-distance - relative to generating -dimensional target distributions from independent random variables.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3bed3d96-67b6-40be-b6d3-fcdc5f6cea43Cited by top-tier papers3
- Normalizing flow neural networks by JKO schemeChen Xu, Xiuyuan Cheng, Yao XieNeurIPS 2023 · 51 citations
- Learnability of high-dimensional targets by two-parameter models and gradient flowDmitry YarotskyNeurIPS 2024 · 2 citations
- Latent State Marginalization as a Low-cost Approach for Improving ExplorationDinghuai Zhang, Aaron C. Courville, Yoshua Bengio, Qinqing Zheng et al.ICLR 2023 · 1 citation
Related papers
- A Universal Approximation Theorem of Deep Neural Networks for Expressing Probability DistributionsYulong Lu, Jianfeng LuNeurIPS 2020 · 146 citations
- Latent Dimension Suffices for Universal Approximation of Permutation-invariant FunctionMin ZHOU, Enming Liang, Minghua ChenICML 2026
- On Enhancing Expressive Power via Compositions of Single Fixed-Size ReLU NetworkShijun Zhang, Jianfeng Lu, Hongkai ZhaoICML 2023 · 9 citations
- Learning (Very) Simple Generative Models Is HardSitan Chen, Jerry Li, Yuanzhi LiNeurIPS 2022 · 12 citations
- Constant-Expansion Suffices for Compressed Sensing with Generative PriorsConstantinos Daskalakis, Dhruv Rohatgi, Emmanouil ZampetakisNeurIPS 2020 · 16 citations
