2019
DOI: 10.1016/j.cagd.2018.10.005
|View full text |Cite
|
Sign up to set email alerts
|

A geometric view of optimal transportation and generative model

Abstract: In this work, we show the intrinsic relations between optimal transportation and convex geometry, especially the variational approach to solve Alexandrov problem: constructing a convex polytope with prescribed face normals and volumes. This leads to a geometric interpretation to generative models, and leads to a novel framework for generative models.By using the optimal transportation view of GAN model, we show that the discriminator computes the Kantorovich potential, the generator calculates the transportati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
46
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
6
4

Relationship

1
9

Authors

Journals

citations
Cited by 95 publications
(46 citation statements)
references
References 45 publications
0
46
0
Order By: Relevance
“…Gu [41] proposed a discrete spherical optimal transportation mapping based on a purely geometric method and defined the measures as areas to achieve an area-preserving mapping from the topological sphere to the unit sphere [42,43]. The mapping is global and has been applied in biomedicine [44,45], face recognition [46], generative adversarial networks [47], and other fields.…”
Section: Theory and Methodsmentioning
confidence: 99%
“…Gu [41] proposed a discrete spherical optimal transportation mapping based on a purely geometric method and defined the measures as areas to achieve an area-preserving mapping from the topological sphere to the unit sphere [42,43]. The mapping is global and has been applied in biomedicine [44,45], face recognition [46], generative adversarial networks [47], and other fields.…”
Section: Theory and Methodsmentioning
confidence: 99%
“…In theory, we need to first study whether there exists an optimal map for the manifold setting. For optimal mass transport on realvalued data, (Evans 1997;Villani 2008;Lei et al 2017) proved the existence of the optimal map, which has a convex potential (i.e. D(x) = ∇φ(x) with φ(x) being convex) and is shown to be the only map with the convex potential.…”
Section: Problem Formulationmentioning
confidence: 99%
“…Gu et al utilize Optimal Transportation and Monge-Ampere equation to theoretically interpret deep learning and GAN [51]- [53]. They show the intrinsic relations between optimal transportation and convex geometry, the generator calculates the transportation map while the discriminator computes the Kantorovich potential [52].…”
Section: B Generative Adversarial Networkmentioning
confidence: 99%