Implementation of the block coordinate descent procedure for solving the proximal function of latent group Lasso, highlighted by decomposing a DAG into several non-overlapping path graphs, and getting closed-form solution for each path graph. The procedure was introduced as Algorithm 4 in Yan and Bien (2017) <doi:10.1214/17-STS622> "Hierarchical Sparse Modeling: A Choice of Two Group Lasso Formulations", and the closed-form solution for each path graph is solved in Algorithm 3 of that paper.
Package details |
|
---|---|
Author | Xiaohan Yan [aut, cre], Jacob Bien [aut, cre] |
Maintainer | Xiaohan Yan <xy257@cornell.edu> |
License | GPL-3 |
Version | 0.2.0 |
URL | https://github.com/yanxht/hsm |
Package repository | View on GitHub |
Installation |
Install the latest version of this package by entering the following in R:
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.