glmnet (Q20169): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Swh import (talk | contribs)
SWHID from Software Heritage
 
(One intermediate revision by one other user not shown)
Property / source code repository
 
Property / source code repository: https://github.com/cran/glmnet / rank
 
Normal rank
Property / Software Heritage ID
 
Property / Software Heritage ID: swh:1:snp:5d24e2d1ec9e4ca4ae17aeb28781cbe163c3523c / rank
 
Normal rank
Property / Software Heritage ID: swh:1:snp:5d24e2d1ec9e4ca4ae17aeb28781cbe163c3523c / qualifier
 
Property / Software Heritage ID: swh:1:snp:5d24e2d1ec9e4ca4ae17aeb28781cbe163c3523c / qualifier
 
point in time: 1 September 2023
Timestamp+2023-09-01T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0

Latest revision as of 15:29, 21 March 2024

Lasso and Elastic-Net Regularized Generalized Linear Models
Language Label Description Also known as
English
glmnet
Lasso and Elastic-Net Regularized Generalized Linear Models

    Statements

    0 references
    4.1-7
    23 March 2023
    0 references
    1.1-1
    27 June 2008
    0 references
    1.1-2
    23 December 2008
    0 references
    1.1-3
    24 January 2009
    0 references
    1.1-4
    18 December 2009
    0 references
    1.1-5
    31 January 2010
    0 references
    1.1
    2 June 2008
    0 references
    1.2
    4 April 2010
    0 references
    1.3
    25 April 2010
    0 references
    1.4
    16 June 2010
    0 references
    1.5.1
    19 November 2010
    0 references
    1.5.2
    7 February 2011
    0 references
    1.5.3
    1 March 2011
    0 references
    1.5
    4 November 2010
    0 references
    1.6
    24 April 2011
    0 references
    1.7.1
    23 September 2011
    0 references
    1.7.3
    19 February 2012
    0 references
    1.7.4
    27 April 2012
    0 references
    1.7
    15 June 2011
    0 references
    1.8-2
    2 October 2012
    0 references
    1.8-4
    27 December 2012
    0 references
    1.8-5
    4 January 2013
    0 references
    1.8
    3 July 2012
    0 references
    1.9-1
    10 February 2013
    0 references
    1.9-3
    2 March 2013
    0 references
    1.9-5
    4 August 2013
    0 references
    1.9-8
    24 May 2014
    0 references
    2.0-1
    8 April 2015
    0 references
    2.0-2
    12 April 2015
    0 references
    2.0-3
    23 February 2016
    0 references
    2.0-4
    13 March 2016
    0 references
    2.0-5
    17 March 2016
    0 references
    2.0-8
    30 April 2017
    0 references
    2.0-9
    2 May 2017
    0 references
    2.0-10
    6 May 2017
    0 references
    2.0-12
    13 September 2017
    0 references
    2.0-13
    22 September 2017
    0 references
    2.0-16
    2 April 2018
    0 references
    2.0-18
    20 May 2019
    0 references
    3.0-1
    15 November 2019
    0 references
    3.0-2
    11 December 2019
    0 references
    3.0
    9 November 2019
    0 references
    4.0-2
    16 June 2020
    0 references
    4.0
    14 May 2020
    0 references
    4.1-1
    21 February 2021
    0 references
    4.1-2
    24 June 2021
    0 references
    4.1-3
    2 November 2021
    0 references
    4.1-4
    15 April 2022
    0 references
    4.1-6
    27 November 2022
    0 references
    4.1
    11 January 2021
    0 references
    4.1-8
    22 August 2023
    0 references
    0 references
    22 August 2023
    0 references
    Extremely efficient procedures for fitting the entire lasso or elastic-net regularization path for linear regression, logistic and multinomial regression models, Poisson regression, Cox model, multiple-response Gaussian, and the grouped multinomial regression; see <doi:10.18637/jss.v033.i01> and <doi:10.18637/jss.v039.i05>. There are two new and important additions. The family argument can be a GLM family object, which opens the door to any programmed family (<doi:10.18637/jss.v106.i01>). This comes with a modest computational cost, so when the built-in families suffice, they should be used instead. The other novelty is the relax option, which refits each of the active sets in the path unpenalized. The algorithm uses cyclical coordinate descent in a path-wise fashion, as described in the papers cited.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers