Lasso and elastic nets by orthants

07/19/2023
by   Hugo Maruri-Aguilar, et al.
0

We propose a new method for computing the lasso path, using the fact that the Manhattan norm of the coefficient vector is linear over every orthant of the parameter space. We use simple calculus and present an algorithm in which the lasso path is series of orthant moves. Our proposal gives the same results as standard literature, with the advantage of neat interpretation of results and explicit lasso formulæ. We extend this proposal to elastic nets and obtain explicit, exact formulæ for the elastic net path, and with a simple change, our lasso algorithm can be used for elastic nets. We present computational examples and provide simple R prototype code.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/23/2012

Sparse Prediction with the k-Support Norm

We derive a novel norm that corresponds to the tightest convex relaxatio...
research
08/01/2017

Fast Exact Conformalization of Lasso using Piecewise Linear Homotopy

Conformal prediction is a general method that converts almost any point ...
research
06/02/2020

Feature-weighted elastic net: using "features of features" for better prediction

In some supervised learning settings, the practitioner might have additi...
research
05/19/2018

Sequential adaptive elastic net approach for single-snapshot source localization

This paper proposes efficient algorithms for accurate recovery of direct...
research
08/14/2011

Generalised elastic nets

The elastic net was introduced as a heuristic algorithm for combinatoria...
research
11/18/2013

A Component Lasso

We propose a new sparse regression method called the component lasso, ba...
research
06/08/2018

The Well Tempered Lasso

We study the complexity of the entire regularization path for least squa...

Please sign up or login with your details

Forgot password? Click here to reset