Optimal 1-Wasserstein distance for WGANs

DOI10.3150/23-bej1701zbMATH Open1545.60037MaRDI QIDQ6589580

Nicolas Klutchnikoff, Gérard Biau, Benoît Cadre, Ugo Tanielian, Arthur Stephanovitch

Publication date: 20 August 2024

Published in: Bernoulli (Search for Journal in Brave)

zbMATH Keywords

rate of convergenceshortest pathWasserstein distanceoptimal distributionoptimal transport theoryWasserstein generative adversarial networks (WGANs)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Limit theorems in probability theory (60F99) Optimal transportation (49Q22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the rate of convergence in Wasserstein distance of the empirical measure
• On the equality between Monge's infimum and Kantorovich's minimum in optimal mass transportation
• On the influence of the extremes of an i.i.d. sequence on the maximal spacings
• Minkowski-type theorems and least-squares clustering
• Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
• Optimally solving a transportation problem using Voronoi diagrams
• Integral Probability Metrics and Their Generating Classes of Functions
• Testing the manifold hypothesis
• Optimal Transport
• Reversible Gromov-Monge sampler for simulation-based inference

This page was built for publication: Optimal 1-Wasserstein distance for WGANs