Fetching the paper…
Reading the bibliography…
We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entrywise $\ell_p$-approximation error, for any $p \geq 1$; the case $p = 2$ is the classical SVD problem.
Robust Statistics
Peter J. Huber · 1981
Earlier work this paper cites.
Robust principal component analysis by self-organizing rules based on statistical physics approach
L. Xu and A. L. Yuille · 1995
Earlier work this paper cites.
The maximal-volume concept in approximation by low-rank matrices
S. A. Goreinov and E. E. Tyrtyshnikov · 2001
Earlier work this paper cites.
A linear lower bound on the unbounded error probabilistic communication complexity
Jürgen Forster · 2002
Earlier work this paper cites.
Robust L 1 L_{1} norm factorization in the presence of outliers and missing data by alternative convex programming
Qifa Ke and Takeo Kanade · 2005
Earlier work this paper cites.
Bi-criteria linear-time approximations for generalized k k -mean/median/center
Dan Feldman, Amos Fiat, Micha Sharir, and Danny Segev · 2007
Earlier work this paper cites.
Generalized rank-constrained matrix approximations
Shmuel Friedland and Anatoli Torokhti · 2007
Earlier work this paper cites.
Sampling algorithms and coresets for l p l_{p} regression
Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, and Michael W. Mahoney · 2009
Earlier work this paper cites.
Robust principal component analysis?
Emmanuel J. Candès, Xiaodong Li, Yi Ma, and John Wright · 2011
Earlier work this paper cites.
Algorithms and hardness for subspace approximation
Amit Deshpande, Madhur Tulsiani, and Nisheeth K. Vishnoi · 2011
Cited alongside, same era.
Quasioptimality of skeleton approximation of a matrix in the Chebyshev norm
S. A. Goreinov and E. E. Tyrtyshnikov · 2011
Cited alongside, same era.
Direct robust matrix factorization for anomaly detection
L. Xiong, X. Chen, and J. Schneider · 2011
Cited alongside, same era.
Efficient computation of robust low-rank matrix approximations using the L 1 L_{1} norm
A. Eriksson and A. van den Hengel · 2012
Cited alongside, same era.
A probabilistic approach to robust matrix factorization
Naiyan Wang, Tiansheng Yao, Jingdong Wang, and Dit-Yan Yeung · 2012
Cited alongside, same era.
Robust PCA via outlier pursuit
H. Xu, C. Caramanis, and S. Sanghavi · 2012
Cited alongside, same era.
Bayesian robust matrix factorization for image and video processing
Naiyan Wang and Dit-Yan Yeung · 2013
Later among the works it cites.
Scalable adaptive robust dictionary learning
Cewu Lu, Jiaping Shi, and Jiaya Jia · 2014
Later among the works it cites.
Non-convex robust PCA
Praneeth Netrapalli, U. N. Niranjan, Sujay Sanghavi, Animashree Anandkumar, and Prateek Jain · 2014
Later among the works it cites.
Sketching as a tool for numerical linear algebra
David P. Woodruff · 2014
Later among the works it cites.
On low rank approximation of binary matrices
C. Dan, K. A. Hansen, H. Jiang, L. Wang, and Y. Zhou · 2015
Later among the works it cites.
On the complexity of robust PCA and ℓ 1 \ell_{1} -norm low-rank matrix approximation
Nicolas Gillis and Stephen A. Vavasis · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Practical low-rank matrix approximation under robust L 1 L_{1} -norm
Y. Zheng, G. Liu, S. Sugimoto, S. Yan, and M. Okutomi · 2012
Cited alongside, same era.
A pure ℓ 1 \ell_{1} -norm principal component analysis
J.P. Brooks, J.H. Dulá, and E.L. Boone · 2013
Cited alongside, same era.
Robust matrix factorization with unknown noise
Deyu Meng and Fernando. D. L. Torre · 2013
Cited alongside, same era.
Low rank approximation with entrywise ℓ 1 \ell_{1} -norm error
Zhao Song, David P. Woodruff, and Pelin Zhong · 2016
Later among the works it cites.
Fast algorithms for robust pca via gradient descent
Xinyang Yi, Dohyung Park, Yudong Chen, and Constantine Caramanis · 2016
Later among the works it cites.