sparsenet (Q30963)

From MaRDI portal
Revision as of 15:13, 21 March 2024 by Schubotz (talk | contribs) (‎Created claim: source code repository (P339): https://github.com/cran/sparsenet, #quickstatements; #temporary_batch_1711027662947)
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

    0 references
    1.4
    10 November 2019
    0 references
    1.0
    3 March 2012
    0 references
    1.1
    7 January 2013
    0 references
    1.2
    12 March 2014
    0 references
    1.3
    11 February 2019
    0 references
    1.5
    22 August 2023
    0 references
    1.6
    5 February 2024
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references