Semidiscrete Optimal Transport: Difference between revisions

From Optimal Transport Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 29: Line 29:
Finding the weights via the above method is equivalent to maximizing <math> \mathcal{E}(\varphi) </math>, and we may do this by taking the partial derivatives of this function with respect to <math> \varphi_j </math>. Hence, because of such indexing, this is the same as taking the gradient of <math> \mathcal{E}(\varphi) </math>. In partial derivative form, we have
Finding the weights via the above method is equivalent to maximizing <math> \mathcal{E}(\varphi) </math>, and we may do this by taking the partial derivatives of this function with respect to <math> \varphi_j </math>. Hence, because of such indexing, this is the same as taking the gradient of <math> \mathcal{E}(\varphi) </math>. In partial derivative form, we have


<math display="block"> \frac{\partial \mathcal{E} }{\partial \varphi_j} = - \int_{V_{\varphi}(j)} f(x)dx + b_j </math>
<math display="block"> \frac{\partial \mathcal{E} }{\partial \varphi_j} = - \int_{V_{\varphi}(j)} f(x)dx + b_j </math>,
 
and in gradient form, we have
 
<math display="block"> \grad \mathcal{E}(\varphi)_j = - \int_{V_{\varphi}(j)} f(x)dx + b_j .</math>

Revision as of 23:10, 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 has a density. 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 .


Voronoi cells to find weights

Now, we will establish the notion of Voronoi cells. The Voronoi cells refer to a special subset of , and the reason we are interested in such a subset is because we can use the Voronoi cells as a domain to find the weights that we established in our reformulation of the dual problem. In particular, if we denote the set of Voronoi cells as , we can find our weights using the fact . Recall that refers to a density of the measure , i.e., . We define the Voronoi cells with

We use to denote an index for all components of that are not , i.e., . Furthermore, we use the specific cost function here. This is a special case and we may generalize to other cost functions if we desire. Now that we've defined , we may use this as our domain of integration to find weights .

A final thing to note is that another name for Voronoi cells is Laguerre cells.


Finding the weights via the gradient

Finding the weights via the above method is equivalent to maximizing , and we may do this by taking the partial derivatives of this function with respect to . Hence, because of such indexing, this is the same as taking the gradient of . In partial derivative form, we have

,

and in gradient form, we have

Failed to parse (unknown function "\grad"): {\displaystyle \grad \mathcal{E}(\varphi)_j = - \int_{V_{\varphi}(j)} f(x)dx + b_j .}