sparsenet (Q30963): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: source code repository (P339): https://github.com/cran/sparsenet, #quickstatements; #temporary_batch_1711027662947 |
||
| Property / source code repository | |||
| Property / source code repository: https://github.com/cran/sparsenet / rank | |||
Normal rank | |||
Revision as of 15:13, 21 March 2024
Fit Sparse Linear Regression Models via Nonconvex Optimization
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | sparsenet |
Fit Sparse Linear Regression Models via Nonconvex Optimization |
Statements
5 February 2024
0 references
Efficient procedure for fitting regularization paths between L1 and L0, using the MC+ penalty of Zhang, C.H. (2010)<doi:10.1214/09-AOS729>. Implements the methodology described in Mazumder, Friedman and Hastie (2011) <doi:10.1198/jasa.2011.tm09738>. Sparsenet computes the regularization surface over both the family parameter and the tuning parameter by coordinate descent.
0 references
