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
13 votes
1 answer
10k views

KL divergence and mixture of Gaussians

Do we have an exact formula to compute the KL divergence between 2 mixtures of Gaussians (i.e convex combinations of a finite number of Gaussian distributions)? If not exactly known, are there good ...
gradstudent's user avatar
  • 2,246
10 votes
2 answers
847 views

Minimum separation among $m$ random points on an $n$-dimensional unit sphere

Consider $m$ points $v_1, \ldots, v_m \in R^{n}$, which are uniformly distributed on the $n$-dimensional unit sphere $S^{n-1} = \{v:\|v\|_2 = 1\}$. Let the minimum separation be $$ \rho = \min_{i,j\in{...
Minkov's user avatar
  • 1,127