Optimal transport for generative models
DOI10.1007/978-3-030-98661-2_105zbMATH Open1547.49035MaRDI QIDQ6606492FDOQ6606492
Authors: David Xianfeng Gu, Na Lei, Shing-Tung Yau 
Publication date: 16 September 2024
manifold learningoptimal transportconvex geometrygenerative adversarial networksMonge-Ampère equationexplainable deep learning
Optimal transportation (49Q22) Artificial neural networks and deep learning (68T07) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10) Monge-Ampère equations (35J96)
Cites Work
- Polar factorization and monotone rearrangement of vector‐valued functions
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- Regularity of potential functions of the optimal transportation problem
- Some regularity properties of solutions of Monge Ampère equation
- Variational principles for Minkowski type problems, discrete optimal transport, and discrete Monge-Ampère equations
- Minimizing Flows for the Monge--Kantorovich Problem
- On a problem of Monge
- The refractor problem in reshaping light beams
- Regularity properties of optimal maps between nonconvex domains in the plane
- On a Monge-Ampère equation arising in geometric optics
- On the design of a reflector antenna. II
- On the design of a reflector antenna
- Earth mover's distances on discrete surfaces
- A geometric view of optimal transportation and generative model
- Area-preserving mesh parameterization for poly-annulus surfaces based on optimal mass transportation
- Surface parameterization based on polar factorization
This page was built for publication: Optimal transport for generative models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606492)
