# A Pathwise Coordinate Descent Algorithm for LASSO Penalized Quantile Regression

arXiv: https://arxiv.org/abs/2502.12363 · HTML: https://mlsanity.com/paper/2502.12363/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 5 of its 26 references that are in the map.
- First posted on arXiv 17 Feb 2025.

## Builds on (most cited first, 5 of 5)

- [Smoothed Quantile Regression with Large-Scale Inference](https://mlsanity.com/paper/2012.05187/) (2020)
- [Smoothing quantile regressions](https://mlsanity.com/paper/1905.08535/) (2019)
- [High-Dimensional Quantile Regression: Convolution Smoothing and Concave Regularization](https://mlsanity.com/paper/2109.05640/) (2021)
- [Semismooth Newton Coordinate Descent Algorithm for Elastic-Net Penalized Huber Loss Regression and Quantile Regression](https://mlsanity.com/paper/1509.02957/) (2015)
- [Regularized Estimation of Sparse Spectral Precision Matrices](https://mlsanity.com/paper/2401.11128/) (2024)

## Abstract (arXiv)

ℓ1 penalized quantile regression is used in many fields as an alternative to penalized least squares regressions for high-dimensional data analysis. Existing algorithms for penalized quantile regression either use linear programming, which does not scale well in high dimension, or an approximate coordinate descent (CD) which does not solve for exact coordinatewise minimum of the nonsmooth loss function. Further, neither approaches build fast, pathwise algorithms commonly used in high-dimensional statistics to leverage sparsity structure of the problem in large-scale data sets. To avoid the computational challenges associated with the nonsmooth quantile loss, some recent works have even advocated using smooth approximations to the exact problem. In this work, we develop a fast, pathwise coordinate descent algorithm to compute exact ℓ1 penalized quantile regression estimates for high-dimensional data. We derive an easy-to-compute exact solution for the coordinatewise nonsmooth loss minimization, which, to the best of our knowledge, has not been reported in the literature. We also employ a random perturbation strategy to help the algorithm avoid getting stuck along the regularization path. In simulated data sets, we show that our algorithm runs substantially faster than existing alternatives based on approximate CD and linear program, while retaining the same level of estimation accuracy.