The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
lambda are unchanged.penalty.factor is rescaled to sum to p, as
glmnet does internally. Before, with weights on another
scale (adaptive Lasso) the line search compared a penalty different from
the one minimized by the inner solver, rejected valid steps and the path
reached maxit.maxit.verbose = TRUE reports progress through
message().print() labels alpha = 0 fits as
ridge.alpha < 1. glmnet standardizes the Gaussian response and
therefore divides its ridge term by the standard deviation of the
pseudo-response; the inner call now compensates, so the penalized
objective is exactly
lambda * sum(alpha * |b| + (1 - alpha) * b^2 / 2) on the
standardized columns. Before the fix the line search rejected the glmnet
step at some grid points and ridge paths reached maxit.
Lasso fits are unchanged.modal_net(). modal_lasso() remains as an
alias.alpha.These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.