Software

Covariance estimation

The ggb is an R package for graph-guided banding of the covariance matrix. This generalizes the notion of a banded covariance matrix to situations where the variables lie on a known seed graph.

[paper] [github]

The varband is an R package for learning local dependence in ordered data (such as data collected over time or along a genome). It estimates a lower triangular matrix with a variable bandwidth, leading to an easily interpretable view of the extent of the local dependence in the data.

[paper] [github] [CRAN] [vignette]

The hierband is an R package for convex banding of the covariance matrix.

[paper] [CRAN] [vignette]

The spcov is an R package for sparse estimation of the covariance matrix.

[paper] [CRAN]

Prototype selection

The protoclust is an R package for prototype clustering (i.e., minimax linkage hierarchical clustering). It creates dendrograms that have a prototypical example associated with each interior node.

[paper] [CRAN]

The protoclass is an R package for interpretable classification with prototypes.

[pdf] [CRAN]

Interaction modeling

The hiertest is an R package for convex hierarchical testing of interactions.

[paper] [CRAN]

The hiernet is an R package for a lasso for hierarchical interactions.

[paper] [CRAN]

High-dimensional time series

The BigVAR is an R package for high-dimensional time series. It implements multiple convex-regularized approaches to estimating vector autoregressive models. This includes methods for adaptively learning the lag order and for incorporating exogenous time series.

[paper on HVAR] [paper on VARX-L] [CRAN] [github]

Inferential tools

The outference is an R package for performing valid inference that accounts for outlier removal.

[paper] [github]

Optimization-focused software

The hsm is an R package for hierarchical sparse modeling (HSM). This includes a novel closed-form solution to the proximal operator of the latent overlapping group lasso in the case of a directed path graph HSM structure and an efficient algorithm, which we call “path-based block coordinate descent” for more general HSM structures.

[paper] [CRAN]

The TREX is Matlab code for solving the TREX, a non-convex optimization problem that arises in high-dimensional statistics. Remarkably, this code globally optimizes a non-convex optimization problem in polynomial time.

[paper] [github]

The CVXfromR is an R package that lets you call CVX (from Matlab) within R. CVX is a tool by Michael Grant and Stephen Boyd that makes it easy to solve general convex problems, and the syntax to input such problems is simple and straightforward.

[website]

The convexjulia is an R package that lets you call Convex.jl (from Julia) within R. Convex.jl is a package in Julia for disciplined convex programming. Similar to CVX in MATLAB, Convex.jl makes it easy to solve general convex problems (for more details, see here).

[website]