Outlier-robust Mean Estimation near the Breakdown Point via Sum-of-Squares

We revisit the problem of estimating the mean of a high-dimensional distribution in the presence of an -fraction of adversarial outliers. When is at most some sufficiently small constant, previous works can achieve optimal error rate efficiently [DKK + 18, KSS18]. As approaches the breakdown point 1 2 , all previous algorithms incur either sub-optimal error rates or exponential running time.

In this paper we give a new analysis of the canonical sum-of-squares program introduced in [KSS18] and show that this program efficiently achieves optimal error rate for all ∈ [0, 12 ). The key ingredient for our results is a new identifiability proof for robust mean estimation that focuses on the overlap between the distributions instead of their statistical distance as in previous works. We capture this proof within the sumof-squares proof system, thus obtaining efficient algorithms using the sum-of-squares proofs to algorithms paradigm [RSS18].