The Tweedie lasso model implements an iteratively reweighed least square (IRLS) strategy that incorporates a blockwise majorization decent (BMD) method, for efficiently computing solution paths of the (grouped) lasso and the (grouped) elastic net methods.
https://anaconda.org/r/r-hdtweedie/badges/version.svg
https://anaconda.org/r/r-hdtweedie/badges/latest_release_date.svg
https://anaconda.org/r/r-hdtweedie/badges/latest_release_relative_date.svg
https://anaconda.org/r/r-hdtweedie/badges/platforms.svg
https://anaconda.org/r/r-hdtweedie/badges/license.svg
https://anaconda.org/r/r-hdtweedie/badges/downloads.svg