Randomized Matrix Decompositions Using R
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Matrix decompositions are fundamental tools in the area of applied mathematics, statistical computing, and machine learning. In particular, low-rank matrix decompositions are vital, and widely used for data analysis, dimensionality reduction, and data compression. Massive datasets, however, pose a computational challenge for traditional algorithms, placing significant constraints on both memory and processing power. Recently, the powerful concept of randomness has been introduced as a strategy to ease the computational load. The essential idea of probabilistic algorithms is to employ some amount of randomness in order to derive a smaller matrix from a high-dimensional data matrix. The smaller matrix is then used to compute the desired low-rank approximation. Such algorithms are shown to be computationally efficient for approximating matrices with low-rank structure. We present the R package rsvd, and provide a tutorial introduction to randomized matrix decompositions. Specifically, randomized routines for the singular value decomposition, (robust) principal component analysis, interpolative decomposition, and CUR decomposition are discussed. Several examples demonstrate the routines, and show the computational advantage over other methods implemented in R.
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
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Abdi, H., & Williams, L. J. (2010) · WIREs Computational Statistics · doi:10.1002/wics.101 · Cited by 11,104
Trefethen, L. N., & Bau, III (1997) · doi:10.1137/1.9780898719574 · Cited by 3,301
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929 · cited 1×
“The development and fundamentals of modern high-performance algorithms to compute the SVD are related to the seminal work of Golub and Kahan (1965) and Golub and Reinsch (1970), forming the basis for the EISPACK , and LAPACK SVD routines.”
MethodROBPCA: A New Approach to Robust Principal Component Analysis
Hubert, M., Rousseeuw, P. J., & Vanden Branden, K. (2005) · Technometrics · doi:10.1198/004017004000000563 · Cited by 1,052
Randomized algorithms for the low-rank approximation of matrices
Liberty, E., Woolfe, F., Martinsson, P.-G., Rokhlin, V., & Tygert, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0709640104 · Cited by 559
Optimal Whitening and Decorrelation
Kessy, A., Lewin, A., & Strimmer, K. (2018) · The American Statistician · doi:10.1080/00031305.2016.1277159 · Cited by 506 · cited 1×
“This process is also called sphering (Kessy, Lewin, and Strimmer 2018).”
Background
Cited by
Greenacre, M., Groenen, P. J. F., Hastie, T., D’Enza, A. I., Markos, A., & Tuzhilina, E. (2022) · Nature Reviews Methods Primers · doi:10.1038/s43586-022-00184-w · Cited by 1,773
Chu, T., Wang, Z., Pe’er, D., & Danko, C. G. (2022) · Nature Cancer · doi:10.1038/s43018-022-00356-3 · Cited by 603
Modern Koopman Theory for Dynamical Systems
Brunton, S. L., Budišić, M., Kaiser, E., & Kutz, J. N. (2022) · SIAM Review · doi:10.1137/21m1401243 · Cited by 576
Self-citationThe Human and Mouse Enteric Nervous System at Single-Cell Resolution
Drokhlyansky, E., Smillie, C. S., Van Wittenberghe, N., Ericsson, M., Griffin, G. K., Eraslan, G., Dionne, D., Cuoco, M. S., Goder-Reiser, M. N., Sharova, T., et al. (2020) · Cell · doi:10.1016/j.cell.2020.08.003 · Cited by 574
Zero-preserving imputation of single-cell RNA-seq data
Linderman, G. C., Zhao, J., Roulis, M., Bielecki, P., Flavell, R. A., Nadler, B., & Kluger, Y. (2022) · Nature Communications · doi:10.1038/s41467-021-27729-z · Cited by 275
Metadata
- Authors
- Erichson, N. B., Voronin, S., Brunton, S. L., & Kutz, J. N.
- Venue
- Journal of Statistical Software
- Publisher
- Foundation for Open Access Statistic
- Published
- 2019
- Volume
- 89
- Issue
- 11
- ISSN
- 1548-7660 (ISSN-L)
- OpenAlex
- W2488424576
- Cited by
- 105
- References
- 7
- FWCI
- 9.66
- Type
- journal article
- Language
- en
- Open access
- diamond
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Randomized Matrix Decompositions Using R. https://app.cochat.ai/papers/10.18637/jss.v089.i11
- The paper
- Erichson, N. B., Voronin, S., Brunton, S. L., & Kutz, J. N. (2019). Randomized Matrix Decompositions Using R. Journal of Statistical Software. https://doi.org/10.18637/jss.v089.i11
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.