A Coordinate-Descent-Based Approach to Solving the Sparse Group Elastic Net. Issue 4 (2nd October 2017)

• Record Type: Journal Article
• Authors: Samarov, Daniel V.; Allen, David; Hwang, Jeeseong; Lee, Young Jong; Litorja, Maritoni
• Is Part Of: Technometrics. Volume 59:Issue 4(2017)
• Page Start: 437
• Page End: 445
• Publication Date: 2017-10-02
• Subjects: Feature selection -- Group lasso -- l infinity-norm -- Sparse regression; Statistical physics -- Periodicals; Chemistry -- Statistical methods -- Periodicals; Engineering -- Statistical methods -- Periodicals; 519.5
• DOI: 10.1080/00401706.2016.1273138
• Languages: English
• ISSNs: 0040-1706

Abstract

ABSTRACT: Group sparse approaches to regression modeling are finding ever increasing utility in an array of application areas. While group sparsity can help assess certain data structures, it is desirable in many instances to also capture element-wise sparsity. Recent work exploring the latter has been conducted in the context of l 2 / l 1 penalized regression in the form of the sparse group lasso (SGL). Here, we present a novel model, called the sparse group elastic net (SGEN), which uses an l ∞ / l 1 /ridge-based penalty. We show that the l ∞ -norm, which induces group sparsity is particularly effective in the presence of noisy data. We solve the SGEN model using a coordinate descent-based procedure and compare its performance to the SGL and related methods in the context of hyperspectral imaging in the presence of noisy observations. Supplementary materials for this article are available online.