We have submitted glmnet_1.6 to CRAN

This version has an improved convergence criterion, and it also uses
a variable screening algorithm that dramatically reduces the time
to convergence (while still producing the exact solutions).
The speedups in some cases are by a factors of 20 to 50, depending on
the particular problem and loss function.

See our paper http://www-stat.stanford.edu/~tibs/ftp/strong.pdf 
"Strong Rules for Discarding Predictors in Lasso-type Problems"
for details of this screening method.

-------------------------------------------------------------------
  Trevor Hastie                                   has...@stanford.edu  
  Professor, Department of Statistics, Stanford University
  Phone: (650) 725-2231 (Statistics)          Fax: (650) 725-8977  
  (650) 498-5233 (Biostatistics)   Fax: (650) 725-6951
  URL: http://www-stat.stanford.edu/~hastie  
   address: room 104, Department of Statistics, Sequoia Hall
           390 Serra Mall, Stanford University, CA 94305-4065

_______________________________________________
R-packages mailing list
r-packa...@r-project.org
https://stat.ethz.ch/mailman/listinfo/r-packages

______________________________________________
R-help@r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.

Reply via email to