All Questions
11 questions
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(...
26
votes
3
answers
11k
views
L1 distance between gaussian measures
L1 distance between gaussian measures: Definition
Let $P_1$ and $P_0$ be two gaussian measures on $\mathbb{R}^p$ with respective "mean,Variance" $m_1,C_1$ and $m_0,C_0$ (I assume matrices have full ...
22
votes
1
answer
1k
views
Random distance matrices
My question is motivated by the following recent paper:
Gadgil, Siddhartha; Krishnapur, Manjunath, Lipschitz correspondence between metric measure spaces and random distance matrices, Int. Math. Res. ...
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 ...
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{...
10
votes
1
answer
484
views
Stochastic Covering Number of a Convex Set
Consider a convex set, say $S = [0,1]^d$. Let $X_1, X_2,\ldots,X_n, \ldots$ be i.i.d. random variables that are uniformly distributed on $S$. Denote the Euclidean ball centered at $x \in \mathbb{R}^d$ ...
9
votes
2
answers
560
views
Integrating a simple exponential over the space of matrices that define a metric
I want to interpret an $n\times n$ matrix $D$ as a set of pairwise distances, and assume that $D$ obeys metric properties. Namely, $D_{ii} = 0$, $D_{ij} \geq 0$, $D_{ij} = D_{ji}$ and $D_{ij} \leq D_{...
9
votes
2
answers
674
views
Small crown probabilities (and infinite dimensional margin assumption)
My question is:
How do I find sharp upper bounds on $P(|q|\leq \epsilon)$ uniformly over a set of gaussian polynomes $q$ of degree two.
Notations and definitions (to make the question rigorous)
Let ...
5
votes
2
answers
1k
views
Inequality involving probability measures [closed]
I have been working on a problem(alternate minimization) where I want to establish an inequality in which I am stuck.
An $\alpha$- parameterized version of the divergence(Kullback-Leibler) takes the ...
4
votes
0
answers
156
views
Geometric meaning of the chi-square "measure of association"
In Statistics, there's a standard test of independence of two random variables taking values in finite sets $I,J$. It relies on the computation of $\chi$-square statistics,
$$
\chi^2:=\sum_{(i,j)\in ...
3
votes
1
answer
187
views
Moment matching on the standard simplex
Let $\vec{\mu}_1, \vec{\mu}_2,\ldots, \vec{\mu}_k \in \Delta^{d-1}$ be $k\ (k\geq 2)$ distinct vectors on the standard simplex, where
$$\Delta^{d-1} = \{\vec{\mu}\in R^{d}:\| \vec{\mu}\|_1 = 1,\mu_j \...