gglasso (Q26262)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Group Lasso Penalized Learning Using a Unified BMD Algorithm
Language Label Description Also known as
default for all languages
No label defined
    English
    gglasso
    Group Lasso Penalized Learning Using a Unified BMD Algorithm

      Statements

      0 references
      1.5
      18 March 2020
      0 references
      PACKAGES.rds
      9 July 2026
      0 references
      1.0
      30 April 2012
      0 references
      1.1
      24 February 2013
      0 references
      1.2
      1 June 2014
      0 references
      1.3
      17 August 2014
      0 references
      1.4
      15 September 2017
      0 references
      1.5.1
      24 March 2024
      0 references
      1.6
      8 May 2025
      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
      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
      8 May 2025
      0 references
      A unified algorithm, blockwise-majorization-descent (BMD), for efficiently computing the solution paths of the group-lasso penalized least squares, logistic regression, Huberized SVM and squared SVM. The package is an implementation of Yang, Y. and Zou, H. (2015) <doi:10.1007/s11222-014-9498-5>.
      0 references

      Identifiers

      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
      0 references