Affiliation:
1. School of Mathematics, University of Minnesota, Minneapolis, MN, USA
Abstract
Abstract
This work presents a fast and non-convex algorithm for robust subspace recovery. The datasets considered include inliers drawn around a low-dimensional subspace of a higher dimensional ambient space and a possibly large portion of outliers that do not lie nearby this subspace. The proposed algorithm, which we refer to as fast median subspace (FMS), is designed to robustly determine the underlying subspace of such datasets, while having lower computational complexity than existing accurate methods. We prove convergence of the FMS iterates to a stationary point. Further, under two special models of data, FMS converges to a point which is near to the global minimum with overwhelming probability. Under these models, we show that the iteration complexity is globally sublinear and locally $r$-linear. For one of the models, these results hold for any fixed fraction of outliers (< 1). Numerical experiments on synthetic and real data demonstrate its competitive speed and accuracy.
Funder
National Science Foundation
Weizmann Institute of Science
Publisher
Oxford University Press (OUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Numerical Analysis,Statistics and Probability,Analysis
Reference70 articles.
1. The sixth data release of the Sloan digital sky survey.;Adelman-McCarthy;Astrophys. J. Suppl.,,2008
2. Comparative study on classifying human activities with miniature inertial and magnetic sensors.;Altun;Pattern Recogn.,,2010
3. A public domain dataset for human activity recognition using smartphones.;Anguita,2013
4. Stochastic optimization for PCA and PLS.;Arora,2012
5. Stochastic optimization of PCA with capped MSG.;Arora,2013
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献