Nearly Optimal Robust Covariance and Scatter Matrix Estimation Beyond Gaussians
Gleb Novikov

TL;DR
This paper introduces a computationally efficient method for robustly estimating covariance matrices of elliptical distributions in high dimensions, extending beyond Gaussian assumptions with near-optimal error guarantees.
Contribution
We propose a novel polynomial-time algorithm for robust covariance estimation of elliptical distributions, achieving near-optimal error bounds under mild assumptions and extending beyond Gaussian cases.
Findings
Achieves near-optimal error bounds with high probability
Extends robust covariance estimation to non-Gaussian elliptical distributions
Introduces a spectral covariance filtering algorithm with sum-of-squares relaxations
Abstract
We study the problem of computationally efficient robust estimation of the covariance/scatter matrix of elliptical distributions -- that is, affine transformations of spherically symmetric distributions -- under the strong contamination model in the high-dimensional regime , where is the dimension and is the fraction of adversarial corruptions. We propose an algorithm that, under a very mild assumption on the scatter matrix , and given a nearly optimal number of samples , computes in polynomial time an estimator such that, with high probability, \[ \left\| \Sigma^{-1/2} \hat{\Sigma} \Sigma^{-1/2} - Id \right\|_{\text F} \le O(\varepsilon \log(1/\varepsilon))\,. \] As an application of our result, we obtain the first efficiently computable, nearly optimal robust covariance estimators…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptical Polarization and Ellipsometry · Remote-Sensing Image Classification · Underwater Acoustics Research
