Sparsity and Smoothness Via the Fused Lasso
Why is this work in the frame?
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Abstract
Summary The lasso penalizes a least squares regression by the sum of the absolute values (L1-norm) of the coefficients. The form of this penalty encourages sparse solutions (with many coefficients equal to 0). We propose the ‘fused lasso’, a generalization that is designed for problems with features that can be ordered in some meaningful way. The fused lasso penalizes the L1-norm of both the coefficients and their successive differences. Thus it encourages sparsity of the coefficients and also sparsity of their differences—i.e. local constancy of the coefficient profile. The fused lasso is especially useful when the number of features p is much greater than N, the sample size. The technique is also extended to the ‘hinge’ loss function that underlies the support vector classifier. We illustrate the methods on examples from protein mass spectroscopy and gene expression data.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
The record
- Venue
- Journal of the Royal Statistical Society Series B (Statistical Methodology)
- Topic
- Statistical Methods and Inference
- Field
- Mathematics
- Canadian institutions
- University of Toronto
- Funders
- Office of Naval ResearchNational Institutes of HealthNational Science Foundation
- Keywords
- Lasso (programming language)Elastic net regularizationMathematicsSmoothnessNorm (philosophy)Applied mathematicsLeast-squares function approximationRegressionClassifier (UML)Linear regressionAlgorithmMathematical optimizationComputer sciencePattern recognition (psychology)Artificial intelligenceStatisticsMathematical analysis
- Has abstract in OpenAlex
- yes