Fetching the paper…
Reading the bibliography…
This paper examines a general class of noisy matrix completion tasks where the goal is to estimate a matrix from observations obtained at a subset of its entries, each of which is subject to random noise or corruption.
“On the Tchebychef inequality of Bernstein,”
C. C. Craig, · 1933
Earlier work this paper cites.
“The transformation of Poisson, binomial and negative-binomial data,”
F. J. Anscombe, · 1948
Earlier work this paper cites.
Generalized linear models
P. McCullagh and J. A. Nelder, · 1989
Earlier work this paper cites.
“Sparse coding with an overcomplete basis set: A strategy employed by V1?,”
B. A. Olshausen and D. J. Field, · 1997
Earlier work this paper cites.
“Automatic subspace clustering of high dimensional data for data mining applications,”
R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan, · 1998
Earlier work this paper cites.
Estimation of Mixture Models
J. Q. Li, · 1999
Earlier work this paper cites.
“Risk bounds for model selection via penalization,”
A. Barron, L. Birgé, and P. Massart, · 1999
Earlier work this paper cites.
“Mixture density estimation,”
J. Q. Li and A. R. Barron, · 1999
Earlier work this paper cites.
“Nearest q q -flat to m m points,”
P. Tseng, · 2000
Earlier work this paper cites.
Empirical Processes in M-estimation
S. van de Geer, · 2000
Earlier work this paper cites.
“When does non-negative matrix factorization give a correct decomposition into parts?,”
D. Donoho and V. Stodden, · 2003
Earlier work this paper cites.
“Generalization error bounds for collaborative prediction with low-rank matrices,”
N. Srebro, N. Alon, and T. S. Jaakkola, · 2004
Earlier work this paper cites.
“Multiscale likelihood analysis and complexity penalized estimation,”
E. D. Kolaczyk and R. D. Nowak, · 2004
Earlier work this paper cites.
“Multibody factorization with uncertainty and missing data using the EM algorithm,”
A. Gruber and Y. Weiss, · 2004
Earlier work this paper cites.
“Generalized principal component analysis (GPCA),”
R. Vidal, Y. Ma, and S. Sastry, · 2005
Earlier work this paper cites.
“Spectral bounds for sparse PCA: Exact and greedy algorithms,”
B. Moghaddam, Y. Weiss, and S. Avidan, · 2005
Earlier work this paper cites.
“Universal decentralized estimation in a bandwidth constrained sensor network,”
Z.-Q. Luo, · 2005
Earlier work this paper cites.
“K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation,”
M. Aharon, M. Elad, and A. Bruckstein, · 2006
Earlier work this paper cites.
“On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them,”
M. Aharon, M. Elad, and A. M. Bruckstein, · 2006
Earlier work this paper cites.
“Sparse principal component analysis,”
H. Zou, T. Hastie, and R. Tibshirani, · 2006
Earlier work this paper cites.
“Signal reconstruction from noisy random projections,”
J. Haupt and R. Nowak, · 2006
Earlier work this paper cites.
“Bandwidth-constrained distributed estimation for wireless sensor networks-part i: Gaussian case,”
A. Ribeiro and G. B. Giannakis, · 2006
Earlier work this paper cites.
Elements of information theory
T. M. Cover and J. A. Thomas, · 2006
Earlier work this paper cites.
“Lessons from the netflix prize challenge,”
R. M. Bell and Y. Koren, · 2007
Earlier work this paper cites.
“Multiscale Poisson intensity and density estimation,”
R. M. Willett and R. D. Nowak, · 2007
Earlier work this paper cites.
“A direct formulation for sparse PCA using semidefinite programming,”
A. d’Aspremont, L. El Ghaoui, M. I. Jordan, and G. R. G. Lanckriet, · 2007
Earlier work this paper cites.
“The Dantzig selector: Statistical estimation when p p is much larger than n n ,”
E. J. Candès and T. Tao, · 2007
Earlier work this paper cites.
The minimum description length principle
P. D. Grünwald, · 2007
Earlier work this paper cites.
“Sparse representation for color image restoration,”
J. Mairal, M. Elad, and G. Sapiro, · 2008
Cited alongside, same era.
“Sparse principal component analysis via regularized low rank matrix approximation,”
H. Shen and J. Z. Huang, · 2008
Cited alongside, same era.
“Multiframe motion segmentation with missing data using PowerFactorization and GPCA,”
R. Vidal, R. Tron, and R. Hartley, · 2008
Cited alongside, same era.
“Exact matrix completion via convex optimization,”
E. J. Candès and B. Recht, · 2009
Cited alongside, same era.
“Matrix factorization techniques for recommender systems,”
Y. Koren, R. Bell, and C. Volinsky, · 2009
Cited alongside, same era.
“Online dictionary learning for sparse coding,”
J. Mairal, F. Bach, J. Ponce, and G. Sapiro, · 2009
Cited alongside, same era.
“Dictionary learning for noisy and incomplete hyperspectral images,”
Z. Xing, M. Zhou, A. Castrodad, G. Sapiro, and L. Carin, · 2012
Later among the works it cites.
“Nonparametric bayesian dictionary learning for analysis of noisy and incomplete images,”
M. Zhou, H. Chen, J. Paisley, L. Ren, L. Li, Z. Xing, D. Dunson, G. Sapiro, and L. Carin, · 2012
Later among the works it cites.
“Computing a nonnegative matrix factorization–provably,”
S. Arora, R. Ge, R. Kannan, and A. Moitra, · 2012
Later among the works it cites.
“A convex model for nonnegative matrix factorization and dimensionality reduction on physical space,”
E. Esser, M. Moller, S. Osher, G. Sapiro, and J. Xin, · 2012
Later among the works it cites.
“Factoring nonnegative matrices with linear programs,”
B. Recht, C. Re, J. Tropp, and V. Bittorf, · 2012
Later among the works it cites.
“Local stability and robustness of sparse dictionary learning in the presence of noise,”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“CoSaMP: Iterative signal recovery from incomplete and inaccurate samples,”
D. Needell and J. A. Tropp, · 2009
Cited alongside, same era.
“A fast iterative shrinkage-thresholding algorithm for linear inverse problems,”
A. Beck and M. Teboulle, · 2009
Cited alongside, same era.
“The power of convex relaxation: Near-optimal matrix completion,”
E. J. Candès and T. Tao, · 2010
Cited alongside, same era.
“Matrix completion from a few entries,”
R. H. Keshavan, A. Montanari, and S. Oh, · 2010
Cited alongside, same era.
“SET: An algorithm for consistent matrix completion,”
W. Dai and O. Milenkovic, · 2010
Cited alongside, same era.
“Matrix completion from noisy entries,”
R. H. Keshavan, A. Montanari, and S. Oh, · 2010
Cited alongside, same era.
R. Jenatton, R. Gribonval, and F. Bach, · 2012
Later among the works it cites.
“Sparse PCA: Convex relaxations, algorithms and applications,”
Y. Zhang, A. dÕAspremont, and L. El Ghaoui, · 2012
Later among the works it cites.
“Minimax rates of estimation for sparse PCA in high dimensions,”
V. Q. Vu and J. Lei, · 2012
Later among the works it cites.
“Completion of high-rank ultrametric matrices using selective entries,”
A. Singh, A. Krishnamurthy, S. Balakrishnan, and M. Xu, · 2012
Later among the works it cites.
“Iterative hard thresholding methods for ℓ 0 \ell_{0} regularized convex cone programming,”
Z. Lu, · 2012
Later among the works it cites.
“The convex geometry of linear inverse problems,”
V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky, · 2012
Later among the works it cites.
“Sparse factor analysis for learning and content analytics,”
A. S. Lan, A. E. Waters, C. Studer, and R. G. Baraniuk, · 2013
Later among the works it cites.
“Sparse subspace clustering: Algorithm, theory, and applications,”
E. Elhamifar and R. Vidal, · 2013
Later among the works it cites.
M. Soltanolkotabi, E. Elhamifar, and E. J. Candès, · 2013
Later among the works it cites.
“Applying alternating direction method of multipliers for constrained dictionary learning,”
A. Rakotomamonjy, · 2013
Later among the works it cites.
“Exact recovery of sparsely-used dictionaries,”
D. A. Spielman, H. Wang, and J. Wright, · 2013
Later among the works it cites.
K. Schnass, · 2013
Later among the works it cites.
“Learning sparsely used overcomplete dictionaries via alternating minimization,”
A. Agarwal, A. Anandkumar, P. Jain, P. Netrapalli, and R. Tandon, · 2013
Later among the works it cites.
“Sparse principal component analysis with missing observations,”
K. Lounici, · 2013
Later among the works it cites.
Concentration inequalities: A nonasymptotic theory of independence
S. Boucheron, G. Lugosi, and P. Massart, · 2013
Later among the works it cites.
“High-dimensional estimation with geometric constraints,”
Y. Plan, R. Vershynin, and E. Yudovina, · 2014
Closest in time.
“Estimation error guarantees for Poisson denoising with sparse and structured dictionary models,”
A. Soni and J. Haupt, · 2014
Closest in time.
“Sparse dictionary learning from 1-bit data,”
J. D. Haupt, N. D. Sidiropoulos, and G. B. Giannakis, · 2014
Closest in time.
“Generalized low rank models,”
M. Udell, C. Horn, R. Zadeh, and S. Boyd, · 2014
Closest in time.
“Minimax optimal rates for Poisson inverse problems with physical constraints,”
X. Jiang, G. Raskutti, and R. Willett, · 2014
Closest in time.
“Tight convex relaxations for sparse matrix factorization,”
E. Richard, G. Obozinski, and J.-P. Vert, · 2014
Closest in time.
“Sparse dictionary learning from 1 1 -bit data,”
J. D. Haupt, N. D. Sidiropoulos, and G. B. Giannakis, · 2014
Closest in time.