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 |
Theoretical and experimental aspects of information theory and coding theory. This tag covers but is not limited to following branches: information theory, information geometry, optimal transportation theory, coding theory.
1
vote
Size of KL-divergence neighbourhoods
Perhaps more a question for math.stackexchange.com.
Unless your probability space $(\Omega, \mathcal F)$ is trivial (i.e. $\mathcal F = \{ \emptyset, \Omega \})$, the sets $\mathbf P$ and $\mathbf Q …
1
vote
prove that flat shape maximizes a functional
Write $A / (G(\omega) + A) = f(\omega)$ and note that $f(\omega) > 0$ for all $\omega$. Also write $J[f] = I[G]$.
Multiplying $I[G]$ by the denominator gives $\left( \int_{-\kappa \pi}^{\kappa \pi} f …