Learn R Programming

grpreg (version 3.1-0)

grpreg-package: Regularization paths for regression models with grouped covariates

Description

This package fits regularization paths for linear, logistic, and Cox regression models with grouped penalties, such as the group lasso, group MCP, group SCAD, group exponential lasso, and group bridge. The algorithms are based on the idea of either locally approximated coordinate descent or group descent, depending on the penalty. All of the algorithms (with the exception of group bridge) are stable and fast.

Arguments

Details

The following penalties are available:

  • grLasso: Group lasso (Yuan and Lin, 2006)

  • grMCP: Group MCP; like the group lasso, but with an MCP penalty on the norm of each group

  • grSCAD: Group SCAD; like the group lasso, but with a SCAD penalty on the norm of each group

  • cMCP: A hierarchical penalty which places an outer MCP penalty on a sum of inner MCP penalties for each group (Breheny & Huang, 2009)

  • gel: Group exponential lasso (Breheny, 2015)

  • gBridge: A penalty which places a bridge penalty on the L1-norm of each group (Huang et al., 2009)

The cMCP, gel, and gBridge penalties carry out bi-level selection, meaning that they carry out variable selection at the group level and at the level of individual covariates (i.e., they select important groups as well as important members of those groups). The grLasso, grMCP, and grSCAD penalties carry out group selection, meaning that within a group, coefficients will either all be zero or all nonzero. A variety of supporting methods for selecting lambda and plotting the paths are provided also.

See the "Quick start guide" for a brief overview of how the package works, and "Penalties in grpreg" for a more detailed description of the individual penalties availabe in the package.

References

Examples

Run this code
vignette("quick-start", "grpreg")
vignette("penalties", "grpreg")

Run the code above in your browser using DataLab