• Corpus ID: 211069175

# List Decodable Subspace Recovery

@article{Raghavendra2020ListDS,
title={List Decodable Subspace Recovery},
journal={ArXiv},
year={2020},
volume={abs/2002.03004}
}
• Published 7 February 2020
• Computer Science, Mathematics
• ArXiv

### Learning from untrusted data

• Computer Science
STOC
• 2017
An algorithm for robust learning in a very general stochastic optimization setting is provided that has immediate implications for robustly estimating the mean of distributions with bounded second moments, robustly learning mixtures of such distributions, and robustly finding planted partitions in random graphs.

### List-Decodable Subspace Recovery via Sum-of-Squares

• Computer Science
ArXiv
• 2020
A new method is given that allows error reduction "within SoS" with only a logarithmic cost in the exponent in the running time (in contrast to polynomial cost in [KKK'19, RY'20].

### Outlier-robust moment-estimation via sum-of-squares

• Computer Science, Mathematics
ArXiv
• 2017
Improved algorithms for estimating low-degree moments of unknown distributions in the presence of adversarial outliers are developed and the guarantees of these algorithms match information-theoretic lower-bounds for the class of distributions the authors consider.

### A Well-Tempered Landscape for Non-convex Robust Subspace Recovery

• Computer Science, Mathematics
J. Mach. Learn. Res.
• 2019
It is proved that an underlying subspace is the only stationary point and local minimizer in a specified neighborhood under a deterministic condition on a dataset and it is shown that a geodesic gradient descent method over the Grassmannian manifold can exactly recover the underlying sub space when the method is properly initialized.

### Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers

• Computer Science, Mathematics
ITCS
• 2018
This work introduces a criterion, resilience, which allows properties of a dataset to be robustly computed, even in the presence of a large fraction of arbitrary additional data, and provides new information-theoretic results on robust distribution learning, robust estimation of stochastic block models, and robust mean estimation under bounded kth moments.

### Smoothed Analysis in Unsupervised Learning via Decoupling

• Computer Science
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
• 2019
This work obtains high-confidence lower bounds on the least singular value of new classes of structured random matrix ensembles of the above kind and uses these bounds to design algorithms with polynomial time smoothed analysis guarantees for the following three important problems in unsupervised learning.