################################################################################
# parallel implementation
svds4.par2 <- function(X.desc, fun.scaling, ind.row, ind.col,
k, tol, verbose, ncores, TIME) {
n <- length(ind.row)
m <- length(ind.col)
intervals <- CutBySize(m, nb = ncores)
Ax.desc <- tmpFBM(n, ncores)
Atx.desc <- tmpFBM(m, 1)
calc.desc <- tmpFBM(ncores, 1, init = 0)
if (verbose) {
cl <- parallel::makeCluster(1 + ncores, outfile = "")
} else {
cl <- parallel::makeCluster(1 + ncores)
}
doParallel::registerDoParallel(cl)
on.exit(parallel::stopCluster(cl), add = TRUE)
res <- foreach(ic = 0:ncores) %dopar% {
if (ic == 0) { # I'm the master
Ax <- attach.big.matrix(Ax.desc)
Atx <- attach.big.matrix(Atx.desc)
calc <- attach.big.matrix(calc.desc)
printf <- function(...) cat(sprintf(...))
it <- 0
# A
A <- function(x, args) {
printf("%d - computing A * x\n", it <<- it + 1)
Atx[] <- x
calc[] <- 1 # make them work
# master wait for its slaves to finish working
while (sum(calc[,]) > 0) Sys.sleep(TIME)
rowSums(Ax[,])
}
# Atrans
Atrans <- function(x, args) {
printf("%d - computing At * x\n", it <<- it + 1)
Ax[, 1] <- x
calc[] <- 2 # make them work
# master wait for its slaves to finish working
while (sum(calc[,]) > 0) Sys.sleep(TIME)
Atx[,]
}
res <- RSpectra::svds(A, k, nu = k, nv = k, opts = list(tol = tol),
Atrans = Atrans, dim = c(n, m))
calc[] <- 3 # end
res
} else { # You're my slaves
# get their part
lo <- intervals[ic, "lower"]
up <- intervals[ic, "upper"]
ind.col.part <- ind.col[lo:up]
X <- attach.BM(X.desc)
Ax <- attach.big.matrix(Ax.desc)
Atx.part <- sub.big.matrix(Atx.desc, firstRow = lo, lastRow = up)
calc <- attach.big.matrix(calc.desc)
# scaling
ms <- fun.scaling(X, ind.row = ind.row, ind.col = ind.col.part)
slaves_randomSVD(X,
xpAx = Ax@address,
xpAtx_part = Atx.part@address,
xpcalc = calc@address,
rowInd = ind.row,
colInd = ind.col.part,
MEAN = ms$mean,
SD = ms$sd,
ic = ic,
TIME = TIME)
ms
}
}
# separate the results and combine the scaling vectors
l <- do.call('c', res[-1])
res <- res[[1]]
s <- c(TRUE, FALSE)
res$means <- unlist(l[s], use.names = FALSE)
res$sds <- unlist(l[!s], use.names = FALSE)
# remove temporary files
unlink2 <- function(desc) {
desc <- desc@description
file.root <- file.path(desc$dirname, desc$filename)
unlink(paste0(file.root, c("", ".desc")))
}
sapply(c(Ax.desc, Atx.desc, calc.desc), unlink2)
# return
res
}
################################################################################
# single core implementation
svds4.seq2 <- function(X., fun.scaling, ind.row, ind.col, k, tol, verbose) {
n <- length(ind.row)
m <- length(ind.col)
X <- attach.BM(X.)
# scaling
ms <- fun.scaling(X, ind.row, ind.col)
printf <- function(...) if (verbose) cat(sprintf(...))
it <- 0
# A
A <- function(x, args) {
printf("%d - computing A * x\n", it <<- it + 1)
x <- x / ms$sd
pMatVec4(X, x, ind.row, ind.col) - crossprod(x, ms$mean)
}
# Atrans
Atrans <- function(x, args) {
printf("%d - computing At * x\n", it <<- it + 1)
(cpMatVec4(X, x, ind.row, ind.col) - sum(x) * ms$mean) / ms$sd
}
res <- RSpectra::svds(A, k, nu = k, nv = k, opts = list(tol = tol),
Atrans = Atrans, dim = c(n, m))
res$means <- ms$mean
res$sds <- ms$sd
res
}
################################################################################
#' Randomized SVD
#'
#' An algorithm for SVD (or PCA) of a `big.matrix` based on the algorithm
#' in RSpectra (by Yixuan Qiu and Jiali Mei).
#' \cr
#' This algorithm is linear in time in all dimensions and is very
#' memory-efficient. Thus, it can be used on very large big.matrices.
#'
#' @note The idea of using this Implicitly Restarted Arnoldi Method algorithm
#' comes from G. Abraham, Y. Qiu, and M. Inouye,
#' FlashPCA2: principal component analysis of biobank-scale genotype datasets,
#' bioRxiv: \url{https://doi.org/10.1101/094714}.
#' \cr
#' It proved to be faster than our implementation of the "blanczos" algorithm
#' in Rokhlin, V., Szlam, A., & Tygert, M. (2010).
#' A Randomized Algorithm for Principal Component Analysis.
#' SIAM Journal on Matrix Analysis and Applications, 31(3), 1100–1124.
#' \url{https://doi.org/10.1137/080736417}.
#'
#' @inheritParams bigstatsr-package
#' @param k Number of singular vectors/values to compute. Default is `10`.
#' __This algorithm should be used to compute only a
#' few singular vectors/values.__
#' @param tol Precision parameter of [svds][RSpectra::svds].
#' Default is `1e-4`.
#' @param verbose Should some progress be printed? Default is `FALSE`.
#'
#' @export
#' @return A named list (an S3 class "big_SVD") of
#' - `d`, the singular values,
#' - `u`, the left singular vectors,
#' - `v`, the right singular vectors,
#' - `niter`, the number of the iteration of the algorithm,
#' - `nops`, number of Matrix-Vector multiplications used,
#' - `means`, the centering vector,
#' - `sds`, the scaling vector.
#'
#' Note that to obtain the Principal Components, you must use
#' [predict][predict.big_SVD] on the result. See examples.
#'
#' @example examples/example-randomSVD.R
#' @seealso [svds][RSpectra::svds]
big_randomSVD2 <- function(X., fun.scaling,
ind.row = rows_along(X.),
ind.col = cols_along(X.),
k = 10, tol = 1e-4,
verbose = FALSE, ncores = 1,
TIME = 0.001) {
if (ncores > 1) {
res <- svds4.par2(describe(X.), fun.scaling, ind.row, ind.col,
k, tol, verbose, ncores, TIME)
} else {
res <- svds4.seq2(X., fun.scaling, ind.row, ind.col, k, tol, verbose)
}
structure(res, class = "big_SVD")
}
################################################################################
# template <class C>
# void slaves_randomSVD(C macc,
# XPtr<BigMatrix> xpAx,
# XPtr<BigMatrix> xpAtx_part,
# XPtr<BigMatrix> xpcalc,
# const NumericVector& MEAN,
# const NumericVector& SD,
# int ic,
# double TIME) {
# int n = macc.nrow();
# int m = macc.ncol();
#
# MatrixAccessor<double> Ax(*xpAx); // n * ncores
# MatrixAccessor<double> Atx_part(*xpAtx_part); // m * 1
# MatrixAccessor<double> calc(*xpcalc); // ncores * 1
#
# ic--; // indices begin at 0 in C++
#
# NumericVector x2(m), x1(n);
# double c, cross, sum_x;
# int i, j;
#
# while (true) {
# // slaves wait for their master to give them orders
# while (calc[0][ic] == 0) sleep(TIME);
# c = calc[0][ic];
# // slaves do the hard work
# if (c == 1) {
# // compute A * x
# cross = 0;
# for (j = 0; j < m; j++) {
# x2[j] = Atx_part[0][j] / SD[j];
# cross += x2[j] * MEAN[j];
# }
# x1 = pMatVec4(macc, x2);
# for (i = 0; i < n; i++) {
# Ax[ic][i] = x1[i] - cross;
# }
# } else if (c == 2) {
# // compute At * x
# sum_x = 0;
# for (i = 0; i < n; i++) {
# x1[i] = Ax[0][i];
# sum_x += x1[i];
# }
# x2 = cpMatVec4(macc, x1);
# for (j = 0; j < m; j++) {
# Atx_part[0][j] = (x2[j] - sum_x * MEAN[j]) / SD[j];
# }
# } else if (c == 3) { // end
# return;
# } else {
# throw Rcpp::exception("RandomSVD: unclear order from the master.");
# }
# calc[0][ic] = 0;
# }
# }
#
# // Dispatch function for cpMatVec4
# // [[Rcpp::export]]
# void slaves_randomSVD(const S4& BM,
# XPtr<BigMatrix> xpAx,
# XPtr<BigMatrix> xpAtx_part,
# XPtr<BigMatrix> xpcalc,
# const IntegerVector& rowInd,
# const IntegerVector& colInd,
# const NumericVector& MEAN,
# const NumericVector& SD,
# int ic,
# double TIME) {
#
# XPtr<BigMatrix> xpMat = BM.slot("address");
# IntegerVector rows = rowInd - 1;
# IntegerVector cols = colInd - 1;
#
# if (Rf_inherits(BM, "BM.code")) {
# return slaves_randomSVD(RawSubMatAcc(*xpMat, rows, cols, BM.slot("code")),
# xpAx, xpAtx_part, xpcalc, MEAN, SD, ic, TIME);
# } else {
# switch(xpMat->matrix_type()) {
# case 1:
# return slaves_randomSVD(SubMatAcc<char>(*xpMat, rows, cols),
# xpAx, xpAtx_part, xpcalc, MEAN, SD, ic, TIME);
# case 2:
# return slaves_randomSVD(SubMatAcc<short>(*xpMat, rows, cols),
# xpAx, xpAtx_part, xpcalc, MEAN, SD, ic, TIME);
# case 4:
# return slaves_randomSVD(SubMatAcc<int>(*xpMat, rows, cols),
# xpAx, xpAtx_part, xpcalc, MEAN, SD, ic, TIME);
# case 6:
# return slaves_randomSVD(SubMatAcc<float>(*xpMat, rows, cols),
# xpAx, xpAtx_part, xpcalc, MEAN, SD, ic, TIME);
# case 8:
# return slaves_randomSVD(SubMatAcc<double>(*xpMat, rows, cols),
# xpAx, xpAtx_part, xpcalc, MEAN, SD, ic, TIME);
# default:
# throw Rcpp::exception(ERROR_TYPE);
# }
# }
# }
#
# /******************************************************************************/
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.