Fetching the paper…
Reading the bibliography…
We consider the problem of recovering a complete (i.e., square and invertible) matrix $\mathbf A_0$, from $\mathbf Y \in \mathbb{R}^{n \times p}$ with $\mathbf Y = \mathbf A_0 \mathbf X_0$, provided $\mathbf X_0$ is sufficiently sparse.
T. E. Harris, “A lower bound for the critical probability in a certain percolation process,” in Mathematical Proceedings of the Cambridge Philosophical Society , vol. 56, no. 01. Cambridge Univ Press, 1960, pp. 13–20
1960
Earlier work this paper cites.
D. Goldfarb, “Curvilinear path steplength algorithms for minimization which use directions of negative curvature,” Mathematical programming , vol. 18, no. 1, pp. 31–40, 1980
1980
Earlier work this paper cites.
D. P. Bertsekas and J. N. Tsitsiklis, Parallel and distributed computation: numerical methods . Prentice hall Englewood Cliffs, NJ, 1989, vol. 23
1989
Earlier work this paper cites.
P. Baldi and K. Hornik, “Neural networks and principal component analysis: Learning from examples without local minima,” Neural networks , vol. 2, no. 1, pp. 53–58, 1989
1989
Earlier work this paper cites.
P. Comon, “Independent component analysis, a new concept?” Signal processing , vol. 36, no. 3, pp. 287–314, 1994
1994
Earlier work this paper cites.
B. A. Olshausen and D. J. Field, “Emergence of simple-cell receptive field properties by learning a sparse code for natural images,” Nature , vol. 381, no. 6583, pp. 607–609, 1996
1996
Earlier work this paper cites.
A. Frieze, M. Jerrum, and R. Kannan, “Learning linear transformations,” in focs . IEEE, 1996, p. 359
1996
Earlier work this paper cites.
——, “Sparse coding with an overcomplete basis set: A strategy employed by v1?” Vision research , vol. 37, no. 23, pp. 3311–3325, 1997
1997
Earlier work this paper cites.
R. A. DeVore, “Nonlinear approximation,” Acta numerica , vol. 7, pp. 51–150, 1998
1998
Earlier work this paper cites.
D. L. Donoho, M. Vetterli, R. A. DeVore, and I. Daubechies, “Data compression and harmonic analysis,” Information Theory, IEEE Transactions on , vol. 44, no. 6, pp. 2435–2476, 1998
1998
Earlier work this paper cites.
A. Edelman, T. A. Arias, and S. T. Smith, “The geometry of algorithms with orthogonality constraints,” SIAM journal on Matrix Analysis and Applications , vol. 20, no. 2, pp. 303–353, 1998
1998
Earlier work this paper cites.
A. Hyvarinen, “Fast and robust fixed-point algorithms for independent component analysis,” IEEE Trans. Neural Networks , vol. 10, no. 3, pp. 626–634, 1999
1999
Earlier work this paper cites.
G. B. Folland, Real Analysis: Modern Techniques and Their Applications , 2nd ed. John Wiley & Sons, 1999
1999
Earlier work this paper cites.
A. Hyvärinen and E. Oja, “Independent component analysis: algorithms and applications,” Neural networks , vol. 13, no. 4, pp. 411–430, 2000
2000
Earlier work this paper cites.
P. Tseng, “Convergence of a block coordinate descent method for nondifferentiable minimization,” Journal of optimization theory and applications , vol. 109, no. 3, pp. 475–494, 2001
2001
Earlier work this paper cites.
M. Zibulevsky and B. Pearlmutter, “Blind source separation by sparse decomposition in a signal dictionary,” Neural computation , vol. 13, no. 4, pp. 863–882, 2001
2001
Earlier work this paper cites.
A. Hyvärinen, J. Karhunen, and E. Oja, Independent Component Analysis . John Wiley and Sons., 2001
2001
Earlier work this paper cites.
E. J. Candès, “New ties between computational harmonic analysis and approximation theory,” Approximation Theory X , pp. 87–153, 2002
2002
Earlier work this paper cites.
V. N. Temlyakov, “Nonlinear methods of approximation,” Foundations of Computational Mathematics , vol. 3, no. 1, pp. 33–107, 2003
2003
Earlier work this paper cites.
S. Lesage, R. Gribonval, F. Bimbot, and L. Benaroya, “Learning unions of orthonormal bases with thresholded singular value decomposition,” in Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing , vol. 5. IEEE, 2005, pp. v–293
2005
Earlier work this paper cites.
M. Aharon, M. Elad, and A. M. Bruckstein, “On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them,” Linear algebra and its applications , vol. 416, no. 1, pp. 48–67, 2006
2006
Earlier work this paper cites.
P.-A. Absil, C. G. Baker, and K. A. Gallivan, “Trust-region methods on Riemannian manifolds,” Foundations of Computational Mathematics , vol. 7, no. 3, pp. 303–330, 2007
2007
Earlier work this paper cites.
R. A. DeVore, “Nonlinear approximation and its applications,” in Multiscale, Nonlinear and Adaptive Approximation . Springer, 2009, pp. 169–201
2009
Earlier work this paper cites.
D. Donoho and J. Tanner, “Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing,” Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences , vol. 367, no. 1906, pp. 4273–4293, 2009
2009
Earlier work this paper cites.
P.-A. Absil, R. Mahoney, and R. Sepulchre, Optimization Algorithms on Matrix Manifolds . Princeton University Press, 2009
2009
Earlier work this paper cites.
J. Ma and G. Plonka, “A review of curvelets and recent applications,” IEEE Signal Processing Magazine , vol. 27, no. 2, pp. 118–133, 2010
2010
Earlier work this paper cites.
M. Elad, Sparse and redundant representations: from theory to applications in signal and image processing . Springer, 2010
2010
Earlier work this paper cites.
A. Maurer and M. Pontil, “K-dimensional coding schemes in hilbert spaces,” Information Theory, IEEE Transactions on , vol. 56, no. 11, pp. 5839–5846, 2010
2010
Earlier work this paper cites.
R. Gribonval and K. Schnass, “Dictionary identification - sparse matrix-factorization via ℓ 1 \ell^{1} -minimization,” IEEE Transactions on Information Theory , vol. 56, no. 7, pp. 3523–3539, 2010
2010
Earlier work this paper cites.
2010
Earlier work this paper cites.
H. Attouch, J. Bolte, P. Redont, and A. Soubeyran, “Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the kurdyka-lojasiewicz inequality,” Mathematics of Operations Research , vol. 35, no. 2, pp. 438–457, 2010
2010
Earlier work this paper cites.
L.-A. Gottlieb and T. Neylon, “Matrix sparsification and the sparse null space problem,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques . Springer, 2010, pp. 205–218
2010
Earlier work this paper cites.
R. H. Keshavan, A. Montanari, and S. Oh, “Matrix completion from a few entries,” Information Theory, IEEE Transactions on , vol. 56, no. 6, pp. 2980–2998, 2010
2010
Earlier work this paper cites.
D. Vainsencher, S. Mannor, and A. M. Bruckstein, “The sample complexity of dictionary learning,” Journal of Machine Learning Research , vol. 12, no. 23, pp. 3259–3281, Nov. 2011
2011
Earlier work this paper cites.
Q. Geng and J. Wright, “On the local correctness of ℓ 1 \ell^{1} -minimization for dictionary learning,” Submitted to IEEE Transactions on Information Theory , 2011, preprint: http://www.columbia.edu/~jw2966
2011
Earlier work this paper cites.
E. J. Candès, X. Li, Y. Ma, and J. Wright, “Robust principal component analysis?” Journal of the ACM (JACM) , vol. 58, no. 3, p. 11, 2011
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
P.-L. Loh and M. J. Wainwright, “High-dimensional regression with noisy and missing data: Provable guarantees with non-convexity,” in Advances in Neural Information Processing Systems , 2011, pp. 2726–2734
2011
Earlier work this paper cites.
V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky, “The convex geometry of linear inverse problems,” Foundations of Computational mathematics , vol. 12, no. 6, pp. 805–849, 2012
2012
Earlier work this paper cites.
D. A. Spielman, H. Wang, and J. Wright, “Exact recovery of sparsely-used dictionaries,” in Proceedings of the 25th Annual Conference on Learning Theory , 2012
2012
Earlier work this paper cites.
S. Arora, R. Ge, R. Kannan, and A. Moitra, “Computing a nonnegative matrix factorization–provably,” in Proceedings of the forty-fourth annual ACM symposium on Theory of computing . ACM, 2012, pp. 145–162
2012
Earlier work this paper cites.
S. Arora, R. Ge, A. Moitra, and S. Sachdeva, “Provable ICA with unknown gaussian noise, with implications for gaussian mixtures and autoencoders,” in Advances in Neural Information Processing Systems , 2012, pp. 2375–2383
2012
Cited alongside, same era.
2012
Cited alongside, same era.
N. Mehta and A. G. Gray, “Sparsity-based generalization bounds for predictive sparse coding,” Proceedings of the 30th International Conference on Machine Learning (ICML-13) , vol. 28, no. 1, pp. 36–44, 2013
2013
Cited alongside, same era.
2013
Cited alongside, same era.
M. Hardt and M. Wootters, “Fast matrix completion without the condition number,” in Proceedings of The 27th Conference on Learning Theory , 2014, pp. 638–678
2014
Later among the works it cites.
P. Netrapalli, U. Niranjan, S. Sanghavi, A. Anandkumar, and P. Jain, “Non-convex robust pca,” in Advances in Neural Information Processing Systems , 2014, pp. 1107–1115
2014
Later among the works it cites.
2014
Later among the works it cites.
2014
Later among the works it cites.
P. Jain and S. Oh, “Provable tensor factorization with missing data,” in Advances in Neural Information Processing Systems , 2014, pp. 1431–1439
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
D. L. Donoho, M. Gavish, and A. Montanari, “The phase transition of matrix recovery from gaussian measurements matches the minimax mse of matrix denoising,” Proceedings of the National Academy of Sciences , vol. 110, no. 21, pp. 8405–8410, 2013
2013
Cited alongside, same era.
2013
Cited alongside, same era.
E. J. Candés, T. Strohmer, and V. Voroninski, “Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming,” Communications on Pure and Applied Mathematics , vol. 66, no. 8, pp. 1241–1274, 2013
2013
Cited alongside, same era.
C. Bao, J.-F. Cai, and H. Ji, “Fast sparsity-based orthogonal dictionary learning for image restoration,” in Computer Vision (ICCV), 2013 IEEE International Conference on . IEEE, 2013, pp. 3384–3391
2013
Cited alongside, same era.
2013
Cited alongside, same era.
2013
Cited alongside, same era.
2013
Cited alongside, same era.
2014
Later among the works it cites.
2014
Later among the works it cites.
2014
Later among the works it cites.
C. Bao, H. Ji, Y. Quan, and Z. Shen, “L0 norm based dictionary learning by proximal methods with global convergence,” in Computer Vision and Pattern Recognition (CVPR), 2014 IEEE Conference on . IEEE, 2014, pp. 3858–3865
2014
Later among the works it cites.
C. Bao, Y. Quan, and H. Ji, “A convergent incoherent dictionary learning algorithm for sparse coding,” in Computer Vision–ECCV 2014 . Springer, 2014, pp. 302–316
2014
Later among the works it cites.
C. Bao, H. Ji, and Z. Shen, “Convergence analysis for iterative data-driven tight frame construction scheme,” Applied and Computational Harmonic Analysis , 2014
2014
Later among the works it cites.
2014
Later among the works it cites.
R. Livni, S. Shalev-Shwartz, and O. Shamir, “On the computational efficiency of training neural networks,” in Advances in Neural Information Processing Systems , 2014, pp. 855–863
2014
Later among the works it cites.
J. Sun, Q. Qu, and J. Wright, “Complete dictionary recovery using nonconvex optimization,” in Proceedings of the 32nd International Conference on Machine Learning (ICML-15) , 2015, pp. 2351–2360
2015
Closest in time.
——, “Complete dictionary recovery over the sphere,” arXiv preprint arXiv:1504.06785 , 2015
2015
Closest in time.
2015
Closest in time.
Y. Li, K. Lee, and Y. Bresler, “Identifiability and stability in blind deconvolution under minimal assumptions,” arXiv preprint arXiv , vol. 1507, 2015
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
R. Ge, F. Huang, C. Jin, and Y. Yuan, “Escaping from saddle points—online stochastic gradient for tensor decomposition,” in Proceedings of The 28th Conference on Learning Theory , 2015, pp. 797–842
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
E. Candès, X. Li, and M. Soltanolkotabi, “Phase retrieval via wirtinger flow: Theory and algorithms,” Information Theory, IEEE Transactions on , vol. 61, no. 4, pp. 1985–2007, April 2015
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2016
Closest in time.
2016
Closest in time.
2016
Closest in time.
2016
Closest in time.
2016
Closest in time.
N. Boumal, “Nonconvex phase synchronization,” arXiv preprint arXiv:1601.06114 , 2016
2016
Closest in time.
2016
Closest in time.