gglasso
Group Lasso Penalized Learning Using a Unified BMD Algorithm
A unified algorithm, blockwise-majorization-descent (BMD), for efficiently computing the solution paths of the group-lasso penalized least squares, logistic regression, Huberized SVM and squared SVM. The package is an implementation of Yang, Y. and Zou, H. (2015) DOI: doi:10.1007/s11222-014-9498-5.
- Version1.5.1
- R versionunknown
- LicenseGPL-2
- Needs compilation?Yes
- Last release03/24/2024
Documentation
Team
Yi Yang
MaintainerShow author detailsSahir Bhatnagar
Show author detailsRolesAuthorHui Zou
Show author detailsRolesAuthor
Insights
Last 30 days
This package has been downloaded 888 times in the last 30 days. More downloads than an obscure whitepaper, but not enough to bring down any servers. A solid effort! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 39 times.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
This package has been downloaded 11,362 times in the last 365 days. That's enough downloads to make it mildly famous in niche technical communities. A badge of honor! The day with the most downloads was Jul 21, 2024 with 164 downloads.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Suggests3 packages
- Reverse Imports9 packages
- Reverse Suggests6 packages