The DOI matches its Crossref record; 124 of the 124 references it cites were found in a registry or an index.
An Overview of Low-Rank Matrix Recovery From Incomplete Observations
Open accessAbstract
Low-rank matrices play a fundamental role in modeling and computational methods for signal processing and machine learning. In many applications where low-rank matrices arise, these matrices cannot be fully sampled or directly observed, and one encounters the problem of recovering the matrix given only incomplete and indirect observations. This paper provides an overview of modern techniques for exploiting low-rank structure to perform matrix recovery in these settings, providing a survey of recent advances in this rapidly-developing field. Specific attention is paid to the algorithms most commonly used in practice, the existing theoretical guarantees for these algorithms, and representative practical applications of these techniques.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Donoho, D. L. (2004) · Cited by 16,703
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
LIII. On lines and planes of closest fit to systems of points in space
Pearson, K. (1901) · The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science · doi:10.1080/14786440109462720 · Cited by 11,934
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Analysis of a complex of statistical variables into principal components.
Hotelling, H. (1933) · Journal of Educational Psychology · doi:10.1037/h0071325 · Cited by 9,633
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Phase retrieval algorithms: a comparison
Fienup, J. R. (1982) · Applied Optics · doi:10.1364/ao.21.002758 · Cited by 5,596
Blei, D. M. (2012) · Communications of the ACM · doi:10.1145/2133806.2133826 · Cited by 5,516
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Using collaborative filtering to weave an information tapestry
Goldberg, D., Nichols, D., Oki, B. M., & Terry, D. (1992) · Communications of the ACM · doi:10.1145/138859.138867 · Cited by 4,066
Halko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Sparse Principal Component Analysis
Zou, H., Hastie, T., & Tibshirani, R. (2006) · Journal of Computational and Graphical Statistics · doi:10.1198/106186006x113430 · Cited by 3,152
Proximal Splitting Methods in Signal Processing
Combettes, P. L., & Pesquet, J.-C. (2011) · Springer Optimization and Its Applications · doi:10.1007/978-1-4419-9569-8_10 · Cited by 2,183
Introduction to the non-asymptotic analysis of random matrices
Vershynin, R. (2012) · Compressed Sensing · doi:10.1017/cbo9780511794308.006 · Cited by 2,150
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Candes, E. J., & Tao, T. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2044061 · Cited by 2,060
Analysis of a complex of statistical variables into principal components.
Hotelling, H. (1933) · Journal of Educational Psychology · doi:10.1037/h0070888 · Cited by 1,979
Modern Multidimensional Scaling
Borg, I., & Groenen, P. (1997) · Springer Series in Statistics · doi:10.1007/978-1-4757-2711-1 · Cited by 1,728
Candes, E. J., & Plan, Y. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2035722 · Cited by 1,709
Regularization methods for learning incomplete matrices
Mazumder, R., Hastie, T. J., & Tibshirani, R. J. (2009) · Journal of Machine Learning Research · doi:10.48550/arxiv.0906.2034 · Cited by 1,639
Convex multi-task feature learning
Argyriou, A., Evgeniou, T., & Pontil, M. (2008) · Machine Learning · doi:10.1007/s10994-007-5040-8 · Cited by 1,528
The Method of Paired Comparisons.
Curnow, R. N., & David, H. A. (1964) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344014 · Cited by 1,271
PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
Candès, E. J., Strohmer, T., & Voroninski, V. (2013) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21432 · Cited by 1,197
Phase Retrieval with Application to Optical Imaging: A contemporary overview
Shechtman, Y., Eldar, Y. C., Cohen, O., Chapman, H. N., Miao, J., & Segev, M. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2352673 · Cited by 1,131
Dumais, S. T. (2004) · Annual Review of Information Science and Technology · doi:10.1002/aris.1440380105 · Cited by 1,107
Quantum State Tomography via Compressed Sensing
Gross, D., Liu, Y.-K., Flammia, S. T., Becker, S., & Eisert, J. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.150401 · Cited by 1,093
Phase Retrieval via Wirtinger Flow: Theory and Algorithms
Candès, E. J., Li, X., & Soltanolkotabi, M. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2399924 · Cited by 1,049
1 USER-FRIENDLY TAIL BOUNDS FOR SUMS OF RANDOM MATRICES
Tropp, J. A. (2010) · Cited by 1,018
Adaptive estimation of a quadratic functional by model selection
Laurent, B., & Massart, P. (2000) · The Annals of Statistics · doi:10.1214/aos/1015957395 · Cited by 995
Matrix Completion From a Few Entries
Keshavan, R. H., Montanari, A., & Oh, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2046205 · Cited by 974
Maximum-Margin Matrix Factorization
Srebro, N., Rennie, J. D. M., & Jaakkola, T. (2004) · Cited by 962
The geometry of graphs and some of its algorithmic applications
Linial, N., London, E., & Rabinovich, Y. (1995) · Combinatorica · doi:10.1007/bf01200757 · Cited by 952
Fast maximum margin matrix factorization for collaborative prediction
Rennie, J. D. M., & Srebro, N. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102441 · Cited by 939
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2010) · Cited by 921
Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization
Jaggi, M. (2013) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 911
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-012-9135-7 · Cited by 886
Low-rank matrix completion using alternating minimization
Jain, P., Netrapalli, P., & Sanghavi, S. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488693 · Cited by 817
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Burer, S., & Monteiro, R. D. C. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0352-8 · Cited by 770
User-Friendly Tail Bounds for Sums of Random Matrices
Tropp, J. A. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9099-z · Cited by 718
A Simpler Approach to Matrix Completion
Recht, B. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0910.0651 · Cited by 673
Spectral Regularization Algorithms for Learning Large Incomplete Matrices
MazumderRahul, HastieTrevor, & TibshiraniRobert (2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1859931 · Cited by 671
Matrix completion from a few entries
Keshavan, R. H., Oh, S., & Montanari, A. (2009) · 2009 IEEE International Symposium on Information Theory · doi:10.1109/isit.2009.5205567 · Cited by 650
Semidefinite programming based algorithms for sensor network localization
Biswas, P., Lian, T.-C., Wang, T.-C., & Ye, Y. (2006) · ACM Transactions on Sensor Networks · doi:10.1145/1149283.1149286 · Cited by 631
Candès, E. J. (2007) · Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006 · doi:10.4171/022-3/69 · Cited by 612
Recovering Low-Rank Matrices From Few Coefficients in Any Basis
Gross, D. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2104999 · Cited by 602
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
Koltchinskii, V., Lounici, K., & Tsybakov, A. B. (2011) · The Annals of Statistics · doi:10.1214/11-aos894 · Cited by 598
Handbook of Modern Item Response Theory.
MW, der Linden, W. J. V., & Hambleton, R. K. (1997) · Journal of the American Statistical Association · doi:10.2307/2965612 · Cited by 581
Recovering low-rank matrices from few coefficients in any basisPreprint
Gross, D. (2010) · Cited by 576
Fazel, M., Hindi, H., & Boyd, S. P. (2004) · Proceedings of the 2003 American Control Conference, 2003. · doi:10.1109/acc.2003.1243393 · Cited by 574
Kim, H., & Park, H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/07069239x · Cited by 574
Phase recovery, MaxCut and complex semidefinite programming
Waldspurger, I., d’Aspremont, A., & Mallat, S. (2015) · Mathematical Programming · doi:10.1007/s10107-013-0738-9 · Cited by 573
Multichannel blind identification: from subspace to maximum likelihood methods
Tong, L., & Perreau, S. (1998) · Proceedings of the IEEE · doi:10.1109/5.720247 · Cited by 572
Candès, E. J., & Plan, Y. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2111771 · Cited by 569
Natural image statistics and efficient coding
Olshausen, B. A., & Field, D. J. (1996) · Network: Computation in Neural Systems · doi:10.1088/0954-898x_7_2_014 · Cited by 561
Phase Retrieval Using Alternating Minimization
Netrapalli, P., Jain, P., & Sanghavi, S. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2448516 · Cited by 535
Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
Liu, Z., & Vandenberghe, L. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090755436 · Cited by 490
Introduction to compressed sensing
Davenport, M. A., Duarte, M. F., Eldar, Y. C., & Kutyniok, G. (2012) · Compressed Sensing · doi:10.1017/cbo9780511794308.002 · Cited by 484
Self-citationJoint covariate selection and joint subspace selection for multiple classification problems
Obozinski, G., Taskar, B., & Jordan, M. I. (2010) · Statistics and Computing · doi:10.1007/s11222-008-9111-x · Cited by 451
Modern Multidimensional Scaling
(2005) · Springer Series in Statistics · doi:10.1007/0-387-28981-x · Cited by 432
Strong converse for identification via quantum channels
Ahlswede, R., & Winter, A. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.985947 · Cited by 423
Guaranteed Rank Minimization via Singular Value Projection
Jain, P., Meka, R., & Dhillon, I. S. (2010) · Cited by 420
Living on the edge: phase transitions in convex programs with random data
Amelunxen, D., Lotz, M., McCoy, M. B., & Tropp, J. A. (2014) · Information and Inference · doi:10.1093/imaiai/iau005 · Cited by 413
Blind image deconvolution: theory and applications
Campisi, P., & Egiazarian, K. (2007) · Iris (Roma Tre University) · Cited by 412
Randomized Algorithms for Matrices and Data
MAHONEY, M. (2012) · Chapman & Hall/CRC Data Mining and Knowledge Discovery Series · doi:10.1201/b11822-37 · Cited by 409
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
Negahban, S. N., & Wainwright, M. J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1009.2118 · Cited by 402
Blind Deconvolution Using Convex Programming
Ahmed, A., Recht, B., & Romberg, J. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2294644 · Cited by 387
Self-citationPhase retrieval from coded diffraction patterns
Candès, E. J., Li, X., & Soltanolkotabi, M. (2015) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2014.09.004 · Cited by 387
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
Clarkson, K. L. (2010) · ACM Transactions on Algorithms · doi:10.1145/1824777.1824783 · Cited by 379
Rank Awareness in Joint Sparse Recovery
Davies, M. E., & Eldar, Y. C. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173722 · Cited by 351
Local Minima and Convergence in Low-Rank Semidefinite Programming
Burer, S., & Monteiro, R. D. C. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0564-1 · Cited by 347
Estimation of high-dimensional low-rank matrices
Rohde, A., & Tsybakov, A. B. (2011) · The Annals of Statistics · doi:10.1214/10-aos860 · Cited by 330
Theory of semidefinite programming for Sensor Network Localization
So, A. M.-C., & Ye, Y. (2007) · Mathematical Programming · doi:10.1007/s10107-006-0040-1 · Cited by 326
Srebro, N., & Shraibman, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11503415_37 · Cited by 316
Iterative reweighted algorithms for matrix rank minimization
Mohan, K., & Fazel, M. (2012) · doi:10.5555/2503308.2503351 · Cited by 312
A Simpler Approach to Matrix Completion
RechtBenjamin (2011) · Journal of Machine Learning Research · doi:10.5555/1953048.2185803 · Cited by 310
Probabilistic framework for the adaptation and comparison of image codes
Lewicki, M. S., & Olshausen, B. A. (1999) · Journal of the Optical Society of America A · doi:10.1364/josaa.16.001587 · Cited by 308
Parallel stochastic gradient algorithms for large-scale matrix completion
Recht, B., & Ré, C. (2013) · Mathematical Programming Computation · doi:10.1007/s12532-013-0053-8 · Cited by 300
Solving Quadratic Equations via PhaseLift When There Are About as Many Equations as Unknowns
Candès, E. J., & Li, X. (2014) · Foundations of Computational Mathematics · doi:10.1007/s10208-013-9162-z · Cited by 292
On Milman's inequality and random subspaces which escape through a mesh in ℝ n
Gordon, Y. (1988) · Lecture Notes in Mathematics · doi:10.1007/bfb0081737 · Cited by 282
Davenport, M. A., Plan, Y., van den Berg, E., & Wootters, M. (2014) · Information and Inference · doi:10.1093/imaiai/iau006 · Cited by 277
Self-citationLearning with matrix factorizations
Srebro, N., & Jaakkola, T. (2004) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 276
ADMiRA: Atomic Decomposition for Minimum Rank Approximation
Lee, K., & Bresler, Y. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054251 · Cited by 267
Randomized algorithms for matrices and dataPreprint
Mahoney, M. W. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1104.5557 · Cited by 260
Self-calibration and biconvex compressive sensing
Ling, S., & Strohmer, T. (2015) · Inverse Problems · doi:10.1088/0266-5611/31/11/115002 · Cited by 229
Understanding Alternating Minimization for Matrix Completion
Hardt, M. (2014) · 2014 IEEE 55th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2014.75 · Cited by 216
A Simple Algorithm for Nuclear Norm Regularized Problems
Jaggi, M., & Sulovský, M. (2010) · Cited by 214
Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
Chen, Y., Chi, Y., & Goldsmith, A. J. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2429594 · Cited by 205
Matrix Completion from Noisy Entries
Keshavan, R. H., Andrea Montanari, A., & Oh, S. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0906.2027 · Cited by 202
Low-rank Solutions of Linear Matrix Equations via Procrustes FlowPreprint
Tu, S., Boczar, R., Simchowitz, M., Soltanolkotabi, M., & Recht, B. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.03566 · Cited by 180
Blind Image Deconvolution: Theory and Applications
(2017) · CRC Press eBooks · doi:10.1201/9781420007299 · Cited by 178
Sparse factor analysis for learning and content analyticsPreprint
Lan, A., Waters, A. E., Studer, C., & Baraniuk, R. G. (2014) · arXiv (Cornell University) · doi:10.5555/2627435.2670314 · Cited by 175
Low rank matrix recovery from rank one measurements
Kueng, R., Rauhut, H., & Terstiege, U. (2017) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2015.07.007 · Cited by 173
Incoherence-Optimal Matrix Completion
Chen, Y. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2415195 · Cited by 171
Rank-Constrained Solutions to Linear Matrix Equations Using PowerFactorization
Haldar, J. P., & Hernando, D. (2009) · IEEE Signal Processing Letters · doi:10.1109/lsp.2009.2018223 · Cited by 156
Landauer, T. K. (2005) · Wiley eBooks · doi:10.1002/0470018860.s00561 · Cited by 153
Normalized Iterative Hard Thresholding for Matrix Completion
Tanner, J., & Wei, K. (2013) · SIAM Journal on Scientific Computing · doi:10.1137/120876459 · Cited by 137
Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
Simon, H. D., & Hongyuan Zha, B. (2000) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827597327309 · Cited by 137
A Max-Norm Constrained Minimization Approach to 1-Bit Matrix CompletionPreprint
Cai, T., & Zhou, W. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1309.6013 · Cited by 125
Stable Optimizationless Recovery from Phaseless Linear Measurements
Demanet, L., & Hand, P. (2013) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-013-9305-2 · Cited by 124
Phase Transitions and Sample Complexity in Bayes-Optimal Matrix Factorization
Kabashima, Y., Krząkała, F., Mézard, M., Sakata, A., & Zdeborová, L. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2556702 · Cited by 121
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
Singer, A., & Cucuringu, M. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090750688 · Cited by 117
A remark on global positioning from local distances
Singer, A. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0709842104 · Cited by 106
Fast matrix completion without the condition numberPreprint
Hardt, M., & Wootters, M. K. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.4070 · Cited by 84
Compressed Sensing and Affine Rank Minimization Under Restricted Isometry
Cai, T., & Zhang, A. R. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2259164 · Cited by 79
Lee, K., Wu, Y., & Bresler, Y. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2784479 · Cited by 71
Identifiability in Blind Deconvolution With Subspace or Sparsity Constraints
Li, Y., Lee, K., & Bresler, Y. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2569578 · Cited by 70
Learning Sparsely Used Overcomplete Dictionaries
Agarwal, A., Anandkumar, A., Jain, P., Netrapalli, P., & Tandon, R. (2014) · Cited by 69
Poisson Matrix Recovery and Completion
Cao, Y., & Xie, Y. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2500192 · Cited by 64
Dropping Convexity for Faster Semi-definite OptimizationPreprint
Bhojanapalli, S., Kyrillidis, A., & Sanghavi, S. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.03917 · Cited by 53
Completing any low-rank matrix, provably
ChenYudong, BhojanapalliSrinadh, SanghaviSujay, & WardRachel (2015) · Journal of Machine Learning Research · doi:10.5555/2789272.2912096 · Cited by 44
Individualized rank aggregation using nuclear norm regularization
Lu, Y., & Negahban, S. N. (2015) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2015.7447183 · Cited by 42
Efficient algorithms for collaborative filtering
Keshavan, R. H. (2012) · Cited by 41
Noisy Matrix Completion Under Sparse Factor Models
Soni, A., Jain, S., Haupt, J., & Gonella, S. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2549040 · Cited by 40
The local convexity of solving systems of quadratic equationsPreprint
White, C. D., Sanghavi, S., & Ward, R. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.07868 · Cited by 32
Compressive Multiplexing of Correlated Signals
Ahmed, A. M., & Romberg, J. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2366459 · Cited by 32
Self-citation1-bit matrix completion under exact low-rank constraint
Bhaskar, S. A., & Javanmard, A. (2015) · Conference on Information Sciences and Systems · doi:10.1109/ciss.2015.7086879 · Cited by 30
Near Optimal Compressed Sensing of Sparse Rank-One Matrices via Sparse Power Factorization.Preprint
Lee, K., Wu, Y., & Bresler, Y. (2013) · arXiv (Cornell University) · Cited by 29
Conjugate gradient acceleration of iteratively re-weighted least squares methods
Fornasier, M., Peter, S., Rauhut, H., & Worm, S. (2016) · Computational Optimization and Applications · doi:10.1007/s10589-016-9839-8 · Cited by 25
Bahmani, S., & Romberg, J. (2016) · Information and Inference A Journal of the IMA · doi:10.1093/imaiai/iaw012 · Cited by 17
Self-citationTight recovery thresholds and robustness analysis for nuclear norm minimization
Oymak, S., & Hassibi, B. (2011) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2011.6033977 · Cited by 8
Cited by
Federated Learning via Over-the-Air Computation
Yang, K., Jiang, T., Shi, Y., & Ding, Z. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2961673 · Cited by 1,084
“Sparse optimization and low-rank optimization have attracted much attention in machine learning, signal processing, high-dimensional statistics, as well as wireless communication [30], [31], [32], [33], [34].”
BackgroundXu, W., Yang, Z., Ng, D. W. K., Levorato, M., Eldar, Y. C., & Debbah, M. (2023) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2023.3239189 · Cited by 660
Exploring genetic interaction manifolds constructed from rich single-cell phenotypes
Norman, T. M., Horlbeck, M. A., Replogle, J. M., Ge, A. Y., Xu, A., Jost, M., Gilbert, L. A., & Weissman, J. S. (2019) · Science · doi:10.1126/science.aax4438 · Cited by 392
Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
Chi, Y., Lu, Y. M., & Chen, Y. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2937282 · Cited by 360
Sparse methods for direction-of-arrival estimation
Yang, Z., Li, J., Stoica, P., & Xie, L. (2018) · Academic Press Library in Signal Processing, Volume 7 · doi:10.1016/b978-0-12-811887-0.00011-0 · Cited by 332
Metadata
- Authors
- Davenport, M. A., & Romberg, J.
- Venue
- IEEE Journal of Selected Topics in Signal Processing
- Published
- 2016-06
- Volume
- 10
- Issue
- 4
- Pages
- 608-622
- ISSN
- 1932-4553 (ISSN-L)
- 1941-0484
- OpenAlex
- W2268674159
- Cited by
- 439
- References
- 124
- FWCI
- 41.16
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.