A path algorithm for the Fused Lasso Signal Approximator

Code

• github.com/goepp/graphseg
  none★ 0

Abstract

The Lasso is a very well known penalized regression model, which adds an L_1 penalty with parameter _1 on the coefficients to the squared error loss function. The Fused Lasso extends this model by also putting an L_1 penalty with parameter _2 on the difference of neighboring coefficients, assuming there is a natural ordering. In this paper, we develop a fast path algorithm for solving the Fused Lasso Signal Approximator that computes the solutions for all values of _1 and _2. In the supplement, we also give an algorithm for the general Fused Lasso for the case with predictor matrix R^n p with rank()=p.

Tasks

Reproductions