Yu Cheng, Ilias Diakonikolas, Rong Ge, Mahdi Soltanolkotabi, Shivam Gupta, Daniel Kane
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2109.11515")
get_code_for_paper("2109.11515")
have("2109.11515")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2109.11515.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2109.11515)
Connect an agent — have() is free.