Noisy Matrix Completion under Sparse Factor Models

Noisy Matrix Completion under Sparse Factor Models (2014)

Cached

Download Links

[arxiv.org]

by Akshay Soni , Swayambhoo Jain , Jarvis Haupt , Stefano Gonella

Venue:	IEEE TRANSACTIONS ON INFORMATION THEORY
Citations:	2 - 1 self

Citations

12351	Elements of information theory - Cover, Thomas - 1991
3157	Generalized Linear Models - McCullagh, Nelder - 1989
1043	A fast iterative shrinkage-thresholding algorithm for linear inverse problems - Beck, Teboulle - 2009
990	Distributed optimization and statistical learning via the alternating direction method of multipliers - Boyd, Parikh, et al. - 2011
954	Sparse coding with an overcomplete basis set: a strategy employed by V1? Vision Research - Olshausen, Field - 1997
926	K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation - Aharon, Elad, et al. - 2006
861	The Dantzig selector: Statistical estimation when p is much larger than - Candes, Tao - 2007
858	Exact matrix completion via convex optimization - Candès, Recht
760	Cosamp: iterative signal recovery from incomplete and inaccurate samples - Needell, Tropp
723	Automatic subspace clustering of high dimensional data for data mining applications - Agrawal, Gehrke, et al.
594	Matrix factorization techniques for recommender systems - Koren, Bell, et al. - 2009
351	The power of convex relaxation: Near-optimal matrix completion,” Information Theory - Candes, Tao - 2010
281	Risk bounds for model selection via penalization,” Probab - Barron, Birgé, et al. - 1999
274	Sparse principal component analysis - Zou, Hastie, et al. - 2004
273	A direct formulation for sparse pca using semidefinite programming - d’Aspremont, Ghaoui, et al. - 2004
272	The Minimum Description Length Principle - Grünwald - 2007
248	Matrix completion with noise - Candès, Plan
242	Online dictionary learning for sparse coding - Mairal, Bach, et al.
236	and R.Nowak, “Signal reconstruction from noisy random projections - Haupt - 2006
219	Sparse representation for color image restoration - Mairal, Elad, et al.
205	Generalized principal component analysis (GPCA - Vidal, Ma, et al.
194	Fixed point and bregman iterative methods for matrix rank minimization. - Ma, Chen - 2008
194	When does Non-Negative Matrix Factorization give a correct Decomposition into Parts - Donoho, Stodden
191	Matrix completion from a few entries - Keshavan, Oh, et al.
179	The convex geometry of linear inverse problems - Chandrasekaran, Recht, et al. - 2012
155	A simpler approach to matrix completion - Recht
140	The transformation of Poisson, binomial and negative-binomial data - Anscombe - 1948
127	Motion Segmentation with Missing Data using PowerFactorization and GPCA - Vidal, Hartley
119	Matrix completion from noisy entries - Keshavan, Montanari, et al.
111	Concentration Inequalities: A Non-asymptotic Theory of Independence - Boucheron, Lugosi, et al. - 2013
107	Nuclear norm penalization and optimal rates for noisy low rank matrix completion - KOLTCHINSKII, LOUNICI, et al. - 2011
106	Lessons from the Netflix Prize challenge - BELL, KOREN
104	Giannakis, “Bandwidth-constrained distributed estimation for wireless sensor networks–part I: Gaussian case - Ribeiro, B - 2006
99	Sparse principal component analysis via regularized low rank matrix approximation. Journal of multivariate analysis 99 - Shen, Huang - 2008
95	Sparse subspace clustering: Algorithm, theory, and applications - Elhamifar, Vidal - 2013
93	Oracle inequalities in empirical risk minimization and sparse recovery problems - Koltchinskii - 2011
91	Nonparametric bayesian dictionary learning for analysis of noisy and incomplete images,” IMA - Zhou, Chen, et al. - 2010
85	Mixture Density Estimation - Li, Barron - 1999
83	Restricted strong convexity and weighted matrix completion: optimal bounds with noise - Negahban, Wainwright - 2012
77	Spectral bounds for sparse PCA: Exact and greedy algorithms - Moghaddam, Weiss, et al. - 2007
77	Universal decentralized estimation in a bandwidth constrained sensor network - Luo - 2005
74	Admira: Atomic decomposition for minimum rank approximation - Lee, Bresler - 2010
72	Multiscale likelihood analysis and complexity penalized estimation,” Annals of Statistics - Kolaczyk, Nowak - 2004
63	A geometric analysis of subspace clustering with outliers - Soltanolkotabi, Candes
59	Multibody factorization with uncertainty and missing data using the EM algorithm - Gruber, Weiss - 2004
52	On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them - Aharon, Elad, et al.
45	Low-dimensional models for dimensionality reduction and signal recovery: A geometric perspective - Baraniuk, Cevher, et al.
44	Multiscale Poisson intensity and density estimation - Willett, Nowak - 2007
43	Estimation of Mixture Models - Li - 1999
40	Nearest q-flat to m points - Tseng
38	Factoring nonnegative matrices with linear programs - Bittorf, Recht, et al. - 2012
36	Exact recovery of sparselyused dictionaries - Spielman, Wang, et al. - 2012
35	Generalization error bounds for collaborative prediction with low-rank matrices - Srebro, Alon, et al.
29	A Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on - Esser, Moller, et al. - 2012
28	Dictionary identification - Sparse matrixfactorisation via `1 minimisation - Gribonval, Schnass - 2010
27	Compressed sensing performance bounds under poisson noise - Raginsky, Willett, et al. - 2010
25	Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization,” arXiv - Agarwal, Anandkumar, et al. - 2013
22	SET: an algorithm for consistent matrix completion - Dai, Milenkovic - 2010
19	Local stability and robustness of sparse dictionary learning in the presence of noise - Jenatton, Gribonval, et al. - 2012
18	Ghaoui, “Sparse PCA: Convex relaxations, algorithms and applications - Zhang, dAspremont, et al. - 2012
16	Sparse factor analysis for learning and content analytics,” arXiv preprint arXiv:1303.5685 - Lan, Waters, et al. - 2013
16	1-bit matrix completion. arXiv preprint arXiv:1209.3672 - Davenport, Plan, et al. - 2012
14	Dictionary learning for noisy and incomplete hyperspectral images - Xing, Zhou, et al. - 2012
14	High-rank matrix completion and subspace clustering with missing data,” arXiv preprint arXiv:1112.5629 - Eriksson, Balzano, et al. - 2011
14	On the Tchebychef inequality of Bernstein,” The - Craig - 1933
13	On the local correctness of ℓ1 minimization for dictionary learning,” arXiv - Geng, Wang, et al. - 2011
11	Computing a nonnegative matrix factorization–provably - Arora, Ge, et al.
9	Sparse principal component analysis with missing observations - Lounici - 2013
8	On the identifiability of overcomplete dictionaries via the minimisation principle underlying - Schnass
5	Robust subspace clustering,” arXiv preprint arXiv:1301.2603 - Soltanolkotabi, Elhamifar, et al. - 2013
5	High-dimensional estimation with geometric constraints,” arXiv preprint arXiv:1404.3749 - Plan, Vershynin, et al. - 2014
4	Generalized low rank models,” arXiv preprint arXiv:1410.0342 - Udell, Horn, et al. - 2014
4	Minimax rates of estimation for sparse PCA - Vu, Lei
3	Estimation error guarantees for Poisson denoising with sparse and structured dictionary models - Soni, Haupt
3	Applying alternating direction method of multipliers for constrained dictionary learning - Rakotomamonjy - 2013
3	Completion of high-rank ultrametric matrices using selective entries - Singh, Krishnamurthy, et al.
3	Tight convex relaxations for sparse matrix factorization,” arXiv preprint arXiv:1407.5158 - Richard, Obozinski, et al. - 2014
2	Giannakis, “Sparse dictionary learning from 1-bit data - Haupt, Sidiropoulos, et al. - 2014
1	Minimax optimal rates for Poisson inverse problems with physical constraints,” arXiv preprint arXiv:1403.6532 - Jiang, Raskutti, et al. - 2014
1	Iterative hard thresholding methods for ℓ0 regularized convex cone programming - Lu - 2012