Approximating Probability Distributions by Using Wasserstein Generative Adversarial Networks

DOI10.1137/22m149689xarXiv2103.10060OpenAlexW4388295184MaRDI QIDQ6090834

Michael Kwok-Po Ng, Yihang Gao, Unnamed Author

Publication date: 20 November 2023

Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.10060

zbMATH Keywords

capacityapproximationgeneralization errorGroupSort neural networksWasserstein GAN

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Error bounds for approximations with deep ReLU networks
• Central limit theorems for empirical transportation cost in general dimension
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Neural Network Learning
• On parameter estimation with the Wasserstein distance
• An Iterative Algorithm for Computing the Best Estimate of an Orthogonal Matrix
• Optimal Transport
• Approximation by superpositions of a sigmoidal function
• On the capacity of deep generative networks for approximating distributions

This page was built for publication: Approximating Probability Distributions by Using Wasserstein Generative Adversarial Networks