Metraipolis › archive › dc_e141e0607946

Distributed Selective Inference for Quantile Regression — arXiv:2608.13311

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.13311
License (as archived)
CC0-1.0
Archived
2026-10-19T04:45:19.710Z
SHA-256 of the archived text
e975dd3a87f84f8fc6e42cc85948579aa10e7ad68e29cc346e52249e78eaff18
Stable URL of this page
https://metraipolis.com/documento/dc_e141e0607946

How to cite

Distributed Selective Inference for Quantile Regression — arXiv:2608.13311 — arXiv (en), https://arxiv.org/abs/2608.13311 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e141e0607946 (Metraipolis archive dc_e141e0607946, sha256 e975dd3a87f84f8fc6e42cc85948579aa10e7ad68e29cc346e52249e78eaff18)
BibTeX
@misc{dce141e0607946,
  title = {Distributed Selective Inference for Quantile Regression — arXiv:2608.13311},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.13311},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e141e0607946; sha256 e975dd3a87f84f8fc6e42cc85948579aa10e7ad68e29cc346e52249e78eaff18},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.13311. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We propose a distributed selective inference framework tailored for high-dimensional quantile regression. To enable valid post-selection inference in this context, we address the computational challenge posed by the non-smooth quantile loss via a response-surrogation strategy. This strategy transforms the problem into a penalized least-squares formulation, thereby facilitating distributed selective inference. For valid post-selection inference, a randomized procedure is introduced, in which the Lasso selection event is characterized through the associated Karush-Kuhn-Tucker conditions and the conditional distribution of the aggregated estimator is derived given the selection event. The resulting algorithm requires only three rounds of communication between local machines and the central server. Under standard regularity conditions, we establish the asymptotic validity of the proposed procedure and develop a large-deviation approximation to the selective likelihood for computationally tractable implementation. Simulation studies and a real-data application demonstrate the satisfactory finite-sample performance of the proposed method.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-14 in stat.ME).
Categorie arXiv: Methodology (stat.ME) ; Applications (stat.AP).
Pagina del lavoro: https://arxiv.org/abs/2608.13311 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T04:26:22.349Z dalla pagina https://arxiv.org/catchup/stat.ME/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).