Statistical Learning on Sparse Matrices
Overview
Implements many algorithms for statistical learning on sparse matrices - matrix factorizations, matrix completion, elastic net regressions, factorization machines. Also 'rsparse' enhances 'Matrix' package by providing methods for multithreaded <sparse, dense> matrix products and native slicing of the sparse matrices in Compressed Sparse Row (CSR) format. List of the algorithms for regression problems: 1) Elastic Net regression via Follow The Proximally-Regularized Leader (FTRL) Stochastic Gradient Descent (SGD), as per McMahan et al(, doi:10.1145/2487575.2488200) 2) Factorization Machines via SGD, as per Rendle (2010, doi:10.1109/ICDM.2010.127) List of algorithms for matrix factorization and matrix completion: 1) Weighted Regularized Matrix Factorization (WRMF) via Alternating Least Squares (ALS) - paper by Hu, Koren, Volinsky (2008, doi:10.1109/ICDM.2008.22) 2) Maximum-Margin Matrix Factorization via ALS, paper by Rennie, Srebro (2005, doi:10.1145/1102351.1102441) 3) Fast Truncated Singular Value Decomposition (SVD), Soft-Thresholded SVD, Soft-Impute matrix completion via ALS - paper by Hastie, Mazumder et al. (2014, doi:10.48550/arXiv.1410.2596) 4) Linear-Flow matrix factorization, from 'Practical linear models for large-scale one-class collaborative filtering' by Sedhain, Bui, Kawale et al (2016, ISBN:978-1-57735-770-4) 5) GlobalVectors (GloVe) matrix factorization via SGD, paper by Pennington, Socher, Manning (2014, https://aclanthology.org/D14-1162/) Package is reasonably fast and memory efficient - it allows to work with large datasets - millions of rows and millions of columns. This is particularly useful for practitioners working on recommender systems.
Install
Health
NOTEdependencies in R coder-devel-linux-x86_64-fedora-clang, r-devel-linux-x86_64-fedora-gcc
Namespace in Imports field not imported from: ‘MatrixExtra’ All declared Imports should be used.
- NOTE11 OK, 2 NOTE2026-10-17
- ERROR10 OK, 2 NOTE, 1 ERROR2026-10-15
- NOTE10 OK, 4 NOTE2026-04-22
- ERROR9 OK, 4 NOTE, 1 ERROR2026-04-18
- NOTE10 OK, 4 NOTE2026-03-10
Documentation
- Help pages
- 13 (2 internal)
- Examples that run
- 100%8 run in a plain check
- Exported functions with examples
- 80%
- Documented parameters
- 100%
- Return-value docs
- 10%
- Help pages citing references
- 31%
Downloads
Repository
- PRs merged (all time)
- 88%
- Median days to close, 50 most recently updated closed issues
- 13
- Median days to close, 50 most recently updated closed PRs
- 2
Stars over time
Forks over time
Issues over time
PRs over time
6 development-tooling and community-health practices detected across 5 families in the upstream repository
Checks run against github.com/dselivanov/rsparse on 2026-10-22.
The R CMD check workflow runs on Linux, and on R-devel
Show all practicesHide 1 practice
Dependencies
Installing rsparse adds 8 packages (6 with compiled code, 11 MB of source tarballs). Heaviest: data.table 5.7 MB, Rcpp 1.8 MB, float 1.3 MB.
Code & Tests
Datasets
People & History
Pick two releases to compare their code metrics.
- RR 4.6.0 released · 2026-04-24
- RR 4.5.0 released · 2025-04-11
- 0.5.3Latest
- 0.5.22024-06-28 · diff ↗
- RR 4.4.0 released · 2024-04-24
- RR 4.3.0 released · 2023-04-21
- 0.5.12022-09-12 · diff ↗
- RR 4.2.0 released · 2022-04-22
- 0.5.02021-11-30 · diff ↗
- RR 4.1.0 released · 2021-05-18
- RR 4.0.0 released · 2020-04-24
- 0.4.0
- 0.3.3.42019-11-14 · diff ↗
- 0.3.3.32019-08-04 · diff ↗
- 0.3.3.22019-07-18 · diff ↗
- RR 3.6.0 released · 2019-04-26
Package metadata
- First published
- 2019-04-12
- Total releases
- 10 / 7 yrs
- License
- GPL (>= 2) OSI
- Minimum R
- ≥ 3.6.0
- Bundled data
- 98 KB / 1 file
- Download size
- 210 KB
Cite
Cite this package
Run in R for the authors' preferred citation:
citation("rsparse")This package has no citation file, so citation() returns this entry built from DESCRIPTION.
Cite the R Observatory
For a number measured here: a download total, a coverage figure, an archival date.
From data release v2026-10-23, which the citation names so these numbers can be found later. More on citing and the projects behind them.