Wasserstein proximal of GANs

DOI10.1007/978-3-030-80209-7_57MaRDI QIDQ2117893zbMATH OpenOpenAlexFDO

Authors Wuchen Li, Guido Montúfar, Alex Tong Lin, Stanley Osher

Publication date 22 March 2022

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

zbMATH Keywords

Wasserstein metricnatural gradientgenerative-adversarial networks

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites work

• Information geometry
• Information geometry and its applications
• Natural gradient via optimal transport
• Ricci curvature for parametric statistics via optimal transport
• Riemannian metrics for neural networks. I: Feedforward networks
• THE GEOMETRY OF DISSIPATIVE EVOLUTION EQUATIONS: THE POROUS MEDIUM EQUATION
• The Variational Formulation of the Fokker--Planck Equation

Cited in

(19)

• Computational mean-field information dynamics associated with reaction-diffusion equations
• Loss-sensitive generative adversarial networks on Lipschitz densities
• Neural parametric Fokker-Planck equation
• Deep JKO: time-implicit particle methods for general nonlinear gradient flows
• Generalized unnormalized optimal transport and its fast algorithms
• Some theoretical properties of GANs
• Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning
• Interacting Langevin diffusions: gradient structure and ensemble Kalman sampler
• Wasserstein information matrix
• Fast sinkhorn. II: Collinear triangular matrix and linear time accurate computation of optimal transport
• The Wasserstein metric matrix and its computational property
• Hessian transport gradient flows
• A kernel formula for regularized Wasserstein proximal operators
• Optimal neural network approximation of Wasserstein gradient direction via convex optimization
• Mean-field and kinetic descriptions of neural differential equations
• High order spatial discretization for variational time implicit schemes: Wasserstein gradient flows and reaction-diffusion systems
• Wasserstein Proximal of GANs
• Inferential Wasserstein Generative Adversarial Networks
• Efficient Natural Gradient Descent Methods for Large-Scale PDE-Based Optimization Problems

Describes a project that uses

Uses Software

• Wasserstein GAN

This page was built for publication: Wasserstein proximal of GANs

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