sparvaride
Variance Identification in Sparse Factor Analysis
This is an implementation of the algorithm described in Section 3 of Hosszejni and Frühwirth-Schnatter (2026) <doi:10.1016/j.jmva.2025.105536>. The algorithm is used to verify that the counting rule CR(r,1) holds for the sparsity pattern of the transpose of a factor loading matrix. As detailed in Section 2 of the same paper, if CR(r,1) holds, then the idiosyncratic variances are generically identified. If CR(r,1) does not hold, then we do not know whether the idiosyncratic variances are identified or not.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.0.0 |
rolling linux/jammy R-4.5 | sparvaride_1.0.0.tar.gz |
48.4 KiB |
1.0.0 |
rolling linux/noble R-4.5 | sparvaride_1.0.0.tar.gz |
49.4 KiB |
1.0.0 |
rolling source/ R- | sparvaride_1.0.0.tar.gz |
15.1 KiB |
1.0.0 |
latest linux/jammy R-4.5 | sparvaride_1.0.0.tar.gz |
48.4 KiB |
1.0.0 |
latest linux/noble R-4.5 | sparvaride_1.0.0.tar.gz |
49.4 KiB |
1.0.0 |
latest source/ R- | sparvaride_1.0.0.tar.gz |
15.1 KiB |
1.0.0 |
2026-04-26 source/ R- | sparvaride_1.0.0.tar.gz |
15.1 KiB |
1.0.0 |
2026-04-23 source/ R- | sparvaride_1.0.0.tar.gz |
15.1 KiB |
1.0.0 |
2026-04-09 windows/windows R-4.5 | sparvaride_1.0.0.zip |
373.4 KiB |
0.1.0 |
2025-04-20 source/ R- | sparvaride_0.1.0.tar.gz |
13.6 KiB |