The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Low-Rank Matrix Completion by Riemannian Optimization
Open accessAbstract
The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over the Riemannian manifold of fixed-rank matrices. The algorithm is an adaptation of classical nonlinear conjugate gradients, developed within the framework of retraction-based optimization on manifolds. We describe all the necessary objects from differential geometry necessary to perform optimization over this low-rank matrix manifold, seen as a submanifold embedded in the space of matrices. In particular, we describe how metric projection can be used as retraction and how vector transport lets us obtain the conjugate search directions. Finally, we prove convergence of a regularized version of our algorithm under the assumption that the restricted isometry property holds for incoherent matrices throughout the iterations. The numerical experiments indicate that our approach scales very well for large-scale problems and compares favorably with the state-of-the-art, while outperforming most existing solvers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
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
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
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
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
Introduction to Smooth Manifolds
Lee, J. M. (2012) · Graduate Texts in Mathematics · doi:10.1007/978-1-4419-9982-5 · Cited by 2,296
Kuybeda, O., Frank, G. A., Bartesaghi, A., Borgnia, M., Subramaniam, S., & Sapiro, G. (2013) · Journal of Structural Biology · doi:10.1016/j.jsb.2012.10.010 · Cited by 2,162
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
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
Candes, E. J., & Plan, Y. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2035722 · Cited by 1,709
The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
Golub, G. H., & Pereyra, V. (1973) · SIAM Journal on Numerical Analysis · doi:10.1137/0710036 · Cited by 1,430
Bennett, J. R., & Lanning, S. (2007) · Cited by 1,134
Fixed point and Bregman iterative methods for matrix rank minimization
Ma, S., Goldfarb, D., & Chen, L. (2011) · Mathematical Programming · doi:10.1007/s10107-009-0306-5 · Cited by 1,048
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
Toh, K.-C., & Yun, S. (2009) · National University of Singapore · Cited by 923
Wen, Z., Yin, W., & Zhang, Y. (2012) · Mathematical Programming Computation · doi:10.1007/s12532-012-0044-1 · Cited by 774
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
GOLUBf, G. H., & Pereyra, V. L. (1973) · Cited by 732
Optimization and Dynamical Systems
Helmke, U., & Moore, J. B. (1994) · Communications and Control Engineering · doi:10.1007/978-1-4471-3467-1 · Cited by 724
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
Trust-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
Guaranteed Rank Minimization via Singular Value Projection
Jain, P., Meka, R., & Dhillon, I. S. (2010) · Cited by 420
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
Online identification and tracking of subspaces from highly incomplete information
Balzano, L., Nowak, R., & Recht, B. (2010) · 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2010.5706976 · Cited by 331
Dynamical Low‐Rank Approximation
Koch, O., & Lubich, C. (2007) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/050639703 · Cited by 301
Projection-like Retractions on Matrix Manifolds
Absil, P.-A., & Malick, J. (2012) · SIAM Journal on Optimization · doi:10.1137/100802529 · Cited by 296
Newton's method on Riemannian manifolds and a geometric model for the human spine
Adler, R. L. (2002) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/22.3.359 · 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
Optimization techniques on Riemannian manifolds
Smith, S. (1995) · Hamiltonian and Gradient Flows, Algorithms and Control · doi:10.1090/fic/003/09 · Cited by 258
Alternating Projections on Manifolds
Lewis, A. S., & Malick, J. (2008) · Mathematics of Operations Research · doi:10.1287/moor.1070.0291 · Cited by 221
Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
Journée, M., Bach, F., Absil, P.-A., & Sepulchre, R. (2010) · SIAM Journal on Optimization · doi:10.1137/080731359 · Cited by 209
On the low-rank approximation by the pivoted Cholesky decomposition
Harbrecht, H., Peters, M., & Schneider, R. (2011) · Applied Numerical Mathematics · doi:10.1016/j.apnum.2011.10.001 · Cited by 202
A Newton-like method for solving rank constrained linear matrix inequalities
Orsi, R., Helmke, U., & Moore, J. B. (2006) · Automatica · doi:10.1016/j.automatica.2006.05.026 · Cited by 194
Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization
Goldfarb, D., & Ma, S. (2011) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9084-6 · Cited by 144
RTRMC: A Riemannian trust-region method for low-rank matrix completion
Boumal, N., & Absil, P.-A. (2011) · Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) · Cited by 143
Differentiability of a Function and of its Compositions with Functions of One Variable.
Boman, J. (1967) · MATHEMATICA SCANDINAVICA · doi:10.7146/math.scand.a-10835 · Cited by 142
Fixed-rank matrix factorizations and Riemannian low-rank optimization
Mishra, B., Meyer, G., Bonnabel, S., & Sepulchre, R. (2012) · Computational statistics (Zeitschrift) · doi:10.1007/s00180-013-0464-z · Cited by 142
An implementable proximal point algorithmic framework for nuclear norm minimization
Liu, Y.-J., Sun, D., & Toh, K.-C. (2011) · Mathematical Programming · doi:10.1007/s10107-010-0437-8 · Cited by 115
A Riemannian Optimization Approach for Computing Low-Rank Solutions of Lyapunov Equations
Vandereycken, B., & Vandewalle, S. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090764566 · Cited by 108
Self-citationLow-Rank Optimization with Trace Norm Penalty
Mishra, B., Meyer, G., Bach, F., & Sepulchre, R. J. (2013) · SIAM Journal on Optimization · doi:10.1137/110859646 · Cited by 107
Fast singular value thresholding without singular value decomposition
Cai, J., & Osher, S. (2013) · Methods and Applications of Analysis · doi:10.4310/maa.2013.v20.n4.a2 · Cited by 64
Regression on fixed-rank positive semidefinite matrices: a Riemannian approachPreprint
Meyer, G., Bonnabel, S., & Sepulchre, R. J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1006.1288 · Cited by 61
Online learning in the embedded manifold of low-rank matrices
Shalit, U., Weinshall, D., & Chechik, G. (2012) · doi:10.5555/2188385.2188399 · Cited by 53
Linear Regression under Fixed-Rank Constraints: A Riemannian Approach
Meyer, G., Bonnabel, S., & Sepulchre, R. J. (2011) · ORBi (University of Liège) · Cited by 50
Riemannian BFGS Algorithm with Applications
Qi, C., Gallivan, K. A., & Absil, P.-A. (2010) · Springer eBooks · doi:10.1007/978-3-642-12598-0_16 · Cited by 44
Online Learning in The Manifold of Low-Rank Matrices
Shalit, U., Weinshall, D., & Chechik, G. (2010) · Cited by 35
Iterative methods for low rank approximation of graph similarity matrices
Cason, T., Absil, P.-A., & Dooren, P. M. V. (2012) · Linear Algebra and its Applications · doi:10.1016/j.laa.2011.12.004 · Cited by 19
Geometric optimization algorithms for linear regression on fixed-rank matrices
Meyer, G. (2011) · ORBi (University of Liège) · Cited by 17
Cited by
Manopt, a Matlab toolbox for optimization on manifolds
Boumal, N., Mishra, B., Absil, P.-A., & Sepulchre, R. J. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1308.5200 · Cited by 737
A literature survey of low‐rank tensor approximation techniques
Grasedyck, L., Kressner, D., & Tobler, C. (2013) · GAMM-Mitteilungen · doi:10.1002/gamm.201310004 · Cited by 577
Calibrationless parallel imaging reconstruction based on structured low-rank matrix completion
Shin, P. J., Larson, P. E. Z., Ohliger, M. A., Elad, M., Pauly, J. M., Vigneron, D. B., & Lustig, M. (2014) · Magnetic Resonance in Medicine · doi:10.1002/mrm.24997 · Cited by 391
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
Low-rank tensor completion by Riemannian optimization
Kressner, D., Steinlechner, M., & Vandereycken, B. (2014) · BIT Numerical Mathematics · doi:10.1007/s10543-013-0455-z · Cited by 290
Self-citation
Metadata
- Authors
- Vandereycken, B.
- Venue
- SIAM Journal on Optimization
- Published
- 2013-01
- Volume
- 23
- Issue
- 2
- Pages
- 1214-1236
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2058078260
- Cited by
- 491
- References
- 51
- FWCI
- 32.41
- 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.