Logo image
Back
fastkqr: A Fast Algorithm for Kernel Quantile Regression
Journal article   Peer reviewed

fastkqr: A Fast Algorithm for Kernel Quantile Regression

Qian Tang, Yuwen Gu and Boxiang Wang
Journal of computational and graphical statistics, Vol.35(1), pp.395-405
01/02/2026
DOI: 10.1080/10618600.2025.2541004

View Online

Abstract

Quantile regression is a powerful tool for robust and heterogeneous learning that has seen applications in a diverse range of applied areas. However, its broader application is often hindered by the substantial computational demands arising from the non-smooth quantile loss function. In this paper, we introduce a novel algorithm named fastkqr, which significantly advances the computation of quantile regression in reproducing kernel Hilbert spaces. The core of fastkqr is a finite smoothing algorithm that magically produces exact regression quantiles, rather than approximations. To further accelerate the algorithm, we equip fastkqr with a novel spectral technique that carefully reuses matrix computations. In addition, we extend fastkqr to accommodate a flexible kernel quantile regression with a data-driven crossing penalty, addressing the interpretability challenges of crossing quantile curves at multiple levels. We have implemented fastkqr in a publicly available R package on CRAN. Extensive simulations and real applications show that fastkqr matches the accuracy of state-of-the-art algorithms but can operate up to an order of magnitude faster.
 Finite smoothing algorithm Majorization minimization principle Non-crossing penalty Reproducing kernel Hilbert space

Details

Metrics

5 Record Views
Logo image