Robust Mean Estimation on Highly Incomplete Data with Arbitrary Outliers

August 18, 2020 Β· Declared Dead Β· πŸ› International Conference on Artificial Intelligence and Statistics

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Lunjia Hu, Omer Reingold arXiv ID 2008.08071 Category cs.DS: Data Structures & Algorithms Cross-listed cs.LG, math.ST, stat.ML Citations 7 Venue International Conference on Artificial Intelligence and Statistics Last Checked 4 months ago
Abstract
We study the problem of robustly estimating the mean of a $d$-dimensional distribution given $N$ examples, where most coordinates of every example may be missing and $\varepsilon N$ examples may be arbitrarily corrupted. Assuming each coordinate appears in a constant factor more than $\varepsilon N$ examples, we show algorithms that estimate the mean of the distribution with information-theoretically optimal dimension-independent error guarantees in nearly-linear time $\widetilde O(Nd)$. Our results extend recent work on computationally-efficient robust estimation to a more widely applicable incomplete-data setting.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted