20 research outputs found

    Characterizing L2L_2Boosting

    Full text link
    We consider L2L_2Boosting, a special case of Friedman's generic boosting algorithm applied to linear regression under L2L_2-loss. We study L2L_2Boosting for an arbitrary regularization parameter and derive an exact closed form expression for the number of steps taken along a fixed coordinate direction. This relationship is used to describe L2L_2Boosting's solution path, to describe new tools for studying its path, and to characterize some of the algorithm's unique properties, including active set cycling, a property where the algorithm spends lengthy periods of time cycling between the same coordinates when the regularization parameter is arbitrarily small. Our fixed descent analysis also reveals a repressible condition that limits the effectiveness of L2L_2Boosting in correlated problems by preventing desirable variables from entering the solution path. As a simple remedy, a data augmentation method similar to that used for the elastic net is used to introduce L2L_2-penalization and is shown, in combination with decorrelation, to reverse the repressible condition and circumvents L2L_2Boosting's deficiencies in correlated problems. In itself, this presents a new explanation for why the elastic net is successful in correlated problems and why methods like LAR and lasso can perform poorly in such settings.Comment: Published in at http://dx.doi.org/10.1214/12-AOS997 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org

    THE ROLE OF NONCOGNITIVE CONSTRUCTS AND OTHER BACKGROUND VARIABLES IN GRADUATE EDUCATION

    Full text link

    ggRandomForests: RandomForest support

    No full text
    Graphical analysis of random forests with the randomForestSRC and ggplot2 packages

    Commercial feldspar resources in southeastern Kankakee County, Illinois

    Get PDF
    Cover title.Includes bibliographical references
    corecore