Fetching the paper…
Reading the bibliography…
Sparse coding is a basic task in many fields including signal processing, neuroscience and machine learning where the goal is to learn a basis that enables a sparse representation of a given set of data, if one exists.
Simplified neuron model as a principal component analyzer
Erkki Oja · 1982
Earlier work this paper cites.
Matrix analysis
R. Horn and C. Johnson · 1990
Earlier work this paper cites.
Principal components, minor components, and linear neural networks
Erkki Oja · 1992
Earlier work this paper cites.
A wavelet tour of signal processing
S. Mallat · 1998
Earlier work this paper cites.
Uncertainty principles and ideal atomic decomposition
D. Donoho and X. Huo · 1999
Earlier work this paper cites.
Method of optimal directions for frame design
K. Engan, S. Aase, and J. Hakon-Husoy · 1999
Earlier work this paper cites.
Learning overcomplete representations
M. Lewicki and T. Sejnowski · 2000
Earlier work this paper cites.
Sparse representations in unions of bases
R. Gribonval and M. Nielsen · 2003
Earlier work this paper cites.
Introductory lectures on convex optimization : a basic course
Yurii Nesterov · 2004
Cited alongside, same era.
Decoding by linear programming
E. Candes and T. Tao · 2005
Cited alongside, same era.
K-svd: An algorithm for designing overcomplete dictionaries for sparse representation
M. Aharon, M. Elad, and A. Bruckstein · 2006
Cited alongside, same era.
Stable signal recovery from incomplete and inaccurate measurements
E. Candes, J. Romberg, and T. Tao · 2006
Cited alongside, same era.
Sparse feature learning for deep belief networks
Marc’Aurelio Ranzato, Y-Lan Boureau, and Yann LeCun · 2007
Cited alongside, same era.
Sparse and redundant representations
M. Elad · 2010
Cited alongside, same era.
On the provable convergence of alternating minimization for matrix completion
M. Hardt · 2013
Later among the works it cites.
Low rank matrix completion using alternating minimization
P. Jain, P. Netrapalli, and S. Sanghavi · 2013
Later among the works it cites.
Phase retrieval using alternating minimization
Praneeth Netrapalli, Prateek Jain, and Sujay Sanghavi · 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 · 2014
Later among the works it cites.
New algorithms for learning incoherent and overcomplete dictionaries
S. Arora, R. Ge, and A. Moitra · 2014
Later among the works it cites.
Statistical guarantees for the EM algorithm: From population to sample-based analysis
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Exact recovery of sparsely-used dictionaries
D. Spielman, H. Wang, and J. Wright · 2012
Cited alongside, same era.
Exact recovery of sparsely used overcomplete dictionaries
A. Agarwal, A. Anandkumar, and P. Netrapalli · 2013
Cited alongside, same era.
Sparse coding with an overcomplete basis set: a strategy employed by v1
Bruno A. Olshausen and David J. Field
Cited in the paper.
Sparse coding with an overcomplete basis set: A strategy employed by v1?
Bruno A Olshausen and David J Field
Cited in the paper.
Sivaraman Balakrishnan, Martin J. Wainwright, and Bin Yu · 2014
Later among the works it cites.
Dictionary learning using sum-of-square hierarchy
Boaz Barak, John Kelner, and David Steurer · 2014
Later among the works it cites.
Non-convex robust PCA
Praneeth Netrapalli, Niranjan U. N, Sujay Sanghavi, Animashree Anandkumar, and Prateek Jain · 2014
Later among the works it cites.