Computing Leapfrog Regularization Paths with Applications to Large-Scale K-mer Logistic Regression

Journal of computational biology

article

Philipp Benner¹ 

[1] Department of Computational Molecular Biology, Max Planck Institute for Molecular Genetics

关键词: feature selection;    ‘1-regularization;    LARS;    orthogonal matching pursuit;   

DOI  :  10.1089/cmb.2020.0284

来源: Mary Ann Liebert, Inc. Publishers

【 摘 要 】

High-dimensional statistics deals with statistical inference when the number of parameters or features p exceeds the number of observations n (i.e., p n). In this case, the parameter space must be constrained either by regularization or by selecting a small subset of m n features. Feature selection through ‘1-regularization combines the benefits of both approaches and has proven to yield good results in practice. However, the functional relation between the regularization strength k and the number of selected features m is difficult to determine. Hence, parameters are typically estimated for all possible regularization strengths k. These socalled regularization paths can be expensive to compute and most solutions may not even be of interest to the problem at hand. As an alternative, an algorithm is proposed that determines the ‘1-regularization strength k iteratively for a fixed m. The algorithm can be used to compute leapfrog regularization paths by subsequently increasing m.

【 授权许可】

Unknown