Noisy Matrix Completion under Sparse Factor Models

2 November 2014

Papers citing "Noisy Matrix Completion under Sparse Factor Models"

28 / 28 papers shown

Title
A note on the sample complexity of the Er-SpUD algorithm by Spielman, Wang and Wright for exact recovery of sparsely used dictionaries Radosław Adamczak 43 50 0 08 Jan 2016
Minimax Lower Bounds for Noisy Matrix Completion Under Sparse Factor Models Abhinav V. Sambasivan Jarvis Haupt 51 10 0 02 Oct 2015
Tag-Aware Ordinal Sparse Factor Analysis for Learning and Content Analytics Andrew Lan Christoph Studer Andrew E. Waters Richard G. Baraniuk 57 162 0 18 Dec 2014
Probabilistic low-rank matrix completion on finite alphabets Jean Lafond Olga Klopp Eric Moulines Joseph Salmon 79 38 0 08 Dec 2014
Generalized Low Rank Models Madeleine Udell Corinne Horn R. Zadeh Stephen P. Boyd 70 346 0 01 Oct 2014
Tight convex relaxations for sparse matrix factorization E. Richard G. Obozinski Jean-Philippe Vert 90 43 0 19 Jul 2014
High-dimensional estimation with geometric constraints Y. Plan Roman Vershynin E. Yudovina 169 144 0 14 Apr 2014
Minimax Optimal Rates for Poisson Inverse Problems with Physical Constraints Xin Jiang Garvesh Raskutti Rebecca Willett 71 38 0 25 Mar 2014
Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization Alekh Agarwal Anima Anandkumar Prateek Jain Praneeth Netrapalli 129 173 0 30 Oct 2013
Robust subspace clustering Mahdi Soltanolkotabi Ehsan Elhamifar Emmanuel J. Candès 117 366 0 11 Jan 2013
Iterative Hard Thresholding Methods for $l_0$ Regularized Convex Cone Programming Zhaosong Lu 131 87 0 31 Oct 2012
Local stability and robustness of sparse dictionary learning in the presence of noise Rodolphe Jenatton Tuo Chen Francis R. Bach 140 49 0 02 Oct 2012
1-Bit Matrix Completion Mark A. Davenport Y. Plan E. Berg Mary Wootters 215 353 0 17 Sep 2012
Factoring nonnegative matrices with linear programs Victor Bittorf Benjamin Recht Christopher Ré J. Tropp 153 204 0 06 Jun 2012
Sparse Principal Component Analysis with missing observations Karim Lounici 133 43 0 31 May 2012
Generalized Principal Component Analysis (GPCA) René Vidal Yi-An Ma S. Shankar Sastry 97 1,159 0 17 Feb 2012
Minimax Rates of Estimation for Sparse PCA in High Dimensions Vincent Q. Vu Jing Lei 122 141 0 03 Feb 2012
High-Rank Matrix Completion and Subspace Clustering with Missing Data Brian Eriksson Laura Balzano Robert D. Nowak 63 67 0 23 Dec 2011
A geometric analysis of subspace clustering with outliers Mahdi Soltanolkotabi Emmanuel J. Candés 93 416 0 19 Dec 2011
Computing a Nonnegative Matrix Factorization -- Provably Sanjeev Arora Rong Ge R. Kannan Ankur Moitra 309 399 0 03 Nov 2011
A convex model for non-negative matrix factorization and dimensionality reduction on physical space E. Esser Michael Möller Stanley Osher Guillermo Sapiro Jack Xin 136 168 0 04 Feb 2011
On the Local Correctness of L^1 Minimization for Dictionary Learning Quan Geng Huan Wang John N. Wright 115 75 0 29 Jan 2011
The Convex Geometry of Linear Inverse Problems V. Chandrasekaran Benjamin Recht P. Parrilo A. Willsky 208 1,341 0 03 Dec 2010
Nuclear norm penalization and optimal rates for noisy low rank matrix completion V. Koltchinskii Alexandre B. Tsybakov Karim Lounici 226 663 0 29 Nov 2010
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise S. Negahban Martin J. Wainwright 199 522 0 10 Sep 2010
Matrix Completion from Noisy Entries Raghunandan H. Keshavan Andrea Montanari Sewoong Oh 265 719 0 11 Jun 2009
$Dictionary Identification - Sparse Matrix-Factorisation via $\ell_1$-Minimisation$ Dictionary Identification - Sparse Matrix-Factorisation via $\ell_1$ -Minimisation Remi Gribonval Karin Schnass 107 167 0 30 Apr 2009
Matrix Completion from a Few Entries Raghunandan H. Keshavan Andrea Montanari Sewoong Oh 426 1,246 0 20 Jan 2009