Approximating Probability Distributions by Using Wasserstein Generative Adversarial Networks

DOI10.1137/22M149689XMaRDI QIDQ6090834zbMATH OpenOpenAlexFDO

Authors Yihang Gao, Michael Ng

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

Computational learning theory (68Q32) Analysis of algorithms (68W40)

Abstract: Studied here are Wasserstein generative adversarial networks (WGANs) with GroupSort neural networks as their discriminators. It is shown that the error bound of the approximation for the target distribution depends on the width and depth (capacity) of the generators and discriminators and the number of samples in training. A quantified generalization bound is established for the Wasserstein distance between the generated and target distributions. According to the theoretical results, WGANs have a higher requirement for the capacity of discriminators than that of generators, which is consistent with some existing results. More importantly, the results with overly deep and wide (high-capacity) generators may be worse than those with low-capacity generators if discriminators are insufficiently strong. Numerical results obtained using Swiss roll and MNIST datasets confirm the theoretical results.

Cites work

• scientific article; zbMATH DE number 7370595 (Why is no real title available?)
• scientific article; zbMATH DE number 7626743 (Why is no real title available?)
• An Iterative Algorithm for Computing the Best Estimate of an Orthogonal Matrix
• Approximation by superpositions of a sigmoidal function
• 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
• Error bounds for approximations with deep ReLU networks
• Neural Network Learning
• On parameter estimation with the Wasserstein distance
• On the capacity of deep generative networks for approximating distributions
• Optimal Transport

Cited in

(6)

• Loss-sensitive generative adversarial networks on Lipschitz densities
• scientific article; zbMATH DE number 7626743 (Why is no real title available?)
• Quasi-Random Sampling for Multivariate Distributions via Generative Neural Networks
• Inferential Wasserstein Generative Adversarial Networks
• scientific article; zbMATH DE number 7306864 (Why is no real title available?)
• Distribution estimation for time series via DNN-based GANs with an application to change-point estimation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090834)