mlsanityData to 7 Oct 2026

Smoothed Quantile Regression with Large-Scale Inference

arXiv 2012.05187 ↗First posted 9 Dec 2020math.ST stat.ME stat.THcited by 23

Not on the map. Why?

Abstract (arXiv)

Quantile regression is a powerful tool for learning the relationship between a response variable and a multivariate predictor while exploring heterogeneous effects. In this paper, we consider statistical inference for quantile regression with large-scale data in the "increasing dimension" regime. We provide a comprehensive and in-depth analysis of a convolution-type smoothing approach that achieves adequate approximation to computation and inference for quantile regression. This method, which we refer to as itconquer, turns the non-differentiable quantile loss function into a twice-differentiable, convex and locally strongly convex surrogate, which admits a fast and scalable Barzilai-Borwein gradient-based algorithm to perform optimization, and multiplier bootstrap for statistical inference. Theoretically, we establish explicit non-asymptotic bounds on both estimation and Bahadur-Kiefer linearization errors, from which we show that the asymptotic normality of the conquer estimator holds under a weaker requirement on the number of the regressors than needed for conventional quantile regression. Moreover, we prove the validity of multiplier bootstrap confidence constructions. Our numerical studies confirm the conquer estimator as a practical and reliable approach to large-scale inference for quantile regression. Software implementing the methodology is available in the textttR package textttconquer.

Key facts. Cited by 23 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Dec 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 3; 2023: 2; 2024: 6; 2025: 6; 2026: 4.

23 papers.

Sort:

  1. 2022Statistical Properties of the log-cosh Loss Function Used in Machine Learningcited by 15
  2. 2021Communication-Constrained Distributed Quantile Regression with Optimal Statistical Guaranteescited by 8
  3. 2024Efficient Sparse Least Absolute Deviation Regression with Differential Privacycited by 4
  4. 2023Selective inference using randomized group lasso estimators for general modelscited by 3
  5. 2024Distributed High-Dimensional Quantile Regression: Estimation Efficiency and Support Recoverycited by 2
  6. 2025Federated Learning of Quantile Inference under Local Differential Privacycited by 2
  7. 2025Non-Asymptotic Analysis of Efficiency in Conformalized Regressioncited by 2
  8. 2021Solution to the Non-Monotonicity and Crossing Problems in Quantile Regressioncited by 1
  9. 2023Safe Collaborative Filteringcited by 1
  10. 2024fastkqr: A Fast Algorithm for Kernel Quantile Regressioncited by 1
  11. 2025High-Dimensional Differentially Private Quantile Regression: Distributed Estimation and Statistical Inferencecited by 1
  12. 2022Distributed Estimation and Inference for Semi-parametric Binary Response Modelscited by 0
11 more
  1. 2022High-dimensional Measurement Error Models for Lipschitz Losscited by 0
  2. 2024Private Optimal Inventory Policy Learning for Feature-based Newsvendor with Unknown Demandcited by 0
  3. 2024Fast networked data selection via distributed smoothed quantile estimationcited by 0
  4. 2024Smoothed Robust Phase Retrievalcited by 0
  5. 2025A Pathwise Coordinate Descent Algorithm for LASSO Penalized Quantile Regressioncited by 0
  6. 2025Efficient Distributed Learning over Decentralized Networks with Convoluted Support Vector Machinecited by 0
  7. 2025Inertial Quadratic Majorization Minimization with Application to Kernel Regularized Learningcited by 0
  8. 2026Nonparametric efficient inference for network quantile causal effects under partial interferencecited by 0
  9. 2026ConquerNet: Convolution-Smoothed Quantile ReLU Neural Networks with Minimax Guaranteescited by 0
  10. 2026Byzantine-Robust Distributed Sparse Learning Revisitedcited by 0
  11. 2026Convolution Smoothed Quantile Regression for XGBoostcited by 0