A Splicing Approach to Best Subset of Groups Selection

Yanhang Zhang (), Junxian Zhu (), Jin Zhu () and Xueqin Wang ()
Additional contact information
Yanhang Zhang: School of Statistics, Renmin University of China, Beijing 100872, China; Southern China Center for Statistical Science, Department of Statistical Science, School of Mathematics, Sun Yat-Sen University, Guangzhou 510275, China
Junxian Zhu: Saw Swee Hock School of Public Health, National University of Singapore, 117549 Singapore
Jin Zhu: Southern China Center for Statistical Science, Department of Statistical Science, School of Mathematics, Sun Yat-Sen University, Guangzhou 510275, China
Xueqin Wang: Department of Statistics and Finance/International Institute of Finance, School of Management, University of Science and Technology of China, Hefei 230026, China

INFORMS Journal on Computing, 2023, vol. 35, issue 1, 104-119

Abstract: Best subset of groups selection (BSGS) is the process of selecting a small part of nonoverlapping groups to achieve the best interpretability on the response variable. It has attracted increasing attention and has far-reaching applications in practice. However, due to the computational intractability of BSGS in high-dimensional settings, developing efficient algorithms for solving BSGS remains a research hotspot. In this paper, we propose a group-splicing algorithm that iteratively detects the relevant groups and excludes the irrelevant ones. Moreover, coupled with a novel group information criterion, we develop an adaptive algorithm to determine the optimal model size. Under certain conditions, it is certifiable that our algorithm can identify the optimal subset of groups in polynomial time with high probability. Finally, we demonstrate the efficiency and accuracy of our methods by comparing them with several state-of-the-art algorithms on both synthetic and real-world data sets.

Keywords: best subset of groups selection; group splicing; group information criterion; selection consistency of subset of groups; polynomial computational complexity (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/ijoc.2022.1241 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:35:y:2023:i:1:p:104-119

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().