Wasserstein distance between hyperplane and cube
$begingroup$
Let $mu$ be the uniform measure on the cube $Q = [-1,1]^n$, and $nu$ be the uniform measure on the surface
$$
V = {(x_1,dots,x_n)in Q mid sum x_i = 0}.
$$
I am curious about Wasserstein distance between $mu$ and $nu$, using the $l^infty$ distance on $mathbb{R}^n$.
That is, I would like a bound on
$$
sup_{|f|_{Lip}=1} |mathbb{E}_mu f - mathbb{E}_nu f|.
$$
I expect that the distance is on the order of $n^{-1/2}$ based on the following two calculations. First, one guess is that the function $S(x)=frac{1}{n}|sum x_i|$ would be close to optimizing the above supremum, and
$$
|mathbb{E}_mu S - mathbb{E}_nu S| leq Cn^{-1/2}.
$$
The second heuristic follows from the fact that if $xin Q$ is sampled according to $mu$, then with high probability $|sum x_i| leq Cn^{1/2}$, so by nudging each of the coefficients by an amount $n^{-1/2}$ it should be possible to land on the plane. This gives a transport map from $mu$ to a measure supported on $V$ that has cost roughly $n^{-1/2}$. The problem is that the transported measure is not the same as $nu$, so this does not constitute a proof.
probability-theory measure-theory concentration-of-measure optimal-transport
$endgroup$
add a comment |
$begingroup$
Let $mu$ be the uniform measure on the cube $Q = [-1,1]^n$, and $nu$ be the uniform measure on the surface
$$
V = {(x_1,dots,x_n)in Q mid sum x_i = 0}.
$$
I am curious about Wasserstein distance between $mu$ and $nu$, using the $l^infty$ distance on $mathbb{R}^n$.
That is, I would like a bound on
$$
sup_{|f|_{Lip}=1} |mathbb{E}_mu f - mathbb{E}_nu f|.
$$
I expect that the distance is on the order of $n^{-1/2}$ based on the following two calculations. First, one guess is that the function $S(x)=frac{1}{n}|sum x_i|$ would be close to optimizing the above supremum, and
$$
|mathbb{E}_mu S - mathbb{E}_nu S| leq Cn^{-1/2}.
$$
The second heuristic follows from the fact that if $xin Q$ is sampled according to $mu$, then with high probability $|sum x_i| leq Cn^{1/2}$, so by nudging each of the coefficients by an amount $n^{-1/2}$ it should be possible to land on the plane. This gives a transport map from $mu$ to a measure supported on $V$ that has cost roughly $n^{-1/2}$. The problem is that the transported measure is not the same as $nu$, so this does not constitute a proof.
probability-theory measure-theory concentration-of-measure optimal-transport
$endgroup$
add a comment |
$begingroup$
Let $mu$ be the uniform measure on the cube $Q = [-1,1]^n$, and $nu$ be the uniform measure on the surface
$$
V = {(x_1,dots,x_n)in Q mid sum x_i = 0}.
$$
I am curious about Wasserstein distance between $mu$ and $nu$, using the $l^infty$ distance on $mathbb{R}^n$.
That is, I would like a bound on
$$
sup_{|f|_{Lip}=1} |mathbb{E}_mu f - mathbb{E}_nu f|.
$$
I expect that the distance is on the order of $n^{-1/2}$ based on the following two calculations. First, one guess is that the function $S(x)=frac{1}{n}|sum x_i|$ would be close to optimizing the above supremum, and
$$
|mathbb{E}_mu S - mathbb{E}_nu S| leq Cn^{-1/2}.
$$
The second heuristic follows from the fact that if $xin Q$ is sampled according to $mu$, then with high probability $|sum x_i| leq Cn^{1/2}$, so by nudging each of the coefficients by an amount $n^{-1/2}$ it should be possible to land on the plane. This gives a transport map from $mu$ to a measure supported on $V$ that has cost roughly $n^{-1/2}$. The problem is that the transported measure is not the same as $nu$, so this does not constitute a proof.
probability-theory measure-theory concentration-of-measure optimal-transport
$endgroup$
Let $mu$ be the uniform measure on the cube $Q = [-1,1]^n$, and $nu$ be the uniform measure on the surface
$$
V = {(x_1,dots,x_n)in Q mid sum x_i = 0}.
$$
I am curious about Wasserstein distance between $mu$ and $nu$, using the $l^infty$ distance on $mathbb{R}^n$.
That is, I would like a bound on
$$
sup_{|f|_{Lip}=1} |mathbb{E}_mu f - mathbb{E}_nu f|.
$$
I expect that the distance is on the order of $n^{-1/2}$ based on the following two calculations. First, one guess is that the function $S(x)=frac{1}{n}|sum x_i|$ would be close to optimizing the above supremum, and
$$
|mathbb{E}_mu S - mathbb{E}_nu S| leq Cn^{-1/2}.
$$
The second heuristic follows from the fact that if $xin Q$ is sampled according to $mu$, then with high probability $|sum x_i| leq Cn^{1/2}$, so by nudging each of the coefficients by an amount $n^{-1/2}$ it should be possible to land on the plane. This gives a transport map from $mu$ to a measure supported on $V$ that has cost roughly $n^{-1/2}$. The problem is that the transported measure is not the same as $nu$, so this does not constitute a proof.
probability-theory measure-theory concentration-of-measure optimal-transport
probability-theory measure-theory concentration-of-measure optimal-transport
asked Jan 26 at 20:12
felipehfelipeh
1,606619
1,606619
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3088703%2fwasserstein-distance-between-hyperplane-and-cube%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3088703%2fwasserstein-distance-between-hyperplane-and-cube%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown