Skip to content
DraconiticResearch
Search Sources API
197,787 studies31 sourcesUpdated 42 min ago
PreprintarXiv licencearXiv

A Unified Coordinate Descent Framework for Penalized Longitudinal Log-Contrast Quantile Regression

Abstract

Quantile regression characterizes heterogeneous covariate effects across the response distribution, but its extension to high-dimensional longitudinal compositional data poses substantial challenges, such as the nonsmooth check loss, the unit-sum structure of compositional covariates. Existing work is confined to Lasso penalization, and does not readily extend to nonconvex penalties. We propose CDaLCqr, a unified coordinate descent algorithm for penalized longitudinal log-contrast quantile regression accommodating popular penalties, such as adaptive Lasso, smoothly clipped absolute deviation (SCAD), and minimax concave penalty (MCP) within a single framework. The proposed method uses a Huber-type smooth approximation of the check loss and enforces the zero-sum constraint through an augmented Lagrangian formulation. CDaLCqr combines coordinate descent with majorization-minimization, yielding explicit updates through coordinate-wise quadratic surrogates. We show that the stopping tolerance controls errors in the zero-sum constraint and stationarity conditions. Under suitable conditions and sufficiently close initialization, we also prove local convergence of the coefficient and multiplier iterates, with an error bound decreasing by a fixed factor less than one each iteration. Simulations highlight the estimation advantages of SCAD and MCP variants and their sparse model identification. An application to Chinese provincial industrial data identifies interpretable, quantile-specific associations between sectoral composition and regional economic output.

Related

  1. A penalized logistic generalized regression estimator
    Grayson W. White, Kelly S. McConville, Cooper S. Schumacher
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Penalized Cause-Specific Hazard Regression under Competing Risks: An Elastic Net Approach Using SANAD Trial Data
    Avinash Kumar
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  3. Fast Computation of Nested Cross-Validation for Penalized Regression
    Shuyang Cao, Alex Stringer
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  4. Linking COPD Prevalence with Income Distribution: A Spatial Heterogeneous Compositional Regression via Geographically Weighted Penalized Approach
    Jingwen Deng, Shujie Ma, Sergio J. Rey +1
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Shrinkage invalidates the Hosmer-Lemeshow test: goodness of fit for penalized logistic regression, with an application to glaucoma diagnosis
    Ebrahim Khaled Ebrahim
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@misc{du2026unified,
  title = {{A Unified Coordinate Descent Framework for Penalized Longitudinal Log-Contrast Quantile Regression}},
  author = {Changwei Du and Linhui Li and Huijuan Ma and Qi Zheng},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.07379},
  eprint = {2611.07379},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.07379},
}
RIS
TY  - UNPB
TI  - A Unified Coordinate Descent Framework for Penalized Longitudinal Log-Contrast Quantile Regression
AU  - Changwei Du
AU  - Linhui Li
AU  - Huijuan Ma
AU  - Qi Zheng
PY  - 2026
DA  - 2026/11/05
PB  - arXiv
DO  - 10.48550/arxiv.2611.07379
UR  - https://arxiv.org/abs/2611.07379
AB  - Quantile regression characterizes heterogeneous covariate effects across the response distribution, but its extension to high-dimensional longitudinal compositional data poses substantial challenges, such as the nonsmooth check loss, the unit-sum structure of compositional covariates. Existing work is confined to Lasso penalization, and does not readily extend to nonconvex penalties. We propose CDaLCqr, a unified coordinate descent algorithm for penalized longitudinal log-contrast quantile regression accommodating popular penalties, such as adaptive Lasso, smoothly clipped absolute deviation (SCAD), and minimax concave penalty (MCP) within a single framework. The proposed method uses a Huber-type smooth approximation of the check loss and enforces the zero-sum constraint through an augmented Lagrangian formulation. CDaLCqr combines coordinate descent with majorization-minimization, yielding explicit updates through coordinate-wise quadratic surrogates. We show that the stopping tolerance controls errors in the zero-sum constraint and stationarity conditions. Under suitable conditions and sufficiently close initialization, we also prove local convergence of the coefficient and multiplier iterates, with an error bound decreasing by a fixed factor less than one each iteration. Simulations highlight the estimation advantages of SCAD and MCP variants and their sparse model identification. An application to Chinese provincial industrial data identifies interpretable, quantile-specific associations between sectoral composition and regional economic output.
ER  -