A New Algorithm in Maximum Likelihood Estimation for Generalized Linear Models

Yufang Wen, Xiangdong Song, Haisen Zhang

Abstract


We intrduce a new algorithm for  regularized generalized linear models. The  regularization procedure is useful,especially because it ,in effect,selects variables according to the amount of penalization on the  norm of the coefficients,in a manner less greedy than forward selection/backward deletion. The algorithm efficiently computes solutions along the entire regularization path using the predictor-corrector method of convex-optimization. Selecting the step length of the regularization parameter is critical in controlling the overall accuracy of the paths; we suggest intuitive and flexible strategies for choosing appropriate values.


Full Text: PDF

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Modern Applied Science   ISSN 1913-1844 (Print)   ISSN 1913-1852 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.