Implements the SparseStep model for solving regression
    problems with a sparsity constraint on the parameters. The SparseStep
    regression model was proposed in Van den Burg, Groenen, and Alfons (2017)
    <arXiv:1701.06967>. In the model, a regularization term is added to the
    regression problem which approximates the counting norm of the parameters.
    By iteratively improving the approximation a sparse solution to the
    regression problem can be obtained.  In this package both the standard
    SparseStep algorithm is implemented as well as a path algorithm which uses
    golden section search to determine solutions with different values for the
    regularization parameter.

Functions for fitting, forecasting, and early detection of outbreaks in
    sparse surveillance count time series. Supports negative binomial (NB),
    self-exciting NB, generalise autoregressive moving average (GARMA) NB , zero-inflated NB (ZINB), self-exciting ZINB, generalise autoregressive moving average ZINB, and hurdle formulations. Climatic and environmental covariates
    can be included in the regression component and/or the zero-modified components.
    Includes outbreak-detection algorithms for NB, ZINB, and hurdle models, with
    utilities for prediction and diagnostics.

Wrapper around the 'SVDLIBC' library for (truncated) singular value decomposition of a sparse matrix.
             Currently, only sparse real matrices in Matrix package format are supported.

Offers a fast algorithm for fitting solution paths of sparse SVM models with lasso or elastic-net regularization. Reference: Congrui Yi and Jian Huang (2017) <doi:10.1080/10618600.2016.1256816>.

Computes sparse vector autoregressive coefficients and sparse
  precision matrices for time series chain graphical models. Methods are
  described in Abegaz and Wit (2013)
  <doi:10.1093/biostatistics/kxt005>.

Implements variational Bayesian algorithms to perform scalable variable selection for sparse, high-dimensional linear and logistic regression models. Features include a novel prioritized updating scheme, which uses a preliminary estimator of the variational means during initialization to generate an updating order prioritizing large, more relevant, coefficients. Sparsity is induced via spike-and-slab priors with either Laplace or Gaussian slabs. By default, the heavier-tailed Laplace density is used. Formal derivations of the algorithms and asymptotic consistency results may be found in Kolyan Ray and Botond Szabo (JASA 2020) and Kolyan Ray, Botond Szabo, and Gabriel Clara (NeurIPS 2020).