Pinball boosting of regression quantiles

Abstract

An algorithm for boosting regression quantiles using asymmetric least absolute deviations, better known as pinball loss, is proposed. Existing approaches for boosting regression quantiles are essentially equal to least squares boosting of regression means with the single difference that their working residuals are based on pinball loss. All steps of our boosting algorithm are embedded in the well-established framework of quantile regression, and its main components – sequential base learning, fitting, and updating – are based on consistent scoring rules for regression quantiles. The Monte Carlo simulations performed indicate that the pinball boosting algorithm is competitive with existing approaches for boosting regression quantiles in terms of estimation accuracy and variable selection, and that its application to the study of regression quantiles of hedonic price functions allows the estimation of previously infeasible high-dimensional specifications.