Outlier-Robust Sparse Estimation via Non-Convex Optimization release_zpa3gn6hzzcbdmtnoc5jjrxjde

by Yu Cheng, Ilias Diakonikolas, Daniel M. Kane, Rong Ge, Shivam Gupta, Mahdi Soltanolkotabi

Released as a article .

2021  

Abstract

We explore the connection between outlier-robust high-dimensional statistics and non-convex optimization in the presence of sparsity constraints, with a focus on the fundamental tasks of robust sparse mean estimation and robust sparse PCA. We develop novel and simple optimization formulations for these problems such that any approximate stationary point of the associated optimization problem yields a near-optimal solution for the underlying robust estimation task. As a corollary, we obtain that any first-order method that efficiently converges to stationarity yields an efficient algorithm for these tasks. The obtained algorithms are simple, practical, and succeed under broader distributional assumptions compared to prior work.
In text/plain format

Archived Files and Locations

application/pdf  770.3 kB
file_kbx66m2xijebnoniq52u65r5fu
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2021-09-23
Version   v1
Language   en ?
arXiv  2109.11515v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: ef172339-64a8-4d3e-bcde-47d5729f0ce8
API URL: JSON