kth.sePublications KTH
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Elastic Gradient Descent, an Iterative Optimization Method Approximating the Solution Paths of the Elastic Net
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.).ORCID iD: 0000-0002-5926-0830
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.).
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.).
2023 (English)In: Journal of machine learning research, ISSN 1532-4435, E-ISSN 1533-7928, Vol. 24, no 277, p. 1-53Article in journal (Refereed) Published
Abstract [en]

The elastic net combines lasso and ridge regression to fuse the sparsity property of lasso with the grouping property of ridge regression. The connections between ridge regression and gradient descent and between lasso and forward stagewise regression have previously been shown. Similar to how the elastic net generalizes lasso and ridge regression, we introduce elastic gradient descent, a generalization of gradient descent and forward stagewise regression. We theoretically analyze elastic gradient descent and compare it to the elastic net and forward stagewise regression. Parts of the analysis are based on elastic gradient flow, a piecewise analytical construction, obtained for elastic gradient descent with infinitesimal step size. We also compare elastic gradient descent to the elastic net on real and simulated data and show that it provides similar solution paths, but is several orders of magnitude faster. Compared to forward stagewise regression, elastic gradient descent selects a model that, although still sparse, provides considerably lower prediction and estimation errors. 

Place, publisher, year, edition, pages
2023. Vol. 24, no 277, p. 1-53
National Category
Probability Theory and Statistics Computational Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-345872OAI: oai:DiVA.org:kth-345872DiVA, id: diva2:1854149
Note

QC 20240429

Available from: 2024-04-24 Created: 2024-04-24 Last updated: 2024-04-29Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

https://www.jmlr.org/papers/v24/22-0119.html

Authority records

Allerbo, OskarJonasson, Johan

Search in DiVA

By author/editor
Allerbo, OskarJonasson, JohanJörnsten, Rebecka
By organisation
Mathematics (Dept.)
In the same journal
Journal of machine learning research
Probability Theory and StatisticsComputational Mathematics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 200 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf