Skip to main content

All Questions

Filter by
Sorted by
Tagged with
40 votes
5 answers
5k views

"Entropy" proof of Brunn-Minkowski Inequality?

I read in an information theory textbook the Brunn-Minkowski inequality follows from the Entropy Power inequality. The first one says that if $A,B$ are convex polygons in $\mathbb{R}^d$, then $$ m(...
john mangual's user avatar
  • 22.8k
11 votes
1 answer
320 views

Conceptual explanation for the appearance of entropy in $\frac{d}{dp}\|x\|_p$

For $x\in \mathbb{R}^d$, an elementary computation yields that $$\frac{d}{dp}\log \|x\|_p =\frac{1}{p^2}\sum_{i=1}^d \frac{|x_i|^p}{\|x\|_p^p}\log \frac{|x_i|^p}{\|x\|_p^p}=-\frac{1}{p^2}\operatorname{...
tmh's user avatar
  • 775
9 votes
1 answer
385 views

A Generalized Version of Maximal Correlation and Hypercontractivity of Conditional Expectation Operator

Given a pair of random variables $(X,Y)$ over a product space $\mathcal{X}\times \mathcal{Y}$, the maximal correlation coefficient is defined as $$\rho_2(X;Y):=\sup\frac{\mathbb{E}[f(X)g(Y)]}{||f||_2||...
math-Student's user avatar
  • 1,109
8 votes
2 answers
540 views

Maximum entropy priors in infinite dimensional spaces

Is there an extension of maximum entropy probability distributions for function spaces? For $\mathbb{R}^n$ and discrete spaces, there is much literature about this problem under names such as "non-...
Nick Alger's user avatar
  • 1,160
5 votes
2 answers
631 views

Proving that a complicated function is eventually concave

I have a function $f:\mathbb{R}^+ \to \mathbb{R}^+$ that I want to prove is eventually concave - i.e. that there exists $\gamma _0 > 0$ such that for every $\gamma>\gamma_0$, $f(\gamma)$ is ...
Yair Carmon's user avatar
5 votes
1 answer
666 views

Question regarding divergence

Let $E$ be a closed and convex set of distributions on a finite set $A$. Let $P',Q'\notin E$ and let $P^{\star},Q^{\star}$ be their respective estimates in $E$ with respect to the KL-divergence, i.e.,...
Ashok's user avatar
  • 779
1 vote
0 answers
65 views

Normalizing constants preserve metric entropy

Suppose $\mathcal{F}=\left\{f\in L^2([a,b]): 0<\underline{c}\leq f\leq\overline{c} \right\}$. Consider the following transformation $$\tilde{\mathcal{F}} := \left\{\frac{f}{\int f d\mu}: f\in \...
lucaszz's user avatar
  • 11