Penalized Bregman Divergence Estimation via Coordinate Descent

• Activity Number: 392
• Type: Topic Contributed
• Date/Time: Tuesday, August 2, 2011 : 2:00 PM to 3:50 PM
• Sponsor: Section on Statistical Learning and Data Mining
• Author(s): Chunming Zhang*+
• Companies: University of Wisconsin at Madison
• Keywords: Bregman divergence ; LARS algorithm ; quasi-likelihood ; sparsity ; variable selection

Abstract

Variable selection via penalized estimation is appealing for dimension reduction. For penalized linear regression, Efron, etal (2004) introduced the LARS algorithm. Recently, the coordinate descent (CD) algorithm was developed by Friedman, etal (2007) for penalized linear regression and penalized logistic regression and was shown to gain computational superiority. This paper explores the CD algorithm to penalized Bregman divergence (BD) estimation for a broader class of models, including not only the generalized linear model, which has been well studied in the literature on penalization, but also the quasi-likelihood model, which has been less developed. Simulation study and real data application illustrate the performances of the CD and LARS algorithms in regression estimation, variable selection and classification procedure when the number of explanatory variables is large in comparison to the sample size.