A neutral comparison of algorithms to minimize <i>L</i><sub>0</sub> penalties for high‐dimensional variable selection

doi:10.1002/bimj.202200207

Florian Frommlet

A neutral comparison of algorithms to minimize L₀ penalties for high‐dimensional variable selection

Statistics, Probability and Uncertainty
General Medicine
Statistics and Probability

AbstractVariable selection methods based on L0 penalties have excellent theoretical properties to select sparse models in a high‐dimensional setting. There exist modifications of the Bayesian Information Criterion (BIC) which either control the familywise error rate (mBIC) or the false discovery rate (mBIC2) in terms of which regressors are selected to enter a model. However, the minimization of L0 penalties comprises a mixed‐integer problem which is known to be NP‐hard and therefore becomes computationally challenging with increasing numbers of regressor variables. This is one reason why alternatives like the LASSO have become so popular, which involve convex optimization problems that are easier to solve. The last few years have seen some real progress in developing new algorithms to minimize L0 penalties. The aim of this article is to compare the performance of these algorithms in terms of minimizing L0‐based selection criteria. Simulation studies covering a wide range of scenarios that are inspired by genetic association studies are used to compare the values of selection criteria obtained with different algorithms. In addition, some statistical characteristics of the selected models and the runtime of algorithms are compared. Finally, the performance of the algorithms is illustrated in a real data example concerned with expression quantitative trait loci (eQTL) mapping.

Need a simple solution for managing your BibTeX entries? Explore CiteDrive!

Web-based, modern reference management
Collaborate and share with fellow researchers
Integration with Overleaf
Comprehensive BibTeX/BibLaTeX support
Save articles and websites directly from your browser
Search for new articles from a database of tens of millions of references

Try out CiteDrive

A neutral comparison of algorithms to minimize L₀ penalties for high‐dimensional variable selection

Need a simple solution for managing your BibTeX entries? Explore CiteDrive!

More from our Archive

Automated calibration for stability selection in penalised regression and graphical models

On the causal interpretation of randomised interventional indirect effects

Prediction sets adaptive to unknown covariate shift

Revisiting the Great Ratios Hypothesis*

Nonparametric simulation extrapolation for measurement‐error models

Agent-based modeling in medical research, virtual baseline generator and change in patients’ profile issue

On the correlation analysis of stocks with zero returns