L0Learn
Fast Algorithms for Best Subset Selection
Highly optimized toolkit for approximately solving L0-regularized learning problems (a.k.a. best subset selection). The algorithms are based on coordinate descent and local combinatorial search. For more details, check the paper by Hazimeh and Mazumder (2020) <doi:10.1287/opre.2019.1919>.
Tests Vignettes
Dependencies
| Imports/Depends/LinkingTo/Enhances (6) |
|---|
| Suggests (6) |
|---|