Name
Abstract | ||
|---|---|---|
We study the problem of mean estimation for high-dimensional distributions, assuming access to a statistical query oracle for the distribution. For a normed space $X = (mathbb{R}^d, |cdot|_X)$ and a distribution supported on vectors $x mathbb{R}^d$ with $|x|_{X} leq 1$, the task is to output an estimate $hat{mu} mathbb{R}^d$ which is $epsilon$-close in the distance induced by $|cdot|_X$ to the true mean of the distribution. We obtain sharp upper and lower bounds for the statistical query complexity of this problem when the the underlying norm is symmetric as well as for Schatten-$p$ norms, answering two questions raised by Feldman, Guzmu0027{a}n, and Vempala (SODA 2017). |
Year | Venue | Field |
|---|---|---|
2019 | COLT | Discrete mathematics,Combinatorics,Normed vector space,Mean estimation,Upper and lower bounds,Oracle,Mathematics |
DocType | Volume | Citations |
Journal | abs/1902.02459 | 0 |
PageRank | References | Authors |
0.34 | 12 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jerry Li | 1 | 229 | 22.67 |
| Aleksandar Nikolov | 2 | 214 | 21.87 |
| Ilya P. Razenshteyn | 3 | 161 | 9.52 |
| Erik Waingarten | 4 | 30 | 8.74 |