Théo Dumont
D., Lacombe, Vialard. On the Existence of Monge maps for the Gromov-Wasserstein problem, FoCM 2024
slides available at https://slides.com/theodumont/monge-gw
Gaspard Monge
Leonid Kantorovitch
[Monge, 1781], [Kantorovitch, 1942]
A "continuous" measure dμ(x)=f(x)dx.
(has a density w.r.t. the Lebesgue measure dx).
A discrete measure μ=∑i=1naiδxi.
Introduction
[Monge, 1781], [Kantorovitch, 1942]
A "continuous" measure dμ(x)=f(x)dx.
(has a density w.r.t. the Lebesgue measure dx)
A discrete measure μ=∑i=1naiδxi.
for a continuous measure:
for a discrete measure:
Introduction
[Monge, 1781], [Kantorovitch, 1942]
OT problem (Monge)
Optimal transport
OT problem (Monge)
[Monge, 1781], [Kantorovitch, 1942]
Optimal transport
graph of T: {(x,T(x))∣x∈X}⊂X×Y
OT problem (Monge)
OT problem (Kantorovitch)
not feasible by a map!
π is induced by a transport map T
π is a transport plan
relaxation
[Monge, 1781], [Kantorovitch, 1942]
Optimal transport
OT problem (Kantorovitch)
[Monge, 1781], [Kantorovitch, 1942]
Optimal transport
Brenier's theorem
When X=Y=Rn and c(x,y)=∥x−y∥2, if μ≪dx, then there is a unique solution to (KP), and it is induced by a map T=∇f with f:Rn→R convex.
relaxation
π is induced by a transport map T
π is a transport plan
Monge (maps)
Kantorovitch (plans)
[Brenier, 1987]
Can we say that the solution of (KP) is a map?
?
generalizations to complete Riemannian manifolds X and Y and other cost functions c?
?
Optimal transport
Yann Brenier
Robert McCann
Cédric Villani
Map solutions of OT
Twist condition
We say that c satisfies the twist condition if
for all x0∈X,y↦∇xc(x0,y)∈Tx0X is injective.
Suppose this is satisfied. If μ≪dx, then (KP) admits a unique solution and it is supported on the graph of a map which is the gradient of a c-convex function f:X→R:
π⋆=(id,c-expx(∇f))∗μ.
[Gangbo, 1996], [Villani, 2008], [McCann and Guillen, 2011]
Map solutions of OT
Subtwist condition
We say that c satisfies the subtwist condition if
for all y1=y2,x↦c(x,y1)−c(x,y2) has at most 2 critical points.
Suppose this is satisfied. If μ≪dx, then (KP) admits a unique solution and it is supported on the union of a graph and an anti-graph:
π⋆=(id,G)∗μˉ+(H,id)∗(ν−G∗μˉ).
[Ahmad et al., 2011], [Chiappori et al., 2010]
Map solutions of OT
m-twist condition
We say that c satisfies the m-twist condition if
for all x0,y0,card{y∣∇xc(x0,y)=∇xc(x0,y0)}≤m.
Suppose this is satisfied and c is bounded. If μ≪dx, then optimals plans of (KP) are supported on the graphs of m maps:
π⋆=i=1∑mαi(id,Ti)∗μ.
in the sense π⋆(S)=∑i∫Xαi(x)χS(x,Ti(x))dμ for any Borel S⊂X×Y.
[Moameni, 2016]
Map solutions of OT
twist
map
⟹
subtwist
map/anti-map
⟹
m-twist
m-map
⟹
(for simplicity, when μ≪dx and μ,ν have compact support)
for linear OT problem:
Map solutions of OT
Karl-Theodor Sturm
Facundo Mémoli
Mikhaïl Gromov
[Sturm, 2012]
Wasserstein:
Gromov-Wasserstein:
cost function
c:X×Y→R
cost functions
cX:X×X→R
cY:Y×Y→R
The Gromov-Wasserstein problem
The Gromov-Wasserstein problem
[Sturm, 2012]
GW problem
?
optimal plans = maps?
[Alvares-Melis et al., 2019], [Vayer, 2020], [Sturm, 2012], [D., Lacombe & Vialard, 2023]
μ≪dx and μ,ν with compact support
There is an optimal map!
There is an optimal 2-map!
(i) Inner product case, cX=cY=⟨⋅,⋅⟩
(ii) Squared distance case, cX=cY=∥⋅−⋅∥2
X=Y=Rn
?
Can we simply apply the twist conditions? No....
for linear OT problems:
Optimal maps for GW
quadratic
Optimal maps for GW
symmetric
bilinear
Idea: relax into linear problem and try to apply twist conditions
[D., Lacombe & Vialard, 2023]
First order optimality condition:
π⋆ minimizes π↦F(π,π) π⋆ minimizes π↦2F(π,π⋆)
Good news: we now have a OT problem with cost Cπ⋆!
:)
twist conditions for Cπ⋆? not always, need something more general
:(
[D., Lacombe & Vialard, 2023]
"Let μ,ν∈P(E).
A more general twist condition
[D., Lacombe & Vialard, 2023]
"Let μ,ν∈P(E). If we can send μ and ν in a space B by a map φ:E→B,
A more general twist condition
[D., Lacombe & Vialard, 2023]
"Let μ,ν∈P(E). If we can send μ and ν in a space B by a map φ:E→B, such that c(x,y)=c~(φ(x),φ(y))for all x,y∈E with c~ a twisted cost on B,
A more general twist condition
[D., Lacombe & Vialard, 2023]
"Let μ,ν∈P(E). If we can send μ and ν in a space B by a map φ:E→B, such that c(x,y)=c~(φ(x),φ(y))for all x,y∈E with c~ a twisted cost on B, then we can construct an optimal map between μ and ν."
A more general twist condition
[D., Lacombe & Vialard, 2023]
A more general twist condition
twist
map
⟹
subtwist
map/anti-map
⟹
m-twist
m-map
⟹
(for simplicity, when μ≪dx and μ,ν have compact support)
A more general twist condition
our general condition
for linear OT problem:
[D., Lacombe & Vialard, 2023]
(i) Inner product case, cX=cY=⟨⋅,⋅⟩
OT problem with cost
Cπ⋆(x,y)=−⟨M⋆x,y⟩
where M⋆=∫x′y′⊤dπ(x′,y′)
⟹
⟹
satisfies our general condition
⟹
there exists an optimal map
μ≪dx and μ,ν with compact support
X=Y=Rn
linearize
+ some structure!
T(u,v)=(∇f∘M⋆(u),∇gu(v))
Does it satisfy our general condition?
Optimal maps for GW
Optimal maps for GW
[D., Lacombe & Vialard, 2023]
(i) Inner product case, cX=cY=⟨⋅,⋅⟩
(ii) Squared distance case, cX=cY=∥⋅−⋅∥2
OT problem with cost
Cπ⋆(x,y)=−⟨M⋆x,y⟩
where M⋆=∫x′y′⊤dπ(x′,y′)
⟹
⟹
satisfies our general condition
⟹
there exists an optimal map
OT problem with cost
Cπ⋆(x,y)=−∥x∥2∥y∥2−4⟨M⋆x,y⟩
where M⋆=∫x′y′⊤dπ(x′,y′)
⟹
⟹
sometimes satisfies our general condition,
sometimes satisfies 2-twist
⟹
there exists an optimal 2-map
X=Y=Rn
linearize
linearize
+ if rk(M⋆)≤n−2, there exists an optimal map!
μ≪dx and μ,ν with compact support
Summary
[D., Lacombe & Vialard, 2023]
There is an optimal map!
There is an optimal 2-map!
(i) Inner product case, cX=cY=⟨⋅,⋅⟩
(ii) Squared distance case, cX=cY=∥⋅−⋅∥2
Conjecture (computational):
this result is tight: there exists cases where no optimal plan is a map
Additional study of 1D case:
X=Y=Rn
μ≪dx and μ,ν with compact support
Ahmad, N., Kim, H. K., and McCann, R. J. (2011). Optimal transportation, topology and uniqueness.
Alvarez-Melis, D., Jegelka, S., and Jaakkola, T. S. (2019). Towards optimal transport with global invariances.
Beinert, R., Heiss, C., and Steidl, G. (2022). On assignment problems related to gromov-wasserstein distances on the real line.
Brenier, Y. (1987). Décomposition polaire et réarrangement monotone des champs de vecteurs
Dumont, T., Lacombe, T., and Vialard, F.-X. (2023). On the Existence of Monge maps for the Gromov-Wasserstein problem.
Fontbona, J., Guérin, H., and Méléard, S. (2010). Measurability of optimal transportation and strong coupling of martingale measures.
Gangbo, W., & McCann, R. J. (1996). The geometry of optimal transportation.
Kantorovich, L. (1942). On the translocation of masses.
McCann, R. J. and Guillen, N. (2011). Five lectures on optimal transportation: geometry, regularity and applications.
Mémoli, F. (2011). Gromov–wasserstein distances and the metric approach to object matching.
Moameni, A. (2016). A characterization for solutions of the monge-kantorovich mass transport problem.
Séjourné, T., Vialard, F.-X., and Peyré, G. (2021). The unbalanced gromov wasserstein distance: Conic formulation and relaxation.
Sturm, K.-T. (2020). The space of spaces: curvature bounds and gradient flows on the space of metric measure spaces.
Vayer, T. (2020). A contribution to optimal transport on incomparable spaces
Villani, C. (2008). Optimal transport: old and new, volume 338.
slides available at https://slides.com/theodumont/monge-gw
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
References
[D., Lacombe & Vialard, 2023]
There always is an optimal 2-map!
(ii) Squared distance case, cX=cY=∥⋅−⋅∥2
Conjecture (computational):
this result is tight: there exists cases where no optimal plan is a map
μ≪L and μ,ν with compact support
X=Y=Rn
?
Can we say better? i.e.
"There always exists an optimal map"?
Sharpness