Installation
About
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); the link is provided in the URL field below.
Key Metrics
Downloads
Yesterday | 84 0% |
Last 7 days | 164 -22% |
Last 30 days | 812 -2% |
Last 90 days | 2.710 +32% |
Last 365 days | 9.354 +13% |