Efficient Multivariate Robust Mean Estimation Under Mean-Shift Contamination
Ilias Diakonikolas, Giannis Iakovidis, Daniel M. Kane, Thanasis Pittas

TL;DR
This paper introduces a computationally efficient algorithm for high-dimensional robust mean estimation under mean-shift contamination, achieving near-optimal sample complexity and accuracy, addressing a key challenge in robust statistics.
Contribution
It presents the first polynomial-time algorithm for robust mean estimation with mean-shift contamination that can handle a constant fraction of outliers.
Findings
Algorithm runs in polynomial time in sample size and dimension.
Achieves near-optimal sample complexity for the problem.
Successfully approximates the true mean despite mean-shift contamination.
Abstract
We study the algorithmic problem of robust mean estimation of an identity covariance Gaussian in the presence of mean-shift contamination. In this contamination model, we are given a set of points in generated i.i.d. via the following process. For a parameter , the -th sample is obtained as follows: with probability , is drawn from , where is the target mean; and with probability , is drawn from , where is unknown and potentially arbitrary. Prior work characterized the information-theoretic limits of this task. Specifically, it was shown that, in contrast to Huber contamination, in the presence of mean-shift contamination consistent estimation is possible. On the other hand, all known robust estimators in the mean-shift model have running times…
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
Taxonomy
TopicsAdvanced Statistical Methods and Models · Fault Detection and Control Systems · Advanced Statistical Process Monitoring
MethodsSparse Evolutionary Training
