Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
4
votes
0
answers
108
views
Improving log-Sobolev inequalities via quadratic regularisation
Suppose that $\mu(dx) = \exp(-\psi(x)) \, \mathrm{dx}$ is a probability measure on $\mathbf{R}^d$.
For suitable functions $g \geqslant 0$, define
$$\text{Ent}(g) = \int \mu(dx) g(x) \log \left( \frac{ …
2
votes
1
answer
112
views
Reweighting probability measures by convex potentials, and contraction in transport distance
Let $W: \mathbf{R}^d \to \mathbf{R}$ be a convex function such that $\int \exp(-W) = 1$, and define probability measures $\mu_y$ by
$$\mu_y (dx) = \exp( - W (x - y)) \,dx,$$
i.e. each $\mu_y$ is a tra …
4
votes
0
answers
169
views
Transport Distance between Level Sets of a Convex Function
Suppose I have a well-behaved, strictly convex function $f : \mathbf{R}^d \to [0, \infty)$, and assume that $f$ has its unique minimiser at $x = 0$, with $f(0) = 0$.
For $y > 0$, I define the level …