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

DOI10.1002/BIMJ.202200207zbMATH Open1547.6223MaRDI QIDQ6625366FDOQ6625366

Authors: Florian Frommlet 

Publication date: 28 October 2024

Published in: Biometrical Journal (Search for Journal in Brave)

zbMATH Keywords

variable selectionhigh-dimensional data\(L_0\) penaltiesneutral comparison

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10)

Cites Work

• Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
• Estimating the dimension of a model
• Extending the Modified Bayesian Information Criterion (mBIC) to Dense Markers and Multiple Interval Mapping
• A new look at the statistical model identification
• Sure Independence Screening for Ultrahigh Dimensional Feature Space
• Adaptive robust variable selection
• Phenotypes and genotypes. The search for influential genes
• False discoveries occur early on the Lasso path
• The risk inflation criterion for multiple regression
• To explain or to predict?
• Penalized Composite Quasi-Likelihood for Ultrahigh Dimensional Variable Selection
• Sparse regression: scalable algorithms and empirical performance
• Title not available (Why is that?)
• GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee
• A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
• Variable selection -- a review and recommendations for the practicing statistician
• Title not available (Why is that?)

This page was built for publication: A neutral comparison of algorithms to minimize \(L_0\) penalties for high-dimensional variable selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6625366)