Generalized Information Criteria for Structured Sparse Models

Regularized m-estimators are widely used due to their ability of recovering a low-dimensional model in high-dimensional scenarios. Some recent efforts on this subject focused on creating a unified framework for establishing oracle bounds, and deriving conditions for support recovery. Under this same...

Full description

Saved in:
Bibliographic Details
Main Authors Mendes, Eduardo F, Pinto, Gabriel J. P
Format Journal Article
LanguageEnglish
Published 04.09.2023
Subjects
Statistics - Machine Learning
Statistics - Methodology
Online AccessGet full text

Cover

More Information
Summary:Regularized m-estimators are widely used due to their ability of recovering a low-dimensional model in high-dimensional scenarios. Some recent efforts on this subject focused on creating a unified framework for establishing oracle bounds, and deriving conditions for support recovery. Under this same framework, we propose a new Generalized Information Criteria (GIC) that takes into consideration the sparsity pattern one wishes to recover. We obtain non-asymptotic model selection bounds and sufficient conditions for model selection consistency of the GIC. Furthermore, we show that the GIC can also be used for selecting the regularization parameter within a regularized $m$-estimation framework, which allows practical use of the GIC for model selection in high-dimensional scenarios. We provide examples of group LASSO in the context of generalized linear regression and low rank matrix regression.
DOI:10.48550/arxiv.2309.01764