CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Robust Sparse Mean Estimation via Incremental Learning
Authors
Rui Ray Chen
Salar Fattahi
+3Â more
Yinghui He
Wei Hu
Jianhao Ma
Publication date
24 May 2023
Publisher
View
on
arXiv
Abstract
In this paper, we study the problem of robust sparse mean estimation, where the goal is to estimate a
k
k
k
-sparse mean from a collection of partially corrupted samples drawn from a heavy-tailed distribution. Existing estimators face two critical challenges in this setting. First, they are limited by a conjectured computational-statistical tradeoff, implying that any computationally efficient algorithm needs
Ω
~
(
k
2
)
\tilde\Omega(k^2)
Ω
~
(
k
2
)
samples, while its statistically-optimal counterpart only requires
O
~
(
k
)
\tilde O(k)
O
~
(
k
)
samples. Second, the existing estimators fall short of practical use as they scale poorly with the ambient dimension. This paper presents a simple mean estimator that overcomes both challenges under moderate conditions: it runs in near-linear time and memory (both with respect to the ambient dimension) while requiring only
O
~
(
k
)
\tilde O(k)
O
~
(
k
)
samples to recover the true mean. At the core of our method lies an incremental learning phenomenon: we introduce a simple nonconvex framework that can incrementally learn the top-
k
k
k
nonzero elements of the mean while keeping the zero elements arbitrarily small. Unlike existing estimators, our method does not need any prior knowledge of the sparsity level
k
k
k
. We prove the optimality of our estimator by providing a matching information-theoretic lower bound. Finally, we conduct a series of simulations to corroborate our theoretical findings. Our code is available at https://github.com/huihui0902/Robust_mean_estimation
Similar works
Full text
Available Versions
arXiv.org e-Print Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:arXiv.org:2305.15276
Last time updated on 26/05/2023