The Sample Complexity of Robust Covariance Testing
@article{Diakonikolas2020TheSC, title={The Sample Complexity of Robust Covariance Testing}, author={Ilias Diakonikolas and D. Kane}, journal={ArXiv}, year={2020}, volume={abs/2012.15802} }
We study the problem of testing the covariance matrix of a high-dimensional Gaussian in a robust setting, where the input distribution has been corrupted in Huber’s contamination model. Specifically, we are given i.i.d. samples from a distribution of the form Z = (1− ǫ)X + ǫB, where X is a zero-mean and unknown covariance Gaussian N (0,Σ), B is a fixed but unknown noise distribution, and ǫ > 0 is an arbitrarily small constant representing the proportion of contamination. We want to distinguish… CONTINUE READING
References
SHOWING 1-10 OF 51 REFERENCES
Robust Estimators in High Dimensions without the Computational Intractability
- Computer Science, Mathematics
- 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
- 2016
- 199
- PDF
Agnostic Estimation of Mean and Covariance
- Computer Science, Mathematics
- 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
- 2016
- 197
- PDF
Optimal Algorithms for Testing Closeness of Discrete Distributions
- Computer Science, Mathematics
- SODA
- 2014
- 156
- PDF
A New Approach for Testing Properties of Discrete Distributions
- Mathematics, Computer Science
- 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
- 2016
- 105
- PDF
Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures
- Mathematics, Computer Science
- 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
- 2017
- 108
- Highly Influential
- PDF
Sample-Optimal Identity Testing with High Probability
- Mathematics, Computer Science
- Electron. Colloquium Comput. Complex.
- 2017
- 41
- PDF
Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions
- Mathematics, Computer Science
- 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
- 2015
- 39
- PDF