%0 Journal Article %1 lutz_conjugate_2006 %A Lutz, Roman Werner %A Bühlmann, Peter %D 2006 %J Journal of Computational and Graphical Statistics %K Boosting, \_tablet, matrices, selection sparse variable %N 2 %P 287--311 %R 10.1198/106186006X113548 %T Conjugate direction boosting %U http://amstat.tandfonline.com.proxy.lib.uiowa.edu/doi/abs/10.1198/106186006X113548#.UaUGQhU-QTw %V 15 %X Boosting in the context of linear regression has become more attractive with the invention of least angle regression (LARS), where the connection between the lasso and forward stagewise fitting (boosting) has been established. Earlier it has been found that boosting is a functional gradient optimization. Instead of the gradient, we propose a conjugate direction method (CDBoost). As a result, we obtain a fast forward stepwise variable selection algorithm. The conjugate direction of CDBoost is analogous to the constrained gradient in boosting. Using this analogy, we generalize CDBoost to: (1) include small step sizes (shrinkage) which often improves prediction accuracy; and (2) the nonparametric setting with fitting methods such as trees or splines, where least angle regression and the lasso seem to be unfeasible. The step size in CDBoost has a tendency to govern the degree between L0- and L1-penalization. This makes CDBoost surprisingly flexible. We compare the different methods on simulated and real datasets. CDBoost achieves the best predictions mainly in complicated settings with correlated covariates, where it is difficult to determine the contribution of a given covariate to the response. The gain of CDBoost over boosting is especially high in sparse cases with high signal to noise ratio and few effective covariates.

@article{lutz_conjugate_2006, abstract = {Boosting in the context of linear regression has become more attractive with the invention of least angle regression (LARS), where the connection between the lasso and forward stagewise fitting (boosting) has been established. Earlier it has been found that boosting is a functional gradient optimization. Instead of the gradient, we propose a conjugate direction method (CDBoost). As a result, we obtain a fast forward stepwise variable selection algorithm. The conjugate direction of CDBoost is analogous to the constrained gradient in boosting. Using this analogy, we generalize CDBoost to: (1) include small step sizes (shrinkage) which often improves prediction accuracy; and (2) the nonparametric setting with fitting methods such as trees or splines, where least angle regression and the lasso seem to be unfeasible. The step size in CDBoost has a tendency to govern the degree between L0- and L1-penalization. This makes CDBoost surprisingly flexible. We compare the different methods on simulated and real datasets. CDBoost achieves the best predictions mainly in complicated settings with correlated covariates, where it is difficult to determine the contribution of a given covariate to the response. The gain of CDBoost over boosting is especially high in sparse cases with high signal to noise ratio and few effective covariates.}, added-at = {2017-01-09T13:57:26.000+0100}, author = {Lutz, Roman Werner and Bühlmann, Peter}, biburl = {https://www.bibsonomy.org/bibtex/20dce6164d064dde98720b0bc2da20068/yourwelcome}, doi = {10.1198/106186006X113548}, interhash = {52bf7b5998c4f0fa1bf1cd29faeb467c}, intrahash = {0dce6164d064dde98720b0bc2da20068}, issn = {1061-8600, 1537-2715}, journal = {Journal of Computational and Graphical Statistics}, keywords = {Boosting, \_tablet, matrices, selection sparse variable}, month = jun, number = 2, pages = {287--311}, timestamp = {2017-01-09T14:01:11.000+0100}, title = {Conjugate direction boosting}, url = {http://amstat.tandfonline.com.proxy.lib.uiowa.edu/doi/abs/10.1198/106186006X113548#.UaUGQhU-QTw}, urldate = {2013-05-28}, volume = 15, year = 2006 }