The Group-Lasso for Generalized Linear Models: Uniqueness of Solutions and Efficient Algorithms
Abstract
The GroupLASSO method for finding important explanatory factors suffers from the potential non-uniqueness of solutions and also from high computational costs. We formulate conditions for the uniqueness of GroupLASSO solutions which lead to an easily implementable test procedure. In addition to merely detecting ambiguities in solutions, this testing procedure identifies all potentially active groups. These results are used to derive an efficient algorithm that can deal with input dimensions in the millions and can approximate the solution path efficiently. The derived methods are applied to large-scale learning problems where they exhibit excellent performance. We show that the proposed testing procedure helps to avoid misinterpretations of GroupLASSO solutions.
Cite
Text
Roth and Fischer. "The Group-Lasso for Generalized Linear Models: Uniqueness of Solutions and Efficient Algorithms." International Conference on Machine Learning, 2008. doi:10.1145/1390156.1390263Markdown
[Roth and Fischer. "The Group-Lasso for Generalized Linear Models: Uniqueness of Solutions and Efficient Algorithms." International Conference on Machine Learning, 2008.](https://mlanthology.org/icml/2008/roth2008icml-group/) doi:10.1145/1390156.1390263BibTeX
@inproceedings{roth2008icml-group,
title = {{The Group-Lasso for Generalized Linear Models: Uniqueness of Solutions and Efficient Algorithms}},
author = {Roth, Volker and Fischer, Bernd},
booktitle = {International Conference on Machine Learning},
year = {2008},
pages = {848-855},
doi = {10.1145/1390156.1390263},
url = {https://mlanthology.org/icml/2008/roth2008icml-group/}
}