An efficient algorithm for weak hierarchical lasso

Explore this paper's citation graph

Summary

This paper proposes to directly solve the non-convex weak hierarchical Lasso by making use of the GIST (General Iterative Shrinkage and Thresholding) optimization framework which has been shown to be efficient for solving non-convex sparse formulations.

Type
article
Published
2014-08-24
Cited by
11
References
33

Keywords

Lasso (programming language), Computer science, Algorithm, Operator (biology), Convex optimization

References

Cited by

Related papers