Fetching the paper…
Reading the bibliography…
Low-rank modeling plays a pivotal role in signal processing and machine learning, with applications ranging from collaborative filtering, video surveillance, medical imaging, to dimensionality reduction and adaptive filtering.
P. W. Holland, K. B. Laskey, and S. Leinhardt, “Stochastic blockmodels: Some first steps,” Social Networks , vol. 5, pp. 109–137, 1983
1983
Earlier work this paper cites.
I. Jolliffe, Principal Component Analysis . Springer-Verlag, 1986
1986
Earlier work this paper cites.
L. Scharf and D. Tufts, “Rank reduction for modeling stationary signals,” IEEE Transactions on Acoustics, Speech, and Signal Processing , vol. 35, no. 3, pp. 350–355, 1987
1987
Earlier work this paper cites.
B. Yang, “Projection approximation subspace tracking,” IEEE Transactions on Signal processing , vol. 43, no. 1, pp. 95–107, 1995
1995
Earlier work this paper cites.
K.-C. Toh, M. J. Todd, and R. H. Tütüncü, “SDPT3—MATLAB software package for semidefinite programming,” Optimization methods and software , vol. 11, no. 1-4, pp. 545–581, 1999
1999
Earlier work this paper cites.
A. Condon and R. M. Karp, “Algorithms for graph partitioning on the planted partition model,” Random Structures and Algorithms , vol. 18, no. 2, pp. 116–140, 2001
2001
Earlier work this paper cites.
R. Basri and D. W. Jacobs, “Lambertian reflectance and linear subspaces,” IEEE Transactions on Pattern Analysis and Machine Intelligencen , vol. 25, no. 2, pp. 218–233, 2003
2003
Earlier work this paper cites.
M. Fazel, H. Hindi, and S. P. Boyd, “Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices,” American Control Conference , vol. 3, pp. 2156 – 2162 vol.3, June 2003
2003
Earlier work this paper cites.
S. Burer and R. D. C. Monteiro, “Local minima and convergence in low-rank semidefinite programming,” Mathematical Programming , vol. 103, no. 3, pp. 427–444, 2005
2005
Earlier work this paper cites.
E. J. Candès, J. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,” Communications on Pure and Applied Mathematics , vol. 59, no. 8, pp. 1207–1223, 2006
2006
Earlier work this paper cites.
D. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory , vol. 52, no. 4, pp. 1289 –1306, April 2006
2006
Earlier work this paper cites.
R. Balan, P. Casazza, and D. Edidin, “On signal reconstruction without phase,” Applied and Computational Harmonic Analysis , vol. 20, no. 3, pp. 345–356, 2006
2006
Earlier work this paper cites.
Y. Nesterov and B. T. Polyak, “Cubic regularization of newton method and its global performance,” Mathematical Programming , vol. 108, no. 1, pp. 177–205, 2006
2006
Earlier work this paper cites.
B. Kulis, A. C. Surendran, and J. C. Platt, “Fast low-rank semidefinite programming for embedding and clustering,” in International Conference on Artificial Intelligence and Statistics , 2007, pp. 235–242
2007
Earlier work this paper cites.
J. Bennett and S. Lanning, “The Netflix prize,” in Proceedings of KDD Cup and Workshop , 2007, p. 35
2007
Earlier work this paper cites.
E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational Mathematics , vol. 9, no. 6, pp. 717–772, April 2009
2009
Earlier work this paper cites.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM Journal on Imaging Sciences , vol. 2, no. 1, pp. 183–202, 2009
2009
Earlier work this paper cites.
Z. Lin, M. Chen, L. Wu, and Y. Ma, “The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices,” UIUC Technical Report UILU-ENG-09-2215 , 2009
2009
Earlier work this paper cites.
R. H. Keshavan, A. Montanari, and S. Oh, “Matrix completion from a few entries,” IEEE Transactions on Information Theory , vol. 56, no. 6, pp. 2980–2998, 2010
2010
Earlier work this paper cites.
E. J. Candès and T. Tao, “The power of convex relaxation: Near-optimal matrix completion,” IEEE Transactions on Information Theory , vol. 56, no. 5, pp. 2053–2080, 2010
2010
Earlier work this paper cites.
D. Gross, Y.-K. Liu, S. T. Flammia, S. Becker, and J. Eisert, “Quantum state tomography via compressed sensing,” Physical review letters , vol. 105, no. 15, p. 150401, 2010
2010
Earlier work this paper cites.
B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,” SIAM Review , vol. 52, no. 471, 2010
2010
Earlier work this paper cites.
R. H. Keshavan, A. Montanari, and S. Oh, “Matrix completion from a few entries,” IEEE Transactions on Information Theory , vol. 56, no. 6, pp. 2980 –2998, June 2010
2010
Earlier work this paper cites.
J.-F. Cai, E. J. Candès, and Z. Shen, “A singular value thresholding algorithm for matrix completion,” SIAM Journal on Optimization , vol. 20, no. 4, pp. 1956–1982, 2010
2010
Earlier work this paper cites.
K.-C. Toh and S. Yun, “An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems,” Pacific Journal of Optimization , vol. 6, no. 615-640, p. 15, 2010
2010
Earlier work this paper cites.
P. Jain, R. Meka, and I. S. Dhillon, “Guaranteed rank minimization via singular value projection,” in Advances in Neural Information Processing Systems , 2010, pp. 937–945
2010
Earlier work this paper cites.
D. Gross, “Recovering low-rank matrices from few coefficients in any basis,” IEEE Transactions on Information Theory , vol. 57, no. 3, pp. 1548–1566, March 2011
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 , vol. 58, no. 3, pp. 11:1–11:37, 2011
2011
Earlier work this paper cites.
E. J. Candès and Y. Plan, “Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements,” IEEE Transactions on Information Theory , vol. 57, no. 4, pp. 2342–2359, 2011
2011
Earlier work this paper cites.
B. Recht, W. Xu, and B. Hassibi, “Null space conditions and thresholds for rank minimization,” Mathematical Programming , vol. 127, no. 1, pp. 175–202, 2011
2011
Earlier work this paper cites.
B. Recht, “A simpler approach to matrix completion,” Journal of Machine Learning Research , vol. 12, pp. 3413–3430, Feburary 2011
2011
Earlier work this paper cites.
V. Koltchinskii, K. Lounici, and A. B. Tsybakov, “Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion,” The Annals of Statistics , vol. 39, no. 5, pp. 2302–2329, 2011
2011
Earlier work this paper cites.
N. Halko, P.-G. Martinsson, and J. A. Tropp, “Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions,” SIAM Revieweview , vol. 53, no. 2, pp. 217–288, 2011
2011
Earlier work this paper cites.
Y. Chi, L. Scharf, A. Pezeshki, and A. Calderbank, “Sensitivity to basis mismatch in compressed sensing,” IEEE Transactions on Signal Processing , vol. 59, no. 5, pp. 2182–2195, May 2011
2011
Cited alongside, same era.
S. Negahban and M. Wainwright, “Restricted strong convexity and weighted matrix completion: Optimal bounds with noise,” The Journal of Machine Learning Research , vol. 98888, pp. 1665–1697, May 2012
2012
Cited alongside, same era.
V. Chandrasekaran, P. A. Parrilo, and A. S. Willsky, “Latent variable graphical model selection via convex optimization,” The Annals of Statistics , vol. 40, no. 4, pp. 1935–1967, 2012
2012
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.
S. Tu, R. Boczar, M. Simchowitz, M. Soltanolkotabi, and B. Recht, “Low-rank solutions of linear matrix equations via Procrustes flow,” in International Conference on Machine Learning , 2016, pp. 964–973
2016
Later among the works it cites.
2016
Later among the works it cites.
R. Ge, J. D. Lee, and T. Ma, “Matrix completion has no spurious local minimum,” in Advances in Neural Information Processing Systems 29 , 2016
2016
Later among the works it cites.
S. Bhojanapalli, B. Neyshabur, and N. Srebro, “Global optimality of local search for low rank matrix recovery,” in Advances in Neural Information Processing Systems , 2016, pp. 3873–3881
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Javanmard and A. Montanari, “Localization from incomplete noisy distance measurements,” Foundations of Computational Mathematics , vol. 13, no. 3, pp. 297–345, 2013
2013
Cited alongside, same era.
A. S. Bandeira, E. Dobriban, D. G. Mixon, and W. F. Sawin, “Certifying the restricted isometry property is hard,” IEEE Tansactions on Information Theory , vol. 59, no. 6, pp. 3448–3450, 2013
2013
Cited alongside, same era.
M. Jaggi, “Revisiting Frank-Wolfe: Projection-free sparse convex optimization,” in International Conference on Machine Learning , 2013, pp. 427–435
2013
Cited alongside, same era.
P. Jain, P. Netrapalli, and S. Sanghavi, “Low-rank matrix completion using alternating minimization,” in Proceedings of the 45th Annual ACM Symposium on Theory of Computing , 2013, pp. 665–674
2013
Cited alongside, same era.
A. Ahmed, B. Recht, and J. Romberg, “Blind deconvolution using convex programming,” IEEE Transactions on Information Theory , vol. 60, no. 3, pp. 1711–1732, 2014
2014
Cited alongside, same era.
S. Chatterjee, “Matrix estimation by universal singular value thresholding,” The Annals of Statistics , vol. 43, no. 1, pp. 177–214, 2014
2014
Cited alongside, same era.
Y. Chen, S. Sanghavi, and H. Xu, “Improved graph clustering,” IEEE Transactions on Information Theory , vol. 60, no. 10, pp. 6440–6455, 2014
2014
Cited alongside, same era.
V. Cevher, S. Becker, and M. Schmidt, “Convex optimization for big data: Scalable, randomized, and parallel algorithms for big data analytics,” IEEE Signal Processing Magazine , vol. 31, no. 5, pp. 32–43, 2014
2014
Cited alongside, same era.
J. Sun, Q. Qu, and J. Wright, “A geometric analysis of phase retrieval,” in IEEE International Symposium on Information Theory (ISIT) . IEEE, 2016, pp. 2379–2383
2016
Later among the works it cites.
H. Zhang, Y. Chi, and Y. Liang, “Provable non-convex phase retrieval with outliers: Median truncated Wirtinger flow,” in International Conference on Machine Learning (ICML) , 2016, pp. 1022–1031
2016
Later among the works it cites.
A. S. Bandeira, N. Boumal, and V. Voroninski, “On the low-rank approach for semidefinite programs arising in synchronization and community detection,” in 29th Annual Conference on Learning Theory , 2016, pp. 361–382
2016
Later among the works it cites.
X. Yi, D. Park, Y. Chen, and C. Caramanis, “Fast algorithms for robust PCA via gradient descent,” in Neural Information Processing Systems Conference (NIPS) , 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
K. H. Jin, D. Lee, and J. C. Ye, “A general framework for compressed sensing and parallel mri using annihilating filter based low-rank hankel matrix,” IEEE Transactions on Computational Imaging , vol. 2, no. 4, pp. 480–495, 2016
2016
Later among the works it cites.
W. Liao and A. Fannjiang, “Music for single-snapshot spectral estimation: Stability and super-resolution,” Applied and Computational Harmonic Analysis , vol. 40, no. 1, pp. 33–67, 2016
2016
Later among the works it cites.
Y. Chen and J. Xu, “Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices,” Journal of Machine Learning Research , vol. 17, no. 27, pp. 1–57, 2016
2016
Later among the works it cites.
F. M. Harper and J. A. Konstan, “The MovieLens datasets: History and context,” ACM Transactions on Interactive Intelligent Systems (TiiS) , vol. 5, no. 4, p. 19, 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
R. M. Freund, P. Grigas, and R. Mazumder, “An extended Frank-Wolfe method with in-face directions, and its application to low-rank matrix completion,” SIAM Journal on Optimization , vol. 27, no. 1, pp. 319–346, 2017
2017
Later among the works it cites.
N. Boyd, G. Schiebinger, and B. Recht, “The alternating descent conditional gradient method for sparse inverse problems,” SIAM Journal on Optimization , vol. 27, no. 2, pp. 616–639, 2017
2017
Later among the works it cites.
Z. Allen-Zhu, E. Hazan, W. Hu, and Y. Li, “Linear convergence of a Frank-Wolfe type algorithm over trace-norm balls,” in Advances in Neural Information Processing Systems , 2017, pp. 6192–6201
2017
Later among the works it cites.
A. Yurtsever, M. Udell, J. Tropp, and V. Cevher, “Sketchy decisions: Convex low-rank matrix optimization with optimal storage,” in Artificial Intelligence and Statistics , 2017, pp. 1188–1196
2017
Later among the works it cites.
Y. Chen and E. J. Candès, “Solving random quadratic systems of equations is nearly as easy as solving linear systems,” Communications on Pure and Applied Mathematics , vol. 5, no. 70, pp. 822–883, 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
C. Jin, R. Ge, P. Netrapalli, S. M. Kakade, and M. I. Jordan, “How to escape saddle points efficiently,” in International Conference on Machine Learning (ICML) , 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
H. Qiao and P. Pal, “Gridless line spectrum estimation and low-rank Toeplitz matrix compression using structured samplers: A regularization-free approach,” IEEE Transactions on Signal Processing , vol. 65, no. 9, pp. 2221–2236, 2017
2017
Later among the works it cites.
E. Abbe, “Community detection and the stochastic block model: recent developments,” Journal of Machine Learning Research, to appear , 2017. [Online]. Available: http://www.princeton.edu/˜eabbe/publications/sbm_jmlr_4.pdf
2017
Later among the works it cites.
Y. Chen, X. Yi, and C. Caramanis, “Convex and nonconvex formulations for mixed regression with two components: Minimax optimal rates,,” IEEE Transactions on Information Theory, to appear , 2017
2017
Later among the works it cites.
N. Vaswani, S. Nayer, and Y. C. Eldar, “Low-rank phase retrieval,” IEEE Transactions on Signal Processing , vol. 65, no. 15, pp. 4059–4074, 2017
2017
Later among the works it cites.
X. Li, S. Ling, T. Strohmer, and K. Wei, “Rapid, robust, and reliable blind deconvolution via nonconvex optimization,” to appear in Applied and Computational Harmonic Analysis , 2018
2018
Closest in time.
2018
Closest in time.