A Unified Algorithm for Penalized Convolution Smoothed Quantile Regression
Abstract
Penalized quantile regression (QR) is widely used for studying the relationship between a response variable and a set of predictors under data heterogeneity in high-dimensional settings. Compared to penalized least squares, scalable algorithms for fitting penalized QR are lacking due to the non-differentiable piecewise linear loss function. To overcome the lack of smoothness, a recently proposed convolution-type smoothed method brings an interesting tradeoff between statistical accuracy and computational efficiency for both standard and penalized quantile regressions. In this paper, we propose a unified algorithm for fitting penalized convolution smoothed quantile regression with various commonly used convex penalties, accompanied by an R-language package conquer available from the Comprehensive R Archive Network. We perform extensive numerical studies to demonstrate the superior performance of the proposed algorithm over existing methods in both statistical and computational aspects. We further exemplify the proposed algorithm by fitting a fused lasso additive QR model on the world happiness data.
Cite
@article{arxiv.2205.02432,
title = {A Unified Algorithm for Penalized Convolution Smoothed Quantile Regression},
author = {Rebeka Man and Xiaoou Pan and Kean Ming Tan and Wen-Xin Zhou},
journal= {arXiv preprint arXiv:2205.02432},
year = {2022}
}