matrix recovery

How Much Restricted Isometry is Needed In Nonconvex Matrix Recovery? NeurIPS 2018 Optimal Shrinkage of Singular Values Under Random Data Contamination NeurIPS 2017 Random Consensus Robust PCA AISTATS 2017 A Note on the Sample Complexity of the Er-SpUD Algorithm by Spielman, Wang and Wright for Exact Recovery of Sparsely Used Dictionaries JMLR 2016 Dynamic matrix recovery from incomplete observations under an exact low-rank constraint NeurIPS 2016 Low-Rank and Sparse Structure Pursuit via Alternating Minimization AISTATS 2016 Online (and Offline) Robust PCA: Novel Algorithms and Performance Guarantees AISTATS 2016 Robust Principal Component Analysis with Side Information ICML 2016 Structured Matrix Recovery via the Generalized Dantzig Selector NeurIPS 2016 Multi-Image Matching via Fast Alternating Minimization ICCV 2015 Deterministic Symmetric Positive Semidefinite Matrix Completion NeurIPS 2014 Efficient Structured Matrix Rank Minimization NeurIPS 2014 Generalized Nonconvex Nonsmooth Low-Rank Minimization CVPR 2014 On Iterative Hard Thresholding Methods for High-dimensional M-Estimation NeurIPS 2014 Recovery of Coherent Data via Low-Rank Dictionary Pursuit NeurIPS 2014 Riemannian Pursuit for Big Matrix Recovery ICML 2014 Robust Orthonormal Subspace Learning: Efficient Recovery of Corrupted Low-rank Matrices CVPR 2014 Breaking the Small Cluster Barrier of Graph Clustering ICML 2013 Estimating Unknown Sparsity in Compressed Sensing ICML 2013 Exact and Stable Recovery of Pairwise Interaction Tensors NeurIPS 2013 Learning Structured Low-Rank Representations for Image Classification CVPR 2013 Low-Rank Matrix and Tensor Completion via Adaptive Sampling NeurIPS 2013 Matrix Completion From any Given Set of Observations NeurIPS 2013 Exact Subspace Segmentation and Outlier Detection by Low-Rank Representation AISTATS 2012 Minimax Localization of Structural Information in Large Noisy Matrices NeurIPS 2011