Screening Tests for Lasso Problems
TLDR
Using a geometrically intuitive framework, this paper provides basic insights for understanding useful lasso screening tests and their limitations, and provides illustrative numerical studies on several datasets.Abstract:
This paper is a survey of dictionary screening for the lasso problem. The lasso problem seeks a sparse linear combination of the columns of a dictionary to best match a given target vector. This sparse representation has proven useful in a variety of subsequent processing and decision tasks. For a given target vector, dictionary screening quickly identifies a subset of dictionary columns that will receive zero weight in a solution of the corresponding lasso problem. These columns can be removed from the dictionary prior to solving the lasso problem without impacting the optimality of the solution obtained. This has two potential advantages: it reduces the size of the dictionary, allowing the lasso problem to be solved with less resources, and it may speed up obtaining a solution. Using a geometrically intuitive framework, we provide basic insights for understanding useful lasso screening tests and their limitations. We also provide illustrative numerical studies on several datasets.read more
Citations
More filters
Posted Content
Mind the duality gap: safer rules for the Lasso
TL;DR: In this paper, the authors proposed new versions of the so-called $\textit{safe rules}$ for the Lasso, based on duality gap considerations, to create safe test regions whose diameters converge to zero, provided that one relies on a converging solver.
Journal ArticleDOI
Pain-free resting-state functional brain connectivity predicts individual pain sensitivity
Tamás Spisák,Bálint Kincses,Frederik Schlitt,Matthias Zunhammer,Tobias Schmidt-Wilcke,Zsigmond Tamás Kincses,Ulrike Bingel +6 more
TL;DR: A network pattern in the pain-free resting-state functional brain connectome that is predictive of interindividual differences in pain sensitivity is identified and validated and may have implications for translational research and the development and assessment of analgesic treatment strategies.
Proceedings Article
GAP safe screening rules for sparse multi-task and multi-class models
TL;DR: In this paper, the authors derive new safe rules for generalized linear models regularized with l 1 and l 1/ l 2 norms, based on duality gap computations and spherical safe regions whose diameters converge to zero.
Posted Content
GAP Safe screening rules for sparse multi-task and multi-class models
TL;DR: New safe rules for generalized linear models regularized with l1 and l1/ l2 norms are derived, based on duality gap computations and spherical safe regions whose diameters converge to zero, to discard safely more variables for low regularization parameters.
Proceedings ArticleDOI
Safe Pattern Pruning: An Efficient Approach for Predictive Pattern Mining
TL;DR: In this paper, the safe pattern pruning (SPP) algorithm is proposed for a class of predictive pattern mining problems, where the goal is to construct a predictive model based on a subset of predictive patterns in the database.
References
More filters
Journal ArticleDOI
Gradient-based learning applied to document recognition
Yann LeCun,Léon Bottou,Léon Bottou,Yoshua Bengio,Yoshua Bengio,Yoshua Bengio,Patrick Haffner +6 more
TL;DR: In this article, a graph transformer network (GTN) is proposed for handwritten character recognition, which can be used to synthesize a complex decision surface that can classify high-dimensional patterns, such as handwritten characters.
Journal ArticleDOI
Regression Shrinkage and Selection via the Lasso
TL;DR: A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
Journal ArticleDOI
Regularization and variable selection via the elastic net
Hui Zou,Trevor Hastie +1 more
TL;DR: It is shown that the elastic net often outperforms the lasso, while enjoying a similar sparsity of representation, and an algorithm called LARS‐EN is proposed for computing elastic net regularization paths efficiently, much like algorithm LARS does for the lamba.
Journal ArticleDOI
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Amir Beck,Marc Teboulle +1 more
TL;DR: A new fast iterative shrinkage-thresholding algorithm (FISTA) which preserves the computational simplicity of ISTA but with a global rate of convergence which is proven to be significantly better, both theoretically and practically.
Journal ArticleDOI
Robust Face Recognition via Sparse Representation
TL;DR: This work considers the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise, and proposes a general classification algorithm for (image-based) object recognition based on a sparse representation computed by C1-minimization.