DeepAI AI Chat
Log In Sign Up

Certifiably Polynomial Algorithm for Best Group Subset Selection

by   Yanhang Zhang, et al.

Best group subset selection aims to choose a small part of non-overlapping groups to achieve the best interpretability on the response variable. It is practically attractive for group variable selection; however, due to the computational intractability in high dimensionality setting, it doesn't catch enough attention. To fill the blank of efficient algorithms for best group subset selection, in this paper, we propose a group-splicing algorithm that iteratively detects effective groups and excludes the helpless ones. Moreover, coupled with a novel Bayesian group information criterion, an adaptive algorithm is developed to determine the true group subset size. It is certifiable that our algorithms enable identifying the optimal group subset in polynomial time under mild conditions. We demonstrate the efficiency and accuracy of our proposal by comparing state-of-the-art algorithms on both synthetic and real-world datasets.


page 1

page 2

page 3

page 4


Recognizing the Commuting Graph of a Finite Group

In this paper we study the realizability question for commuting graphs o...

Subset selection in sparse matrices

In subset selection we search for the best linear predictor that involve...

Best-Subset Selection in Generalized Linear Models: A Fast and Consistent Algorithm via Splicing Technique

In high-dimensional generalized linear models, it is crucial to identify...

A constrained minimum criterion for variable selection

For variable selection in the sparse linear model setting, we propose a ...

Optimal variable selection in multi-group sparse discriminant analysis

This article considers the problem of multi-group classification in the ...

Best Subset Selection with Efficient Primal-Dual Algorithm

Best subset selection is considered the `gold standard' for many sparse ...

On best subset regression

In this paper we discuss the variable selection method from ℓ0-norm cons...