The DOI matches its Crossref record; 267 of the 279 references it cites were found in a registry or an index.
Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
Open accessAbstract
Substantial progress has been made recently on developing provably accurate and efficient algorithms for low-rank matrix factorization via nonconvex optimization. While conventional wisdom often takes a dim view of nonconvex optimization algorithms due to their susceptibility to spurious local minima, simple iterative methods such as gradient descent have been remarkably successful in practice. The theoretical footings, however, had been largely lacking until recently. In this tutorial-style overview, we highlight the important role of statistical models in enabling efficient nonconvex optimization with performance guarantees. We review two contrasting approaches: (1) two-stage algorithms, which consist of a tailored initialization step followed by successive refinement; and (2) global landscape analysis and initialization-free algorithms. Several canonical matrix factorization problems are discussed, including but not limited to matrix sensing, phase retrieval, matrix completion, blind deconvolution, and robust principal component analysis. Special care is taken to illustrate the key technical insights underlying their analyses. This article serves as a testament that the integrated consideration of optimization and statistics leads to fruitful research findings.
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
Figures
![Fig. 1 An example of f ( · ) taken from [21]. Here, f ( x ) = x 2 if x ∈ [ -6 , 6] and f ( x ) = x 2 +1 . 5 | x | (cos( | x | -6) -1) if | x | > 6 . It satisfies RC ( μ, λ , ζ ) with some μ, λ > 0 and ζ = ∞ , but is clearly nonconvex.](https://figures.cochat.ai/paper-figures/efaa47591b5349acbef65a17306cdcb7/nonconvex-optimization-meets-low-rank-matrix-factorization-an-overview-figure-1.png)
![Fig. 2 Illustration of the function f ( x ) = 1 4 ‖ xx ⊤ -M ‖ 2 F , where x = [ x 1 , x 2 ] ⊤ and M =[ 1 -0 . 5 -0 . 5 1 ] .](https://figures.cochat.ai/paper-figures/a0e28a4860794cd1847da664546e9c3b/nonconvex-optimization-meets-low-rank-matrix-factorization-an-overview-figure-2.png)

![Fig. 4 Comparisons of 3 designs of the preprocessing function for estimating a 64 × 64 cameraman image from phaseless measurements under Poisson noise. (Red curve) the subset scheme in (119), where the parameter γ has been optimized for each fixed α ; (Green curve) the function T ∗ α ( · ) defined in [129]; (Blue curve) the uniformly optimal design T ∗ ( · ) in [130].](https://figures.cochat.ai/paper-figures/e8c537207c1141a888de05d5b42b9ec8/nonconvex-optimization-meets-low-rank-matrix-factorization-an-overview-figure-4.png)
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Fortunately, under the high-dimensional statistical setting, the local strong convexity and smoothness of the nonconvex loss functions can be exploited to tame the nonconvexity for various learning models, e.g., blind demixing [189], phase retrieval [254], and shallow neural networks [255].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [254]
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
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Robust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
Phase retrieval algorithms: a comparison
Fienup, J. R. (1982) · Applied Optics · doi:10.1364/ao.21.002758 · Cited by 5,596
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
A practical algorithm for the determination of phase from image and diffraction plane pictures
Gerchberg, R. W. (1972) · Optik · Cited by 4,519
Halko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
The restricted isometry property and its implications for compressed sensing
Candès, E. J. (2008) · Comptes Rendus. Mathématique · doi:10.1016/j.crma.2008.03.014 · Cited by 3,686
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
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
Trefethen, L. N., & Bau, III (1997) · doi:10.1137/1.9780898719574 · Cited by 3,301
Optimization Methods for Large-Scale Machine Learning
Bottou, L., Curtis, F. E., & Nocedal, J. (2018) · SIAM Review · doi:10.1137/16m1080173 · Cited by 3,128
Conn, A. R., Gould, N. I. M., & Toint, P. L. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719857 · Cited by 2,981
(2008) · Choice Reviews Online · doi:10.5860/choice.45-5628 · Cited by 2,725
The Geometry of Algorithms with Orthogonality Constraints
Edelman, A., Arias, T. A., & Smith, S. T. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895290954 · Cited by 2,685
A method for solving the convex programming problem with convergence rate O(1/k^2)
Nesterov, Y. E. (1983) · Доклады Академии наук · Cited by 2,662
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
Robust Stochastic Approximation Approach to Stochastic Programming
Nemirovski, A., Juditsky, A., Lan, G., & Shapiro, A. (2009) · SIAM Journal on Optimization · doi:10.1137/070704277 · Cited by 1,945
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
First-Order Methods in Optimization
Beck, A. (2017) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611974997 · Cited by 1,563
Neural networks and principal component analysis: Learning from examples without local minima
Baldi, P., & Hornik, K. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90014-2 · Cited by 1,383
Projection approximation subspace tracking
Yang, B. (1995) · IEEE Transactions on Signal Processing · doi:10.1109/78.365290 · Cited by 1,273
Generalized gradients and applications
Clarke, F. H. (1975) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1975-0367131-6 · Cited by 1,206
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
Efficient projections onto the l1-ball for learning in high dimensions
Duchi, J., Shalev-Shwartz, S., Singer, Y., & Chandra, T. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390191 · Cited by 1,184
The Rotation of Eigenvectors by a Perturbation. III
Davis, C., & Kahan, W. M. (1970) · SIAM Journal on Numerical Analysis · doi:10.1137/0707001 · Cited by 1,175
Compressed Sensing Off the Grid
Tang, G., Bhaskar, B. N., Shah, P., & Recht, B. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2277451 · Cited by 1,163
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
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
Stein, C. (1972) · Probability Theory · doi:10.1525/9780520423671-036 · Cited by 1,029
Convex Optimization: Algorithms and Complexity
Bubeck, S. (2015) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000050 · Cited by 1,001
Exact matrix completion via convex optimization
Candès, E., & Recht, B. (2012) · Communications of the ACM · doi:10.1145/2184319.2184343 · Cited by 996
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
Numerical methods for computing angles between linear subspaces
Björck, Ȧ., & Golub, G. H. (1973) · Mathematics of Computation · doi:10.1090/s0025-5718-1973-0348991-3 · Cited by 865
Identifying and attacking the saddle point problem in high-dimensional non-convex optimization
Dauphin, Y., Pascanu, R., Gulcehre, C., Cho, K., Ganguli, S., & Bengio, Y. (2014) · arXiv · doi:10.48550/arxiv.1406.2572 · Cited by 827
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
Lang, S. (1993) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0897-6 · Cited by 807
A Course in Large Sample Theory
Ferguson, T. S. (1996) · Springer eBooks · doi:10.1007/978-1-4899-4549-5 · Cited by 806
An Introduction to Matrix Concentration Inequalities
Tropp, J. A. (2015) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000048 · Cited by 792
SPECTRAL CLUSTERING AND THE HIGH-DIMENSIONAL STOCHASTIC BLOCKMODEL
Rohe, K., Chatterjee, S., & Yu, B. (2010) · Cited by 782
Cubic regularization of Newton method and its global performance
Nesterov, Y., & Polyak, B. T. (2006) · Mathematical Programming · doi:10.1007/s10107-006-0706-8 · Cited by 781
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
How to escape saddle points efficiently
Jin, C., Ge, R., Netrapalli, P., Kakade, S. M., & Jordan, M. I. (2017) · International Conference on Machine Learning · Cited by 750
A Course in Large Sample Theory
Ferguson, T. S. (2017) · Routledge eBooks · doi:10.1201/9781315136288 · Cited by 719
Li, K.-C. (1992) · Journal of the American Statistical Association · doi:10.1080/01621459.1992.10476258 · Cited by 691
Rank-Sparsity Incoherence for Matrix Decomposition
Chandrasekaran, V., Sanghavi, S., Parrilo, P. A., & Willsky, A. S. (2011) · SIAM Journal on Optimization · doi:10.1137/090761793 · Cited by 686
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
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
Normal Approximation by Stein’s Method
Chen, L. H. Y., Goldstein, L., & Shao, Q.-M. (2011) · Probability and Its Applications · doi:10.1007/978-3-642-15007-4 · Cited by 591
Recovering low-rank matrices from few coefficients in any basisPreprint
Gross, D. (2010) · Cited by 576
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
Candès, E. J., & Plan, Y. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2111771 · Cited by 569
Community Detection and Stochastic Block Models
Abbe, E. (2018) · now publishers, Inc. eBooks · doi:10.1561/9781680834772 · Cited by 544
Spectral clustering and the high-dimensional stochastic blockmodel
Rohe, K., Chatterjee, S., & Yu, B. (2011) · The Annals of Statistics · doi:10.1214/11-aos887 · Cited by 535
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
Low-Rank Matrix Completion by Riemannian Optimization
Vandereycken, B. (2013) · SIAM Journal on Optimization · doi:10.1137/110845768 · Cited by 491
Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
Chen, Y., & Candès, E. J. (2017) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21638 · Cited by 477
Self-citationTrust-Region Methods on Riemannian Manifolds
Absil, P.-A., Baker, C. G., & Gallivan, K. A. (2007) · Foundations of Computational Mathematics · doi:10.1007/s10208-005-0179-9 · Cited by 461
Perturbation bounds in connection with singular value decomposition
Wedin, P.-Å. (1972) · BIT · doi:10.1007/bf01932678 · Cited by 460
Community detection and stochastic block models: recent developmentsPreprint
Abbe, E. A. (2017) · arXiv (Cornell University) · Cited by 442
An Overview of Low-Rank Matrix Recovery From Incomplete Observations
Davenport, M. A., & Romberg, J. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2539100 · Cited by 439
Guaranteed Rank Minimization via Singular Value Projection
Jain, P., Meka, R., & Dhillon, I. S. (2010) · Cited by 420
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
Gradient Descent Only Converges to Minimizers
Lee, J. D., Simchowitz, M., Jordan, M. I., & Recht, B. (2016) · Conference on Learning Theory · Cited by 390
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
First-order methods almost always avoid strict saddle points
Lee, J. D., Panageas, I., Piliouras, G., Simchowitz, M., Jordan, M. I., & Recht, B. (2019) · Mathematical Programming · doi:10.1007/s10107-019-01374-3 · Cited by 377
Non-convex Optimization for Machine Learning
Jain, P., & Kar, P. (2017) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000058 · Cited by 364
Robust Subspace Learning: Robust PCA, Robust Subspace Tracking, and Robust Subspace Recovery
Vaswani, N., Bouwmans, T., Javed, S., & Narayanamurthy, P. (2018) · IEEE Signal Processing Magazine · doi:10.1109/msp.2018.2826566 · Cited by 356
Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow
Wang, G., Giannakis, G. B., & Eldar, Y. C. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2756858 · Cited by 330
Angular synchronization by eigenvectors and semidefinite programming
Singer, A. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.02.001 · Cited by 329
Orthogonal Procrustes Rotation for Two or More Matrices
Ten Berge, J. M. F. (1977) · Psychometrika · doi:10.1007/bf02294053 · Cited by 320
Globally Optimal Gradient Descent for a ConvNet with Gaussian InputsPreprint
Brutzkus, A., & Globerson, A. (2017) · International Conference on Machine Learning · doi:10.48550/arxiv.1702.07966 · Cited by 320
Recovery Guarantees for One-hidden-layer Neural NetworksPreprint
Zhong, K., Song, Z., Jain, P., Bartlett, P. L., & Dhillon, I. S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.03175 · Cited by 311
Guaranteed Matrix Completion via Non-Convex Factorization
Sun, R., & Luo, Z.-Q. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2598574 · Cited by 309
Spurious Local Minima are Common in Two-Layer ReLU Neural NetworksPreprint
Safran, I., & Shamir, O. (2017) · International Conference on Machine Learning · doi:10.48550/arxiv.1712.08968 · Cited by 297
Fast computation of low-rank matrix approximations
Achlioptas, D., & Mcsherry, F. (2007) · Journal of the ACM · doi:10.1145/1219092.1219097 · Cited by 292
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
Finding approximate local minima faster than gradient descent
Agarwal, N., Allen-Zhu, Z., Bullins, B., Hazan, E., & Ma, T. (2017) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3055399.3055464 · Cited by 291
Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
Hastie, T. J., Mazumder, R., Lee, J. D., & Zadeh, R. B. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.2596 · Cited by 291
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1985) · Herbert Robbins Selected Papers · doi:10.1007/978-1-4612-5110-1_9 · Cited by 284
Global rates of convergence for nonconvex optimization on manifolds
Boumal, N., Absil, P.-A., & Cartis, C. (2019) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drx080 · Cited by 271
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
Gradient Descent Can Take Exponential Time to Escape Saddle PointsPreprint
Du, S. S., Jin, C., Lee, J. D., Jordan, M. I., Póczos, B., & Singh, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.10412 · Cited by 267
Convergence Analysis of Two-layer Neural Networks with ReLU Activation
Li, Y., & Yang, Y. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.09886 · Cited by 266
Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
Oymak, S., Jalali, A., Fazel, M., Eldar, Y. C., & Hassibi, B. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2401574 · Cited by 252
Learning in linear neural networks: a survey
Baldi, P. F., & Hornik, K. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.392248 · Cited by 252
Robust Spectral Compressed Sensing via Structured Matrix CompletionPreprint
Chen, Y., & Chi, Y. (n.d.) · Cited by 247
Self-citationNon-convex Robust PCAPreprint
Netrapalli, P., Niranjan, U. N., Sanghavi, S., Anandkumar, A., & Jain, P. (2014) · CaltechAUTHORS (California Institute of Technology) · doi:10.48550/arxiv.1410.7660 · Cited by 240
Truncated Power Method for Sparse Eigenvalue Problems
Yuan, X., & Zhang, T. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1112.2679 · Cited by 238
Robust Spectral Compressed Sensing via Structured Matrix Completion
Chen, Y., & Chi, Y. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2343623 · Cited by 238
Self-citationSelf-calibration and biconvex compressive sensing
Ling, S., & Strohmer, T. (2015) · Inverse Problems · doi:10.1088/0266-5611/31/11/115002 · Cited by 229
Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
Chen, Y., Chi, Y., Fan, J., & Ma, C. (2019) · Mathematical Programming · doi:10.1007/s10107-019-01363-6 · Cited by 224
Self-citationGlobal Optimality of Local Search for Low Rank Matrix Recovery
Bhojanapalli, S., Neyshabur, B., & Srebro, N. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.07221 · Cited by 218
Sparse Signal Recovery from Quadratic Measurements via Convex Programming
Li, X., & Voroninski, V. (2013) · SIAM Journal on Mathematical Analysis · doi:10.1137/120893707 · Cited by 217
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
The landscape of empirical risk for nonconvex losses
Mei, S., Bai, Y., & Montanari, A. (2018) · The Annals of Statistics · doi:10.1214/17-aos1637 · Cited by 216
Fast Algorithms for Robust PCA via Gradient DescentPreprint
Yi, X., Park, D., Chen, Y., & Caramanis, C. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.07784 · Cited by 213
Self-citationComplete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
Sun, J., Qu, Q., & Wright, J. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2632162 · Cited by 213
How to Escape Saddle Points Efficiently
Jin, C., Ge, R., Netrapalli, P., Kakade, S. M., & Jordan, M. I. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.00887 · Cited by 205
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
Self-citationMa, C., Wang, K., Chi, Y., & Chen, Y. (2020) · Foundations of Computational Mathematics · doi:10.1007/s10208-019-09429-9 · Cited by 204
Self-citationOptimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow
Cai, T. T., Li, X., & Ma, Z. (2016) · The Annals of Statistics · doi:10.1214/16-aos1443 · Cited by 203
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
Accelerated Gradient Descent Escapes Saddle Points Faster than Gradient DescentPreprint
Jin, C., Netrapalli, P., & Jordan, M. I. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.10456 · Cited by 201
No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis
Ge, R., Jin, C., & Zheng, Y. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.00708 · Cited by 199
Rank Centrality: Ranking from Pairwise Comparisons
Negahban, S., Oh, S., & Shah, D. (2017) · Operations Research · doi:10.1287/opre.2016.1534 · Cited by 195
Li, Y., Ma, T., & Zhang, H. R. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.09203 · Cited by 195
Entrywise eigenvector analysis of random matrices with low expected rank
Abbe, E., Fan, J., Wang, K., & Zhong, Y. (2020) · The Annals of Statistics · doi:10.1214/19-aos1854 · Cited by 194
Chen, Y., Chi, Y., Fan, J., Ma, C., & Yan, Y. (2020) · SIAM Journal on Optimization · doi:10.1137/19m1290000 · Cited by 194
Self-citationNonconvex Phase Synchronization
Boumal, N. (2016) · SIAM Journal on Optimization · doi:10.1137/16m105808x · Cited by 191
Accelerated Methods for NonConvex Optimization
Carmon, Y., Duchi, J. C., Hinder, O., & Sidford, A. (2018) · SIAM Journal on Optimization · doi:10.1137/17m1114296 · Cited by 190
A Geometric Analysis of Phase Retrieval
Sun, J., Qu, Q., & Wright, J. (2018) · Foundations of Computational Mathematics · doi:10.1007/s10208-017-9365-9 · Cited by 189
Chen, Y., & Wainwright, M. J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.03025 · Cited by 187
Self-citationNon-convex Optimization for Machine Learning
Jain, P., & Kar, P. (2017) · now publishers, Inc. eBooks · doi:10.1561/9781680833690 · Cited by 185
Natasha 2: Faster Non-Convex Optimization Than SGDPreprint
Allen-Zhu, Z. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1708.08694 · Cited by 183
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
Convex Recovery of a Structured Signal from Independent Random Linear Measurements
Tropp, J. A. (2015) · Applied and numerical harmonic analysis · doi:10.1007/978-3-319-19749-4_2 · Cited by 177
Rapid, robust, and reliable blind deconvolution via nonconvex optimization
Li, X., Ling, S., Strohmer, T., & Wei, K. (2019) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2018.01.001 · Cited by 176
Global Optimality in Low-Rank Matrix Optimization
Zhu, Z., Li, Q., Tang, G., & Wakin, M. B. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2835403 · Cited by 174
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
Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decomposition
Ge, R., Huang, F., Jin, C., & Yang, Y. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.02101 · Cited by 173
Non-square matrix sensing without spurious local minima via the Burer-Monteiro approachPreprint
Park, D., Kyrillidis, A., Caramanis, C., & Sanghavi, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.03240 · Cited by 173
Incoherence-Optimal Matrix Completion
Chen, Y. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2415195 · Cited by 171
Self-citationZheng, Q., & Lafferty, J. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.07051 · Cited by 170
Implicit Regularization in Matrix Factorization
Gunasekar, S., Woodworth, B., Bhojanapalli, S., Neyshabur, B., & Srebro, N. (2018) · 2018 Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2018.8503198 · Cited by 170
Tensor SVD: Statistical and Computational Limits
Zhang, A., & Xia, D. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2841377 · Cited by 168
Low-Rank Matrix Recovery From Errors and Erasures
Chen, Y., Jalali, A., Sanghavi, S., & Caramanis, C. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2249572 · Cited by 168
Self-citationMatrix Completion has No Spurious Local Minimum
Ge, R., Lee, J. D., & Ma, T. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.07272 · Cited by 168
Spectral method and regularized MLE are both optimal for top-$K$ ranking
Chen, Y., Fan, J., Ma, C., & Wang, K. (2019) · The Annals of Statistics · doi:10.1214/18-aos1745 · Cited by 167
Self-citationA Selective Overview of Deep Learning
Fan, J., Ma, C., & Zhong, Y. (2021) · Statistical Science · doi:10.1214/20-sts783 · Cited by 166
Low-rank solutions of linear matrix equations via procrustes flow
Tu, S., Boczar, R., Simchowitz, M., Soltanolkotabi, M., & Recht, B. (2016) · Cited by 165
A selective overview of deep learningPreprint
Fan, J.-Q., Ma, C., & Zhong, Y. (2019) · Statistical Science · doi:10.48550/arxiv.1904.05526 · Cited by 162
Chen, Y., & Chi, Y. (2018) · IEEE Signal Processing Magazine · doi:10.1109/msp.2018.2821706 · Cited by 162
Self-citationCurtis, F. E., Robinson, D. P., & Samadi, M. (2016) · Mathematical Programming · doi:10.1007/s10107-016-1026-2 · Cited by 159
Sparse Phase Retrieval via Truncated Amplitude Flow
Wang, G., Zhang, L., Giannakis, G. B., Akçakaya, M., & Chen, J. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2771733 · Cited by 157
Recovering the missing components in a large noisy low-rank matrix: application to SFM
Chen, P., & Suter, D. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.52 · Cited by 154
Near-Optimal Bounds for Phase Synchronization
Zhong, Y., & Boumal, N. (2018) · SIAM Journal on Optimization · doi:10.1137/17m1122025 · Cited by 145
Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
Sun, J., Qu, Q., & Wright, J. N. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2632149 · Cited by 144
Efficient approaches for escaping higher order saddle points in non-convex optimizationPreprint
Anandkumar, A., & Ge, R. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.05908 · Cited by 137
Normalized Iterative Hard Thresholding for Matrix Completion
Tanner, J., & Wei, K. (2013) · SIAM Journal on Scientific Computing · doi:10.1137/120876459 · Cited by 137
Phase retrieval: an overview of recent developments
Jaganathan, K., Eldar, Y. C., & Hassibi, B. (2016) · CaltechAUTHORS (California Institute of Technology) · doi:10.1201/9781315371474-26 · Cited by 132
Zheng, Q., & Lafferty, J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.06081 · Cited by 130
The non-convex geometry of low-rank matrix optimization
Li, Q., Zhu, Z., & Tang, G. (2018) · Information and Inference A Journal of the IMA · doi:10.1093/imaiai/iay003 · Cited by 130
Sur, P., Chen, Y., & Candès, E. J. (2019) · Probability Theory and Related Fields · doi:10.1007/s00440-018-00896-9 · Cited by 128
Self-citationGuarantees of Riemannian Optimization for Low Rank Matrix Recovery
Wei, K., Cai, J., Chan, T. F.-C., & Leung, S. (2016) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/15m1050525 · Cited by 128
Stochastic Methods for Composite and Weakly Convex Optimization Problems
Duchi, J. C., & Ruan, F. (2018) · SIAM Journal on Optimization · doi:10.1137/17m1135086 · Cited by 127
Inference and uncertainty quantification for noisy matrix completion
Chen, Y., Fan, J., Ma, C., & Yan, Y. (2019) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1910053116 · Cited by 127
Self-citationKaroui, N. E. (2017) · Probability Theory and Related Fields · doi:10.1007/s00440-016-0754-9 · Cited by 126
Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step
Carmon, Y., & Duchi, J. C. (2019) · SIAM Journal on Optimization · doi:10.1137/17m1113898 · 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
The Power of Normalization: Faster Evasion of Saddle PointsPreprint
Levy, K. Y. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.04831 · Cited by 121
Phase Retrieval: An Overview of Recent DevelopmentsPreprint
Jaganathan, K., Eldar, Y. C., & Hassibi, B. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.07713 · Cited by 121
Finding a Sparse Vector in a Subspace: Linear Sparsity Using Alternating Directions
Qu, Q., Sun, J., & Wright, J. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2601599 · Cited by 120
Non-Convex Phase Retrieval From STFT Measurements
Bendory, T., Eldar, Y. C., & Boumal, N. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2745623 · Cited by 118
Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval
Duchi, J. C., & Ruan, F. (2018) · Information and Inference A Journal of the IMA · doi:10.1093/imaiai/iay015 · Cited by 117
Low-Rank Matrix Recovery with Composite Optimization: Good Conditioning and Rapid Convergence
Charisopoulos, V., Chen, Y., Davis, D., Díaz, M., Ding, L., & Drusvyatskiy, D. (2021) · Foundations of Computational Mathematics · doi:10.1007/s10208-020-09490-9 · Cited by 116
Self-citationExponentially many local minima for single neurons
Auer, P. L., Herbster, M., & Warmuth, M. K. (1995) · Cited by 115
ROP: Matrix recovery via rank-one projectionsPreprint
Cai, T., & Zhang, A. R. (2016) · Cited by 106
Bandeira, A. S., Boumal, N., & Voroninski, V. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.04426 · Cited by 100
Soltanolkotabi, M. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2891653 · Cited by 99
A Nonconvex Approach for Phase Retrieval: Reshaped Wirtinger Flow and Incremental Algorithms
Zhang, H., Liang, Y., & Chi, Y. (2017) · Journal of Machine Learning Research · Cited by 99
Self-citationPhase retrieval via randomized Kaczmarz: theoretical guarantees
Yan, T., & Vershynin, R. (2018) · Information and Inference A Journal of the IMA · doi:10.1093/imaiai/iay005 · Cited by 97
Fundamental Limits of Weak Recovery with Applications to Phase Retrieval
Mondelli, M., & Andrea Montanari, A. (2018) · Foundations of Computational Mathematics · doi:10.1007/s10208-018-9395-y · Cited by 97
The Landscape of the Spiked Tensor Model
Arous, G. B., Mei, S., Andrea Montanari, A., & Nica, M. (2019) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21861 · Cited by 97
The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences
Chen, Y., & Candès, E. J. (2018) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21760 · Cited by 96
Self-citationSolving systems of phaseless equations via Kaczmarz methods: a proof of concept study
Wei, K. (2015) · Inverse Problems · doi:10.1088/0266-5611/31/12/125008 · Cited by 96
Global Guarantees for Enforcing Deep Generative Priors by Empirical Risk
Hand, P., & Voroninski, V. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2935447 · Cited by 94
Spectral MLE: Top-$K$ Rank Aggregation from Pairwise ComparisonsPreprint
Chen, Y., & Suh, C. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.07218 · Cited by 92
Self-citationPhase Retrieval With Random Gaussian Sensing Vectors by Alternating Projections
Waldspurger, I. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2800663 · Cited by 92
ROP: Matrix recovery via rank-one projections
Cai, T. T., & Zhang, A. (2014) · The Annals of Statistics · doi:10.1214/14-aos1267 · Cited by 91
Dense error correction for low-rank matrices via Principal Component Pursuit
Ganesh, A., Wright, J. N., Li, X., Candès, E. J., & Ma, Y. (2010) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2010.5513538 · Cited by 87
Neon2: Finding Local Minima via First-Order OraclesPreprint
Allen-Zhu, Z., & Li, Y. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.06673 · Cited by 87
Alternating Minimization for Mixed Linear RegressionPreprint
Yi, X., Caramanis, C., & Sanghavi, S. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.3745 · Cited by 85
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
Sharp Time–Data Tradeoffs for Linear Inverse Problems
Oymak, S., Recht, B., & Soltanolkotabi, M. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2773497 · Cited by 83
First-order Stochastic Algorithms for Escaping From Saddle Points in Almost Linear TimePreprint
Xu, Y., Jin, R., & Yang, T. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.01944 · Cited by 82
The nonsmooth landscape of phase retrieval
Davis, D., Drusvyatskiy, D., & Paquette, C. (2019) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drz031 · Cited by 80
A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices
Wang, M., Xu, W., & Tang, A. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2089624 · Cited by 79
Phase transitions of spectral initialization for high-dimensional non-convex estimation
Lu, Y. M., & Li, G. (2019) · Information and Inference A Journal of the IMA · doi:10.1093/imaiai/iaz020 · Cited by 79
Self-citationLeave-One-Out Approach for Matrix Completion: Primal and Dual Analysis
Ding, L., & Chen, Y. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.2992769 · Cited by 77
Self-citationProvable Non-convex Phase Retrieval with Outliers: Median Truncated Wirtinger FlowPreprint
Zhang, H., Chi, Y., & Liang, Y. (2016) · arXiv (Cornell University) · Cited by 76
Self-citationOptimal Spectral Initialization for Signal Recovery With Applications to Phase Retrieval
Luo, W., Alghamdi, W., & Lu, Y. M. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2904918 · Cited by 76
Self-citationOn the optimization landscape of tensor decompositions
Ge, R., & Ma, T. (2020) · Mathematical Programming · doi:10.1007/s10107-020-01579-x · Cited by 75
Spectral Compressed Sensing via Projected Gradient Descent
Cai, J., Wang, T., & Wei, K. (2018) · SIAM Journal on Optimization · doi:10.1137/17m1141394 · Cited by 74
Nearly-optimal Robust Matrix CompletionPreprint
Cherapanamjeri, Y., Gupta, K., & Jain, P. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.07315 · Cited by 73
Nonconvex Rectangular Matrix Completion via Gradient Descent Without ℓ₂,∞ Regularization
Ji, C., Liu, D., & Li, X. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.2992234 · Cited by 73
Ma, J., Xu, J., & Maleki, A. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2893254 · Cited by 68
Spectral Algorithms for Tensor Completion
Andrea Montanari, A., & Sun, N. (2018) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21748 · Cited by 67
Alternating Minimizations Converge to Second-Order Optimal Solutions
Li, Q., Zhu, Z., & Tang, G. (2019) · International Conference on Machine Learning · Cited by 66
Guarantees of riemannian optimization for low rank matrix completion
Wei, K., Cai, J., Chan, T. F.-C., & Leung, S. (2020) · Inverse Problems and Imaging · doi:10.3934/ipi.2020011 · Cited by 61
Regularized gradient descent: a non-convex recipe for fast joint blind deconvolution and demixing
Ling, S., & Strohmer, T. (2017) · Information and Inference A Journal of the IMA · doi:10.1093/imaiai/iax022 · Cited by 61
Liu, H., Yue, M., & So, A. M. (2017) · SIAM Journal on Optimization · doi:10.1137/16m110109x · Cited by 58
Entrywise Eigenvector Analysis of Random Matrices with Low Expected RankPreprint
Abbe, E. A., Fan, J., Wang, K., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.09565 · Cited by 54
Nonconvex Matrix Factorization From Rank-One Measurements
Li, Y., Ma, C., Chen, Y., & Chi, Y. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3050427 · Cited by 54
Self-citationA Geometric Approach to Low-Rank Matrix Completion
Dai, W., Kerman, E., & Milenković, O. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2171521 · Cited by 54
Donoho, D. L., Gavish, M., & Andrea Montanari, A. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1306110110 · Cited by 54
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
Local Convergence of an Algorithm for Subspace Identification from Partial Data
Balzano, L., & Wright, S. J. (2014) · Foundations of Computational Mathematics · doi:10.1007/s10208-014-9227-7 · Cited by 53
Research works printed but not linked: 5
- allen-zhu, 0, Proc Neural Inf Process Syst, 3716
- qu, 0, Convolutional phase retrieval, Proc Neural Inf Process Syst, 6086
- allen-zhu, 2017, Recent advances in stochastic convex and non-convex optimization, ICML Tut
- duchi, 0, Efficient projections onto the $\ell _1$-ball for learning in high dimensions, Proc Int Conf Mach Learn, 272
- zhao, 0, Proc Adv Neural Inf Process Syst, 559
Cited by
Edge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
“, blind demixing [189], phase retrieval [254], and shallow neural networks [255].”
BackgroundExploiting Shared Representations for Personalized Federated LearningPreprint
Collins, L., Hassani, H., Mokhtari, A., & Shakkottai, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.07078 · Cited by 1,317
Optimization for deep learning: theory and algorithmsPreprint
Sun, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.08957 · Cited by 284
Ma, C., Wang, K., Chi, Y., & Chen, Y. (2020) · Foundations of Computational Mathematics · doi:10.1007/s10208-019-09429-9 · Cited by 204
Self-citationGradient descent with random initialization: fast global convergence for nonconvex phase retrieval
Chen, Y., Chi, Y., Fan, J., & Ma, C. (2019) · Mathematical Programming · doi:10.1007/s10107-019-01363-6 · Cited by 224
Self-citation
Metadata
- Authors
- Chi, Y., Lu, Y. M., & Chen, Y.
- Affiliations
- Carnegie Mellon University (US)
- Harvard University (US)
- Princeton University (US)
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2019-10-15
- Volume
- 67
- Issue
- 20
- Pages
- 5239-5269
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2969215180
- Cited by
- 360
- References
- 279
- Citations by year
- 2026: 20 · 2025: 33 · 2024: 36 · 2023: 50 · 2022: 40 · 2021: 80 · 2020: 65 · 2019: 32
- FWCI
- 37.03
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- Locations
- IEEE Transactions on Signal Processing (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Office of Naval Research (N00014-18-1-2142, N00014-19-1-2404)
- Army Research Office (W911NF-18-1-0303)
- Air Force Office of Scientific Research (FA9550-15-1-0205)
- National Science Foundation (CCF-1901199, CCF-1806154, ECCS-1818571, CCF-1718698, CCF-1910410, CCF-1907661, IIS-1900140)
- Harvard Dean's Competitive Fund for Promising Research
- AFOSR (YIP FA9550-19-1-0030)
- ARO (W911NF-18-1-0303)
- ONR (N00014-19-1-2120)
- Topics
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Keywords
- non-convex optimization, low-rank factorization, statistical models, spurious local minima, two-stage algorithm, matrix sensing, phase retrieval, matrix completion, blind deconvolution, robust principal component analysis, performance guarantees
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.