Metraipolis › archive › dc_1988feadf92f
ParaDeAl: Parallel Descent Algorithms for Sparse Statistics — arXiv:2611.03529
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03529
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:42:38.983Z
- SHA-256 of the archived text
57ec062bae67553d21de4b951544d20fa697d0380137ca7ff12c5d4992180444- Stable URL of this page
https://metraipolis.com/documento/dc_1988feadf92f
How to cite
ParaDeAl: Parallel Descent Algorithms for Sparse Statistics — arXiv:2611.03529 — arXiv (en), https://arxiv.org/abs/2611.03529 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1988feadf92f (Metraipolis archive dc_1988feadf92f, sha256 57ec062bae67553d21de4b951544d20fa697d0380137ca7ff12c5d4992180444)
BibTeX
@misc{dc1988feadf92f,
title = {ParaDeAl: Parallel Descent Algorithms for Sparse Statistics — arXiv:2611.03529},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03529},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1988feadf92f; sha256 57ec062bae67553d21de4b951544d20fa697d0380137ca7ff12c5d4992180444},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03529. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Best subset selection is a central problem in statistical regression, drawing increasing attention from the broader optimization and machine learning communities. Solving the hard L0 sparsity constraint directly has been computationally challenging; as a result, most existing work proposes formulations which do not enforce the constraint, but instead use a mix of L0/L1/L2 penalties to encourage sparsity. Modern methods for solving such penalized formulations are tractable for p = 100,000, but give up direct control over sparsity. In this paper, we propose a two-stage proximal gradient descent-based approach which both enforces the sparsity constraint and incorporates L1/L2 penalties, leveraging GPUs for computational acceleration to find approximate solutions. Our method, ParaDeAl, offers the user the ability to select the problem hyperparameters, solves all configurations in parallel, and obtains solutions up to 15x faster than the best state-of-the-art CPU competitors while achieving almost identical test accuracy for the same support size for large (p > 100,000) synthetic and real-world datasets. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ML, nuovi lavori del giorno). Categorie arXiv: Optimization and Control (math.OC) ; Machine Learning (stat.ML). Pagina del lavoro: https://arxiv.org/abs/2611.03529 — 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-11-03T18:13:37.706Z dalla pagina https://arxiv.org/list/stat.ML/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).