暂无分享,去创建一个
[1] Namrata Vaswani,et al. NEARLY OPTIMAL ROBUST SUBSPACE TRACKING: A UNIFIED APPROACH , 2017, 2018 IEEE Data Science Workshop (DSW).
[2] Lek-Heng Lim,et al. Schubert Varieties and Distances between Subspaces of Different Dimensions , 2014, SIAM J. Matrix Anal. Appl..
[3] Namrata Vaswani,et al. Online (and Offline) Robust PCA: Novel Algorithms and Performance Guarantees , 2016, AISTATS.
[4] Cameron Musco,et al. Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition , 2015, NIPS.
[5] E. Candès. The restricted isometry property and its implications for compressed sensing , 2008 .
[6] Namrata Vaswani,et al. Robust PCA With Partial Subspace Knowledge , 2015, IEEE Trans. Signal Process..
[7] Yi Ma,et al. Robust principal component analysis? , 2009, JACM.
[8] Bin Yang,et al. Projection approximation subspace tracking , 1995, IEEE Trans. Signal Process..
[9] Namrata Vaswani,et al. Recursive robust PCA or recursive sparse recovery in large but structured noise , 2013, ICASSP.
[10] Selin Aviyente,et al. Recursive Tensor Subspace Tracking for Dynamic Brain Network Analysis , 2017, IEEE Transactions on Signal and Information Processing over Networks.
[11] Takeo Kanade,et al. A Multibody Factorization Method for Independently Moving Objects , 1998, International Journal of Computer Vision.
[12] Pablo A. Parrilo,et al. Rank-Sparsity Incoherence for Matrix Decomposition , 2009, SIAM J. Optim..
[13] Prateek Jain,et al. Non-convex Robust PCA , 2014, NIPS.
[14] Robert D. Nowak,et al. Online identification and tracking of subspaces from highly incomplete information , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[15] Shuicheng Yan,et al. Online Robust PCA via Stochastic Optimization , 2013, NIPS.
[16] Laura Balzano,et al. Incremental gradient on the Grassmannian for online foreground and background separation in subsampled video , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.
[17] Sham M. Kakade,et al. Robust Matrix Decomposition With Sparse Corruptions , 2011, IEEE Transactions on Information Theory.
[18] A. Robert Calderbank,et al. PETRELS: Parallel Subspace Estimation and Tracking by Recursive Least Squares From Partial Observations , 2012, IEEE Transactions on Signal Processing.
[19] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[20] Constantine Caramanis,et al. Fast Algorithms for Robust PCA via Gradient Descent , 2016, NIPS.
[21] Namrata Vaswani,et al. Finite sample guarantees for PCA in non-isotropic and data-dependent noise , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[22] Gregory S. Wagner,et al. Signal detection using multi-channel seismic data , 1996 .
[23] Yang Shi,et al. Streaming Robust PCA U . , 2016 .
[24] Namrata Vaswani,et al. Correlated-PCA: Principal Components' Analysis when Data and Noise are Correlated , 2016, NIPS.
[25] Prateek Jain,et al. Nearly Optimal Robust Matrix Completion , 2016, ICML.
[26] Junfeng Yang,et al. Alternating Direction Algorithms for 1-Problems in Compressive Sensing , 2009, SIAM J. Sci. Comput..
[27] Namrata Vaswani,et al. Online matrix completion and online robust PCA , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[28] Ioannis Mitliagkas,et al. Memory Limited, Streaming PCA , 2013, NIPS.
[29] Roman Vershynin,et al. Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.
[30] Namrata Vaswani,et al. Provable Dynamic Robust PCA or Robust Subspace Tracking , 2017, 2018 IEEE International Symposium on Information Theory (ISIT).