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 \Big\{ \int_X \varphi d\mu + \int_Y \psi d\nu : \varphi(x) + \psi(y) \leq c(x,y) \Big\}  </math>
<math display="block"> \max \Big\{ \int_X \varphi d\mu + \int_Y \psi d\nu : \varphi(x) + \psi(y) \leq c(x,y) \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>.
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>. Now, we would like to extend this notion of the dual problem to the semidiscrete continuous, i.e., one of the two measures is discrete. Such a case can be reformulated as
 
<math display="block"> \max \Big\{ \int_X \varphi^c d\mu + \sum_j \varphi_j b_j  \Big\}  </math>

Revision as of 04:26, 2 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 . Now, we would like to extend this notion of the dual problem to the semidiscrete continuous, i.e., one of the two measures is discrete. Such a case can be reformulated as