An Interactive Greedy Approach to Group Sparsity in High Dimension

07/10/2017
by   Wei Qian, et al.
0

Sparsity learning with known grouping structures has received considerable attention due to wide modern applications in high-dimensional data analysis. Although advantages of using group information have been well-studied by shrinkage-based approaches, benefits of group sparsity have not been well-documented for greedy-type methods, which much limits our understanding and use of this important class of methods. In this paper, generalizing from a popular forward-backward greedy approach, we propose a new interactive greedy algorithm for group sparsity learning and prove that the proposed greedy-type algorithm attains the desired benefits of group sparsity under high dimensional settings. An estimation error bound refining other existing methods and a guarantee for group support recovery are also established simultaneously. In addition, an interactive feature is incorporated to allow extra algorithm flexibility without compromise in theoretical properties. The promising use of our proposal is demonstrated through numerical evaluations including a real industrial application in human activity recognition.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/31/2013

Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraint

We consider forward-backward greedy algorithms for solving sparse featur...
research
08/13/2022

A sequential stepwise screening procedure for sparse recovery in high-dimensional multiresponse models with complex group structures

Multiresponse data with complex group structures in both responses and p...
research
02/01/2013

Regression shrinkage and grouping of highly correlated predictors with HORSES

Identifying homogeneous subgroups of variables can be challenging in hig...
research
07/01/2019

A greedy algorithm for sparse precision matrix approximation

Precision matrix estimation is an important problem in statistical data ...
research
07/19/2021

Estimation of high-dimensional change-points under a group sparsity structure

Change-points are a routine feature of 'big data' observed in the form o...
research
08/20/2020

An Examination of Grouping and Spatial Organization Tasks for High-Dimensional Data Exploration

How do analysts think about grouping and spatial operations? This overar...
research
03/10/2015

Learning the Structure for Structured Sparsity

Structured sparsity has recently emerged in statistics, machine learning...

Please sign up or login with your details

Forgot password? Click here to reset