2010 AnEfficientAlgorithmforaClassof

From GM-RKB
Jump to navigation Jump to search

Subject Headings:

Notes

Cited By

Quotes

Author Keywords

Fused Lasso, ℓ1 regularization, restart, subgradient

Abstract

The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful way. The resulting problem is, however, challenging to solve, as the fused Lasso penalty is both non-smooth and non-separable. Existing algorithms have high computational complexity and do not scale to large-size problems. In this paper, we propose an Efficient Fused Lasso Algorithm (EFLA) for optimizing this class of problems. One key building block in the proposed EFLA is the Fused Lasso Signal Approximator (FLSA). To efficiently solve FLSA, we propose to reformulate it as the problem of finding an "appropriate" subgradient of the fused penalty at the minimizer, and develop a Subgradient Finding Algorithm (SFA). We further design a restart technique to accelerate the convergence of SFA, by exploiting the special “structures” of both the original and the reformulated FLSA problems. Our empirical evaluations show that, both SFA and EFLA significantly outperform existing solvers. We also demonstrate several applications of the fused Lasso.

References

,

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2010 AnEfficientAlgorithmforaClassofLei Yuan
Jieping Ye
Jun Liu
An Efficient Algorithm for a Class of Fused Lasso ProblemsKDD-2010 Proceedingshttp://www.public.asu.edu/~jye02/Publications/Papers/rp589f-liu.pdf10.1145/1835804.18358472010