Nothing
L0Learn: Fast Algorithms for Best Subset Selection
Highly optimized toolkit for approximately solving L0-regularized learning problems (aka best subset selection). The algorithms are based on coordinate descent and local combinatorial search. For more details, check the paper by Hazimeh and Mazumder (2018) <arXiv:1803.01454>; the link is provided in the URL field below.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Hussein Hazimeh, Rahul Mazumder |
| Maintainer | Hussein Hazimeh <hazimeh@mit.edu> |
| License | MIT + file LICENSE |
| Version | 1.2.0 |
| URL | https://arxiv.org/abs/1803.01454 |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the L0Learn package in your browser
Any scripts or data that you put into this service are public.
