Skip to main content
added 327 characters in body
Source Link

(also asked on math.se, with no answers)

Suppose I have $m$ samples drawn from a Gaussian in $\mathbb{R}^n$, and need sample covariance $\Sigma_m$ to be $\epsilon$-close to true covariance $\Sigma$:

$$E\|\Sigma_m-\Sigma\| \le \epsilon \|\Sigma\|$$

Vershynin (High-Dimensional Probability Remark 5.6.3) gives the following sample requirement for arbitrary distribution in terms of intrinsic dimension $r=\text{tr}\ \Sigma/\|\Sigma\|$ $$m \approx \epsilon^{-2} r \log n$$

Is there a tighter bound for the Gaussian case? In particular, I'm wondering if $\log n$ term can be dropped

A simulation is here, it seems if we keep intrinsic dimensionality fixed, and sample size fixed, the error doesn't grow with dimensions.

enter image description here

notebook

(also asked on math.se, with no answers)

Suppose I have $m$ samples drawn from a Gaussian in $\mathbb{R}^n$, and need sample covariance $\Sigma_m$ to be $\epsilon$-close to true covariance $\Sigma$:

$$E\|\Sigma_m-\Sigma\| \le \epsilon \|\Sigma\|$$

Vershynin (High-Dimensional Probability Remark 5.6.3) gives the following sample requirement for arbitrary distribution in terms of intrinsic dimension $r=\text{tr}\ \Sigma/\|\Sigma\|$ $$m \approx \epsilon^{-2} r \log n$$

Is there a tighter bound for the Gaussian case? In particular, I'm wondering if $\log n$ term can be dropped

(also asked on math.se, with no answers)

Suppose I have $m$ samples drawn from a Gaussian in $\mathbb{R}^n$, and need sample covariance $\Sigma_m$ to be $\epsilon$-close to true covariance $\Sigma$:

$$E\|\Sigma_m-\Sigma\| \le \epsilon \|\Sigma\|$$

Vershynin (High-Dimensional Probability Remark 5.6.3) gives the following sample requirement for arbitrary distribution in terms of intrinsic dimension $r=\text{tr}\ \Sigma/\|\Sigma\|$ $$m \approx \epsilon^{-2} r \log n$$

Is there a tighter bound for the Gaussian case? In particular, I'm wondering if $\log n$ term can be dropped

A simulation is here, it seems if we keep intrinsic dimensionality fixed, and sample size fixed, the error doesn't grow with dimensions.

enter image description here

notebook

Notice removed Draw attention by CommunityBot
Bounty Ended with no winning answer by CommunityBot
Notice added Draw attention by Yaroslav Bulatov
Bounty Started worth 50 reputation by Yaroslav Bulatov
deleted 7 characters in body
Source Link

(also asked on math.se, with no answers)

Suppose I have $m$ samples drawn from a Gaussian in $\mathbb{R}^n$, and need sample covariance $\Sigma_m$ to be $\epsilon$-close to true covariance $\Sigma$:

$$E\|\Sigma_m-\Sigma\| \le \epsilon \|\Sigma\|$$

Vershynin (High-Dimensional Probability Remark 5.6.3) gives the following sample requirement for arbitrary distribution in terms of intrinsic dimension $r=\text{tr}\ \Sigma/\|\Sigma\|$ $$m \approx \epsilon^{-2} r \log n$$

Is there a tighter bound for the Gaussian case? In particular, I'm wondering if a dimension-free bound is possible.$\log n$ term can be dropped

(also asked on math.se, with no answers)

Suppose I have $m$ samples drawn from a Gaussian in $\mathbb{R}^n$, and need sample covariance $\Sigma_m$ to be $\epsilon$-close to true covariance $\Sigma$:

$$E\|\Sigma_m-\Sigma\| \le \epsilon \|\Sigma\|$$

Vershynin (High-Dimensional Probability Remark 5.6.3) gives the following sample requirement for arbitrary distribution in terms of intrinsic dimension $r=\text{tr}\ \Sigma/\|\Sigma\|$ $$m \approx \epsilon^{-2} r \log n$$

Is there a tighter bound for the Gaussian case? In particular, I'm wondering if a dimension-free bound is possible.

(also asked on math.se, with no answers)

Suppose I have $m$ samples drawn from a Gaussian in $\mathbb{R}^n$, and need sample covariance $\Sigma_m$ to be $\epsilon$-close to true covariance $\Sigma$:

$$E\|\Sigma_m-\Sigma\| \le \epsilon \|\Sigma\|$$

Vershynin (High-Dimensional Probability Remark 5.6.3) gives the following sample requirement for arbitrary distribution in terms of intrinsic dimension $r=\text{tr}\ \Sigma/\|\Sigma\|$ $$m \approx \epsilon^{-2} r \log n$$

Is there a tighter bound for the Gaussian case? In particular, I'm wondering if $\log n$ term can be dropped

edited title
Link

Dimension-free error boundsample complexity for estimating Gaussian sample covariance?

Source Link
Loading