Semidiscrete Optimal Transport: Difference between revisions

From Optimal Transport Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 7: Line 7:
<math display="block"> \max_{(\varphi, \psi) \in R(c)} \Big\{ \int_X \varphi d\mu + \int_Y \psi d\nu \Big\}  </math>
<math display="block"> \max_{(\varphi, \psi) \in R(c)} \Big\{ \int_X \varphi d\mu + \int_Y \psi d\nu \Big\}  </math>


where <math> \mu, \nu </math> denote probability measures on domains <math> X, Y </math> respectively, and <math> c(x,y) </math> is a cost function defined over <math> X \times Y </math>. <math> R(c) </math> denotes the set of possible dual potentials, and the condition <math> \varphi(x) + \psi(y) \leq c(x,y) </math> is satisfied. It should also be noted that <math> \mu = f(x)dx </math>. Now, we would like to extend this notion of the dual problem to the semidiscrete case. Such a case can be reformulated as
where <math> \mu, \nu </math> denote probability measures on domains <math> X, Y </math> respectively, and <math> c(x,y) </math> is a cost function defined over <math> X \times Y </math>. <math> R(c) </math> denotes the set of possible dual potentials, and the condition <math> \varphi(x) + \psi(y) \leq c(x,y) </math> is satisfied. It should also be noted that <math> \mu = f(x)dx </math> to express the density of the measure. Now, we would like to extend this notion of the dual problem to the semidiscrete case. Such a case can be reformulated as


<math display="block"> \max_{\varphi \in \R^m} \Big\{ \int_X \varphi^c d\mu + \sum_j \varphi_j b_j  \Big\}.  </math>
<math display="block"> \max_{\varphi \in \R^m} \Big\{ \int_X \varphi^c d\mu + \sum_j \varphi_j b_j  \Big\}.  </math>


Aside from using a discrete measure in place of what was originally a continuous one, there are a few other notable distinctions within this reformulation. The first is that <math> \psi </math> is replaced completely with <math> \varphi </math>. The second is that <math> \varphi^c </math> denotes the c-transform of <math> \varphi </math>. The c-transform can be defined as <math> \varphi^c(x) := \min_j \{ c(x,y_j) - \varphi_j \} </math>.
Aside from using a discrete measure in place of what was originally a continuous one, there are a few other notable distinctions within this reformulation. The first is that <math> \psi </math> is replaced completely with <math> \varphi </math>. The second is that <math> \varphi^c </math> denotes the c-transform of <math> \varphi </math>. The c-transform can be defined as <math> \varphi^c(x) := \min_j \{ c(x,y_j) - \varphi_j \} </math>.

Revision as of 03:59, 3 June 2020

Semidiscrete optimal transport refers to situations in optimal transport where two input measures are considered, and one measure is a discrete measure and the other one is continuous. Hence, because only one of the two measures is discrete, we arrive at the appropriate name "semidiscrete."

Formulation of the Semidiscrete Dual Problem

In particular, we will examine semidiscrete optimal transport in the case of the dual problem. The general dual problem for continuous measures can be stated as

where denote probability measures on domains respectively, and is a cost function defined over . denotes the set of possible dual potentials, and the condition is satisfied. It should also be noted that to express the density of the measure. Now, we would like to extend this notion of the dual problem to the semidiscrete case. Such a case can be reformulated as

Aside from using a discrete measure in place of what was originally a continuous one, there are a few other notable distinctions within this reformulation. The first is that is replaced completely with . The second is that denotes the c-transform of . The c-transform can be defined as .