Randomized algorithms for the low-rank approximation of matrices
Open accessThe DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
We describe two recently proposed randomized algorithms for the construction of low-rank approximations to matrices, and demonstrate their application ( inter alia ) to the evaluation of the singular value decompositions of numerically low-rank matrices. Being probabilistic, the schemes described here have a finite probability of failure; in most cases, this probability is rather negligible (10 −17 is a typical value). In many situations, the new procedures are considerably more efficient and reliable than the classical (deterministic) ones; they also parallelize naturally. We present several numerical examples to illustrate the performance of the schemes.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The text we found for this paper looks like another document, so the self-check wasn’t run.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Björck, Å., Dahlquist, G. G., & Anderson, N. (1974) · Cited by 1,719
Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
Gu, M., & Eisenstat, S. C. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/0917055 · Cited by 677
On the Compression of Low Rank Matrices
Cheng, H., Gimbutas, Z., Martinsson, P. G., & Rokhlin, V. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/030602678 · Cited by 301
Self-citationA fast randomized algorithm for the approximation of matrices
Woolfe, F., Liberty, E., Rokhlin, V., & Tygert, M. (2008) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2007.12.002 · Cited by 280
Self-citationA Randomized Algorithm for the Approximation of Matrices
Martinsson, P.-G., Rockhlin, V., & Tygert, M. (2006) · doi:10.21236/ada458932 · Cited by 268
Self-citationEstimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
Kuczyński, J., & Woźniakowski, H. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613066 · Cited by 251
Incomplete Cross Approximation in the Mosaic-Skeleton Method
Tyrtyshnikov, E. (2000) · Computing · doi:10.1007/s006070070031 · Cited by 249
Efficient computation of the DFT with only a subset of input or output points
Sorensen, H. V., & Burrus, C. S. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.205723 · Cited by 245
Estimating Extremal Eigenvalues and Condition Numbers of Matrices
Dixon, J. D. (1983) · SIAM Journal on Numerical Analysis · doi:10.1137/0720053 · Cited by 106
Research works printed but not linked: 1
- N Ailon B Chazelle (ACM Press New York) pp. 557–563 (2006).
Cited by
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
Halko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
Self-citationIsing formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Quantum Support Vector Machine for Big Data Classification
Rebentrost, P., Mohseni, M., & Lloyd, S. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.130503 · Cited by 1,951
Quantum principal component analysis
Lloyd, S., Mohseni, M., & Rebentrost, P. (2014) · Nature Physics · doi:10.1038/nphys3029 · Cited by 1,385
Data-Driven Science and Engineering: Machine Learning, Dynamical Systems, and Control
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690 · Cited by 1,154
Climate change impacts in Sub-Saharan Africa: from physical changes to their social repercussions
Serdeczny, O., Adams, S., Baarsch, F., Coumou, D., Robinson, A., Hare, W., Schaeffer, M., Perrette, M., & Reinhardt, J. (2017) · Regional Environmental Change · doi:10.1007/s10113-015-0910-2 · Cited by 1,037
Exact matrix completion via convex optimization
Candès, E., & Recht, B. (2012) · Communications of the ACM · doi:10.1145/2184319.2184343 · Cited by 996
Simultaneous seismic data denoising and reconstruction via multichannel singular spectrum analysis
Oropeza, V., & Sacchi, M. (2011) · Geophysics · doi:10.1190/1.3552706 · Cited by 788
A Co-training Approach for Multi-view Spectral Clustering
Kumar, A., & Daumé, H. (2011) · International Conference on Machine Learning · Cited by 933
Fast Direct Methods for Gaussian Processes
Ambikasaran, S., Foreman-Mackey, D., Greengard, L., Hogg, D. W., & O'Neil, M. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2448083 · Cited by 669
Endeavor of Iontronics: From Fundamentals to Applications of Ion‐Controlled Electronics
Bisri, S. Z., Shimizu, S., Nakano, M., & Iwasa, Y. (2017) · Advanced Materials · doi:10.1002/adma.201607054 · Cited by 558
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
A Randomized Algorithm for Principal Component Analysis
Rokhlin, V., Szlam, A., & Tygert, M. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/080736417 · Cited by 422
Self-citationRandomized numerical linear algebra: Foundations and algorithms
Martinsson, P.-G., & Tropp, J. A. (2020) · Acta Numerica · doi:10.1017/s0962492920000021 · Cited by 300
Self-citationSVD Compression for Magnetic Resonance Fingerprinting in the Time Domain
McGivney, D. F., Pierre, E., Ma, D., Jiang, Y., Saybasili, H., Gulani, V., & Griswold, M. A. (2014) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2014.2337321 · Cited by 314
Amestoy, P. R., Buttari, A., L'Excellent, J.-Y., & Mary, T. (2019) · ACM Transactions on Mathematical Software · doi:10.1145/3242094 · Cited by 305
An Algorithm for the Principal Component Analysis of Large Data Sets
Halko, N., Martinsson, P.-G., Shkolnisky, Y., & Tygert, M. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/100804139 · Cited by 291
Self-citationNew and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
Krahmer, F., & Ward, R. (2011) · SIAM Journal on Mathematical Analysis · doi:10.1137/100810447 · Cited by 290
Simple and deterministic matrix sketching
Liberty, E. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2487623 · Cited by 257
Self-citationData-driven science and engineering : machine learning, dynamical systems, and control
Brunton, S. L., & Kutz, J. N. (2019) · doi:10.1017/978-1-009-08951-7 · Cited by 242
Probabilistic numerics and uncertainty in computations
Hennig, P., Osborne, M. A., & Girolami, M. (2015) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2015.0142 · Cited by 139
The development of brain network hubs
Oldham, S., & Fornito, A. (2019) · Developmental Cognitive Neuroscience · doi:10.1016/j.dcn.2018.12.005 · Cited by 250
Randomized Algorithms for Matrices and Data
Mahoney, M. W. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000035 · Cited by 232
Near-Optimal Column-Based Matrix Reconstruction
Boutsidis, C., Drineas, P., & Magdon-Ismail, M. (2014) · SIAM Journal on Computing · doi:10.1137/12086755x · Cited by 169
Deep Unfolded Robust PCA With Application to Clutter Suppression in Ultrasound
Solomon, O., Cohen, R., Zhang, Y., Yang, Y., He, Q., Luo, J., van Sloun, R. J. G., & Eldar, Y. C. (2020) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2019.2941271 · Cited by 215
Climate change impacts in Latin America and the Caribbean and their implications for development
Reyer, C. P. O., Adams, S., Albrecht, T., Baarsch, F., Boit, A., Canales Trujillo, N., Cartsburg, M., Coumou, D., Eden, A., Fernandes, E., et al. (2017) · Regional Environmental Change · doi:10.1007/s10113-015-0854-6 · Cited by 198
Subspace Iteration Randomization and Singular Value Problems
Gu, M. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/130938700 · Cited by 209
Literature survey on low rank approximation of matrices
Kishore Kumar, N., & Schneider, J. (2017) · Linear and Multilinear Algebra · doi:10.1080/03081087.2016.1267104 · Cited by 195
A Fast Direct Solver for Structured Linear Systems by Recursive Skeletonization
Ho, K. L., & Greengard, L. (2012) · SIAM Journal on Scientific Computing · doi:10.1137/120866683 · Cited by 197
Ambikasaran, S., & Darve, E. (2013) · Journal of Scientific Computing · doi:10.1007/s10915-013-9714-z · Cited by 195
Randomized algorithms for matrices and dataPreprint
Mahoney, M. W. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1104.5557 · Cited by 260
Sweeping preconditioner for the Helmholtz equation: Hierarchical matrix representation
Engquist, B., & Ying, L. (2011) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20358 · Cited by 191
A fast randomized algorithm for overdetermined linear least-squares regression
Rokhlin, V., & Tygert, M. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0804869105 · Cited by 183
Self-citationGao, J., Sacchi, M. D., & Chen, X. (2013) · Geophysics · doi:10.1190/geo2012-0038.1 · Cited by 174
Eating up the world’s food web and the human trophic level
Bonhommeau, S., Dubroca, L., Le Pape, O., Barde, J., Kaplan, D. M., Chassot, E., & Nieblas, A.-E. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1305827110 · Cited by 169
Randomized Matrix Decompositions Using R
Erichson, N. B., Voronin, S., Brunton, S. L., & Kutz, J. N. (2019) · Journal of Statistical Software · doi:10.18637/jss.v089.i11 · Cited by 105
Frequent Directions: Simple and Deterministic Matrix Sketching
Ghashami, M., Liberty, E., Phillips, J. M., & Woodruff, D. P. (2016) · SIAM Journal on Computing · doi:10.1137/15m1009718 · Cited by 164
Self-citationDimension-independent likelihood-informed MCMC
Cui, T., Law, K. J. H., & Marzouk, Y. M. (2016) · Journal of Computational Physics · doi:10.1016/j.jcp.2015.10.008 · Cited by 173
Spectral methods in machine learning and new strategies for very large datasets
Belabbas, M.-A., & Wolfe, P. J. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0810600105 · Cited by 158
Isaac, T., Petra, N., Stadler, G., & Ghattas, O. N. (2015) · Journal of Computational Physics · doi:10.1016/j.jcp.2015.04.047 · Cited by 155
Likelihood-informed dimension reduction for nonlinear inverse problems
Cui, T., Martin, J., Marzouk, Y., Solonen, A., & Spantini, A. (2014) · Inverse Problems · doi:10.1088/0266-5611/30/11/114015 · Cited by 217
A Framework for Evaluating Approximation Methods for Gaussian Process RegressionPreprint
Chalupka, K., Williams, C. K. I., & Murray, I. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.6326 · Cited by 140
A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
Martinsson, P. (2011) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/100786617 · Cited by 134
Self-citationNon-Adversarial Unsupervised Word Translation
Hoshen, Y., & Wolf, L. (2018) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d18-1043 · Cited by 159
Leng, C., Wu, J., Cheng, J., Bai, X. P., & Lu, H. (2015) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2015.7298865 · Cited by 141
Liu, F., Luehr, N., Kulik, H. J., & Martínez, T. J. (2015) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5b00370 · Cited by 132
Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform
Boutsidis, C., & Gittens, A. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/120874540 · Cited by 122
Zhu, H., Li, S., Fomel, S. B., Stadler, G., & Ghattas, O. N. (2016) · Geophysics · doi:10.1190/geo2015-0641.1 · Cited by 121
Compressed Representation of Kohn–Sham Orbitals via Selected Columns of the Density Matrix
Damle, A., Lin, L., & Ying, L. (2015) · Journal of Chemical Theory and Computation · doi:10.1021/ct500985f · Cited by 151
Lu, J., & Lexing Ying, B. (2015) · Journal of Computational Physics · doi:10.1016/j.jcp.2015.09.014 · Cited by 112
An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
Li, S., Rouet, F.-H., Liu, J., Huang, C., Gao, X., & Chi, X. (2018) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2018.05.051 · Cited by 106
Greedy Sensor Placement With Cost Constraints
Clark, E., Askham, T., Brunton, S. L., & Kutz, J. N. (2018) · IEEE Sensors Journal · doi:10.1109/jsen.2018.2887044 · Cited by 126
Guo, H., Liu, Y., Hu, J., & Michielssen, E. (2017) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2017.2727511 · Cited by 104
Neural Networks and Deep Learning
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.007 · Cited by 111
Chertok, M., & Keller, Y. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.51 · Cited by 107
Randomized QR with Column Pivoting
Duersch, J. A., & Gu, M. (2017) · SIAM Journal on Scientific Computing · doi:10.1137/15m1044680 · Cited by 112
A fast direct solver for elliptic problems on general meshes in 2D
Schmitz, P. G., & Lexing Ying, B. (2011) · Journal of Computational Physics · doi:10.1016/j.jcp.2011.10.013 · Cited by 98
Kaptanoglu, A. A., Morgan, K., Hansen, C. J., & Brunton, S. L. (2021) · Physical review. E · doi:10.1103/physreve.104.015206 · Cited by 131
A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
Xia, J., Xi, Y., & Gu, M. (2012) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/110831982 · Cited by 97
Fast construction of hierarchical matrix representation from matrix–vector multiplication
Lin, L., Lu, J., & Lexing Ying, B. (2011) · Journal of Computational Physics · doi:10.1016/j.jcp.2011.02.033 · Cited by 96
Efficient matrix completion for seismic data reconstruction
Kumar, R., Silva, C. D., Akalin, O., Aravkin, A. Y., Mansour, H., Recht, B., & Herrmann, F. J. (2015) · Geophysics · doi:10.1190/geo2014-0369.1 · Cited by 93
An O(N) direct solver for integral equations on the plane
Corona, E., Martinsson, P., & Zorin, D. (2014) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2014.04.002 · Cited by 92
Self-citationA fast directional algorithm for high frequency acoustic scattering in two dimensions
Engquist, B., & Lexing Ying, B. (2009) · Communications in Mathematical Sciences · doi:10.4310/cms.2009.v7.n2.a3 · Cited by 92
Hu, W., Lin, L., & Yang, C. (2017) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.7b00807 · Cited by 89
Data-driven resolvent analysis
Herrmann, B., Baddoo, P. J., Semaan, R., Brunton, S. L., & McKeon, B. (2021) · Journal of Fluid Mechanics · doi:10.1017/jfm.2021.337 · Cited by 107
Randomized methods for matrix computations
Martinsson, P. (2018) · IAS/Park City mathematics series · doi:10.1090/pcms/025/04 · Cited by 87
Self-citationA randomized tensor singular value decomposition based on the t‐product
Zhang, J., Saibaba, A. K., Kilmer, M. E., & Aeron, S. (2018) · Numerical Linear Algebra with Applications · doi:10.1002/nla.2179 · Cited by 96
Chiron, L., van Agthoven, M. A., Kieffer, B., Rolando, C. H., & Delsuc, M. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1306700111 · Cited by 84
Randomized Sparse Direct Solvers
Xia, J. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/12087116x · Cited by 81
Hierarchical Interpolative Factorization for Elliptic Operators: Integral Equations
Ho, K. L., & Lexing Ying, B. (2015) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21577 · Cited by 78
High Dimensional Low Rank Plus Sparse Matrix Decomposition
Rahmani, M., & Atia, G. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2649482 · Cited by 82
Pan, X., Wei, J., Peng, Z., & Sheng, X. (2011) · Radio Science · doi:10.1029/2011rs004891 · Cited by 75
Extreme-scale UQ for Bayesian inverse problems governed by PDEs
Bui–Thanh, T., Burstedde, C., Ghattas, O. N., Martin, J. L., Stadler, G., & Wilcox, L. C. (2012) · Cited by 75
Multidimensional de-aliased Cadzow reconstruction of seismic records
Naghizadeh, M., & Sacchi, M. D. (2012) · Geophysics · doi:10.1190/geo2012-0200.1 · Cited by 73
Efficient algorithms for cur and interpolative matrix decompositions
Voronin, S., & Martinsson, P. (2016) · Advances in Computational Mathematics · doi:10.1007/s10444-016-9494-8 · Cited by 73
Self-citationSuperfast and Stable Structured Solvers for Toeplitz Least Squares via Randomized Sampling
Xi, Y., Xia, J., Cauley, S., & Balakrishnan, V. (2014) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/120895755 · Cited by 76
Adaptive Cost-Sensitive Online Classification
Zhao, P., Zhang, Y., Wu, M., Hoi, S. C. H., Tan, M., & Huang, J. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2826011 · Cited by 72
Fast Algorithms for Approximating the Singular Value Decomposition
Menon, A. K., & Elkan, C. (2011) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1921632.1921639 · Cited by 72
Finding Linear Structure in Large Datasets with Scalable Canonical Correlation AnalysisPreprint
Ma, Z., Lu, Y., & Foster, D. P. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.08170 · Cited by 72
Randomized CP tensor decomposition
Erichson, N. B., Manohar, K., Brunton, S. L., & Kutz, J. N. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ab8240 · Cited by 85
Ailon, N., & Chazelle, B. (2010) · Communications of the ACM · doi:10.1145/1646353.1646379 · Cited by 81
Martin, C. D. M., & Porter, M. A. (2012) · American Mathematical Monthly · doi:10.4169/amer.math.monthly.119.10.838 · Cited by 74
Fast dual-domain reduced-rank algorithm for 3D deblending via randomized QR decomposition
Cheng, J., & Sacchi, M. D. (2016) · Geophysics · doi:10.1190/geo2015-0292.1 · Cited by 67
Li, Y., Yang, H., Martin, E., Ho, K. L., & Lexing Ying, B. (2015) · Multiscale Modeling and Simulation · doi:10.1137/15m1007173 · Cited by 65
Discrete Lehmann representation of imaginary time Green's functions
Kaye, J., Chen, K., & Parcollet, O. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.235115 · Cited by 62
Randomized matrix-free trace and log-determinant estimators
Saibaba, A. K., Alexanderian, A., & Ipsen, I. C. F. (2017) · Numerische Mathematik · doi:10.1007/s00211-017-0880-z · Cited by 69
Image Recovery via Transform Learning and Low-Rank Modeling: The Power of Complementary Regularizers
Wen, B., Li, Y., & Bresler, Y. (2020) · IEEE Transactions on Image Processing · doi:10.1109/tip.2020.2980753 · Cited by 73
Saibaba, A. K., Lee, J. H., & Kitanidis, P. K. (2015) · Numerical Linear Algebra with Applications · doi:10.1002/nla.2026 · Cited by 68
Regularization with randomized SVD for large-scale discrete inverse problems
Xiang, H., & Zou, J. (2013) · Inverse Problems · doi:10.1088/0266-5611/29/8/085008 · Cited by 62
Extreme-scale UQ for Bayesian inverse problems governed by PDEs
Bui–Thanh, T., Burstedde, C., Ghattas, O. N., Martin, J. L., Stadler, G., & Wilcox, L. C. (2012) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc.2012.56 · Cited by 57
Randomized Quaternion Singular Value Decomposition for Low-Rank Matrix Approximation
Liu, Q., Ling, S., & Jia, Z. (2022) · SIAM Journal on Scientific Computing · doi:10.1137/21m1418319 · Cited by 56
Source separation for simultaneous towed-streamer marine acquisition — A compressed sensing approach
Kumar, R., Wason, H., & Herrmann, F. J. (2015) · Geophysics · doi:10.1190/geo2015-0108.1 · Cited by 56
Pre-conditioned BFGS-based uncertainty quantification in elastic full-waveform inversion
Liu, Q.-C., Beller, S., Lei, W., Peter, D., & Tromp, J. (2020) · Geophysical Journal International · doi:10.1093/gji/ggab375 · Cited by 39
Sublinear Randomized Algorithms for Skeleton Decompositions
Chiu, J., & Laurent Demanet, A. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/110852310 · Cited by 53
Chaillat, S., Desiderio, L., & Ciarlet, P. (2017) · Journal of Computational Physics · doi:10.1016/j.jcp.2017.09.013 · Cited by 53
Near Optimal Column-Based Matrix Reconstruction
Boutsidis, C., Petros Drineas, B., & Magdon‐Ismail, M. (2011) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.21 · Cited by 52
Cui, T., Marzouk, Y., & Willcox, K. E. (2016) · Journal of Computational Physics · doi:10.1016/j.jcp.2016.03.055 · Cited by 59
Householder QR Factorization With Randomization for Column Pivoting (HQRRP)
Martinsson, P., Quintana‐Ortí, G., Heavner, N., & Geijn, R. A. (2017) · SIAM Journal on Scientific Computing · doi:10.1137/16m1081270 · Cited by 61
Self-citationFast, robust and non-convex subspace recovery
Lerman, G., & Maunu, T. (2017) · Information and Inference A Journal of the IMA · doi:10.1093/imaiai/iax012 · Cited by 81
Metadata
- Authors
- Liberty, E., Woolfe, F., Martinsson, P.-G., Rokhlin, V., & Tygert, M.
- Affiliations
- Yale University (US)
- University of Colorado Boulder (US)
- Department of Computer Science and
- Venue
- Proceedings of the National Academy of Sciences
- Publisher
- National Academy of Sciences
- Published
- 2007-12-18
- Volume
- 104
- Issue
- 51
- Pages
- 20167-20172
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- PMC
- PMC2154402
- OpenAlex
- W1968691112
- Cited by
- 559
- References
- 14
- Citations by year
- 2026: 25 · 2025: 22 · 2024: 21 · 2023: 29 · 2022: 26 · 2021: 35 · 2020: 44 · 2019: 56 · 2018: 37 · 2017: 41 · 2016: 44 · 2015: 41 · 2014: 33 · 2013: 27 · 2012: 27
- FWCI
- 8.96
- Type
- journal article
- Language
- en
- Open access
- green
- www.ncbi.nlm.nih.gov
- Locations
- Proceedings of the National Academy of Sciences (publishedVersion)
- PubMed Central (publishedVersion)
- PubMed (publishedVersion)
- ePubWU Institutional Repository (Wirtschaftsuniversität Wien) (submittedVersion)
- WU Research (submittedVersion, other-oa)
- Funders
- Japan Society for the Promotion of Science (26820298, 25000003, 16H00923)
- National Institute of Environmental Health Sciences (27302C0031)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Physical Sciences › Mathematics › Applied Mathematics › Statistical and numerical algorithms
- Keywords
- low-rank approximation, randomized algorithms, singular value decomposition, parallel algorithms, matrix approximation
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.