Paperlane

no. 10 · Friday 6 November 2026

Decentralized Sparse Quantile Regression

Changxin Yang, Jianwei Shi and Zhongyi Zhu

math.ST · v2

Abstract

Distributed statistical learning has recently attracted significant attention owing to its computational efficiency and scalability in large-scale systems. However, the non-smooth quantile loss poses substantial challenges to the development of efficient decentralized algorithms for quantile regression. Existing methods may either suffer from slow convergence or rely on smoothing-based approximations that require additional stringent assumptions, particularly in high-dimensional settings. To address these issues, we propose a decentralized framework that integrates gradient tracking with iterative hard thresholding for sparse quantile estimation. The proposed method avoids smoothing approximations and relaxes the initialization requirement. Theoretically, we show that the proposed algorithm achieves linear convergence under stated regularity conditions and that the resulting estimator attains the same order of statistical accuracy as its centralized counterpart. We further develop a decentralized information criterion for selecting the working sparsity level and establish support screening guarantees. Numerical experiments and a real-data study illustrate the finite-sample performance of the proposed method.

comments
There is a gap in the proof of the appendix section
fields
Statistics Theory
pdf ↗ page arXiv:2611.04612 ↗