English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We investigate the problem of pairwise multi-marginal optimal transport, thatis, given a collection of probability distributions $\{P_\alpha\}$ on a Polishspace $\mathcal{X}$, to find a coupling $\{X_\alpha\}$, $X_\alpha\simP_\alpha$, such that $\mathbf{E}[c(X_\alpha,X_\beta)]\le r\inf_{X\simP_\alpha,Y\sim P_\beta}\mathbf{E}[c(X,Y)]$ for all $\alpha,\beta$, where $c$ isa cost function and $r\ge1$. In other words, every pair $(X_\alpha,X_\beta)$has an expected cost at most a factor of $r$ from its lowest possible value.This can be regarded as a locality sensitive hash function for probabilitydistributions, and has applications such as robust and distributed computationof transport plans. It can also be considered as a bi-Lipschitz embedding ofthe collection of probability distributions into the space of random variablestaking values on $\mathcal{X}$. For $c(x,y)=\Vert x-y\Vert_2^q$ on$\mathbb{R}^n$, where $q>0$, we show that a finite $r$ is attainable if andonly if either $n=1$ or $0<q<1$. As $n\to\infty$, the growth rate of thesmallest possible $r$ is exactly $\Theta(n^{q/2})$ if $0<q<1$. Hence, themetric space of probability distributions on $\mathbb{R}^n$ with finite $q$-thabsolute moments, $0<q<1$, with the earth mover's distance (or 1-Wassersteindistance) with respect to the snowflake metric $c(x,y)=\Vert x-y\Vert_2^q$, isbi-Lipschitz embeddable into $L_1$ with distortion $O(n^{q/2})$. If we consider$c(x,y)=\Vert x-y\Vert_2$ (i.e., $q=1$) on the grid $[0..s]^n$ instead of$\mathbb{R}^n$, then $r=O(\sqrt{n}\log s)$ is attainable, which implies theembeddability of the space of probability distributions on $[0..s]^n$ into$L_1$ with distortion $O(\sqrt{n}\log s)$, and improves upon the $O(n\log s)$result by Indyk and Thaper. The case of the discrete metric cost$c(x,y)=\mathbf{1}\{x\neq y\}$ and more general metric and ultrametric costsare also investigated.

Pairwise Multi-marginal Optimal Transport and Embedding for Earth Mover's Distance