Metraipolis › archive › dc_001fc0973371

Scalable Variable Selection under Predictor Dependence with Adaptive Virtual Dummies — arXiv:2609.31257

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.31257
License (as archived)
CC0-1.0
Archived
2026-10-08T02:50:05.312Z
SHA-256 of the archived text
d8a10b0acf182d35c36e18821f8a1800e78d27fc7b28d2e8a076da010c2f8bee
Stable URL of this page
https://metraipolis.com/documento/dc_001fc0973371

How to cite

Scalable Variable Selection under Predictor Dependence with Adaptive Virtual Dummies — arXiv:2609.31257 — arXiv (en), https://arxiv.org/abs/2609.31257 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_001fc0973371 (Metraipolis archive dc_001fc0973371, sha256 d8a10b0acf182d35c36e18821f8a1800e78d27fc7b28d2e8a076da010c2f8bee)
BibTeX
@misc{dc001fc0973371,
  title = {Scalable Variable Selection under Predictor Dependence with Adaptive Virtual Dummies — arXiv:2609.31257},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.31257},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_001fc0973371; sha256 d8a10b0acf182d35c36e18821f8a1800e78d27fc7b28d2e8a076da010c2f8bee},
  year = {2026}
}

Archived text

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

Reliable high-dimensional variable selection requires scalable error-controlling methods. The Terminating-Random Experiments (T-Rex) selector estimates the false discovery rate (FDR) by aggregating early-terminated forward-selection paths in which predictors compete with synthetic dummies. We address two remaining challenges: i) predictor dependence can bias dummy-predictor competition; ii) computation is wasted on recomputing terms shared across experiments. Building on memory-efficient virtual dummies, which sequentially sample projections from their exact conditional law, we estimate the conditional Gaussian law of inactive predictors and map draws onto the remaining sphere radius. A shared lazy Gram cache computes the response product and each requested Gram column once across experiments. Simulations across three covariance structures show that uniform spherical dummies can exceed the target FDR, whereas the proposed method empirically controls FDR. Caching yields more than a sixfold speedup, and the method remains feasible with 100000 predictors, where competing FDR-controlling methods become computationally impractical.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-28 in stat.ME).
Categorie arXiv: Signal Processing (eess.SP) ; Methodology (stat.ME).
Pagina del lavoro: https://arxiv.org/abs/2609.31257 — 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-08T02:13:17.844Z dalla pagina https://arxiv.org/catchup/stat.ME/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).