Metraipolis › archive › dc_a61a67d19740

The Lambert Penalty: Logarithmic Shrinkage for Sparse Regression — arXiv:2610.09627

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.09627
License (as archived)
CC0-1.0
Archived
2026-10-08T12:40:05.876Z
SHA-256 of the archived text
1f4bbef2b104ddc410fe0766d8ea9b98ee2a09f67e9ec3360bda1a3bef60be1a
Stable URL of this page
https://metraipolis.com/documento/dc_a61a67d19740

How to cite

The Lambert Penalty: Logarithmic Shrinkage for Sparse Regression — arXiv:2610.09627 — arXiv (en), https://arxiv.org/abs/2610.09627 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a61a67d19740 (Metraipolis archive dc_a61a67d19740, sha256 1f4bbef2b104ddc410fe0766d8ea9b98ee2a09f67e9ec3360bda1a3bef60be1a)
BibTeX
@misc{dca61a67d19740,
  title = {The Lambert Penalty: Logarithmic Shrinkage for Sparse Regression — arXiv:2610.09627},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.09627},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a61a67d19740; sha256 1f4bbef2b104ddc410fe0766d8ea9b98ee2a09f67e9ec3360bda1a3bef60be1a},
  year = {2026}
}

Archived text

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

Sparse regression must balance prediction accuracy with reproducible variable selection. We introduce the Lambert penalty by limiting how quickly the retained fraction of a scalar score increases after variable entry. Maximizing retention under this scale-equivariant constraint yields a logarithmic transition from exact zero to an identity tail. The bounded penalty has a fixed shape and a single penalty parameter selected by training-only five-fold cross-validation. We derive an explicit scalar update, a sharp weak-convexity bound, a sufficient condition for multivariate uniqueness, and conditional convergence of exact cyclic coordinate descent. For fixed dimension, global minimizers are uniformly equivalent to the oracle estimator over an asymptotic tuning band. Gaussian simulations compare Lambert with LASSO, ridge, elastic net, MCP, and SCAD. Lambert favors prediction for strong equal signals and usually improves support recovery over SCAD; MCP often gives better support recovery, and convex methods remain competitive with weak signals or strong correlation. In a QSAR toxicity application, repeated nested cross-validation gives competitive prediction with compact, stable models, although error differences from MCP and SCAD are small. The empirical design followed exploratory development; independent confirmation remains necessary.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ME, nuovi lavori del giorno).
Categorie arXiv: Methodology (stat.ME).
Pagina del lavoro: https://arxiv.org/abs/2610.09627 — 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-08T12:15:15.323Z dalla pagina https://arxiv.org/list/stat.ME/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).