Nonparametric and Semiparametric Quantile Regression via a New MM Algorithm

• Published in: Journal of computational and graphical statistics Vol. 32; no. 4; pp. 1613 - 1623
• Main Authors: Kai, Bo, Huang, Mian, Yao, Weixin, Dong, Yuexiao
• Format: Journal Article
• Language: English
• Published: Alexandria Taylor & Francis 02.10.2023; Taylor & Francis Ltd
• Subjects: Algorithms; Asymptotic properties; Descent property; Iterative methods; Kernel smoothing; Numerical optimization; Quantile estimation; Regression models; Statistical computing
• ISSN: 1061-8600; 1537-2715; 1537-2715
• DOI: 10.1080/10618600.2023.2184374

Quantile regression is a popular method with a wide range of scientific applications, but the computation for quantile regression is challenging. Hunter and Lange proposed an MM algorithm for solving optimization problems in parametric quantile regression models. For nonparametric and semiparametric quantile regression, their algorithm can be applied to estimate unknown quantile functions in a pointwise manner. However, the resulting estimates may suffer from drawbacks like nonsmooth with discontinuous points and unstable at extreme quantile levels. To remedy the above issues, we propose a new MM algorithm and show that it yields continuous, smoother, and faster estimated quantile functions. We systematically study the new MM algorithm using the local linear quantile regression model. We prove that the proposed algorithm preserves the monotone descent property in an asymptotic sense. We then extend it to some popular nonparametric and semiparametric quantile regression models. For semiparametric models, we propose new efficient backfitting algorithms based on the new MM algorithm. Compared to traditional backfitting algorithms, the new procedures can significantly reduce computational costs for fully iterative backfitting. The performance of the proposed algorithms is demonstrated via extensive simulation studies and a real data example. Supplementary materials for this article are available online.