Metraipolis › archive › dc_bd9a4b68ab87

Saddlepoint approximations for plug-in resampling — arXiv:2407.08911

Source
arXiv (en)
Original
https://arxiv.org/abs/2407.08911
License (as archived)
CC0-1.0
Archived
2026-10-16T00:37:27.723Z
SHA-256 of the archived text
7860dbe9279ce383230504c73ae0979be79408b3d51de7d2ab78ce777e131a8f
Stable URL of this page
https://metraipolis.com/documento/dc_bd9a4b68ab87

How to cite

Saddlepoint approximations for plug-in resampling — arXiv:2407.08911 — arXiv (en), https://arxiv.org/abs/2407.08911 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bd9a4b68ab87 (Metraipolis archive dc_bd9a4b68ab87, sha256 7860dbe9279ce383230504c73ae0979be79408b3d51de7d2ab78ce777e131a8f)
BibTeX
@misc{dcbd9a4b68ab87,
  title = {Saddlepoint approximations for plug-in resampling — arXiv:2407.08911},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2407.08911},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bd9a4b68ab87; sha256 7860dbe9279ce383230504c73ae0979be79408b3d51de7d2ab78ce777e131a8f},
  year = {2026}
}

Archived text

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

Resampling-based procedures can improve on normal approximations in sparse, large-scale testing problems, but their computational cost can be prohibitive. We recognize that several existing procedures belong to a faster plug-in resampling subclass, fixing fitted nuisance parameters during resampling. When the resampled statistic is a sum of conditionally independent terms, the saddlepoint approximation (SPA) for the resampling $p$-value offers further acceleration, replacing resampling with an analytical tail approximation. However, standard Edgeworth-based approximation-error bounds impose regularity conditions that are hard to verify for plug-in resampling laws. We use an alternative approach to establish a finite-sample relative-error bound for the Lugannani-Rice approximation under more tractable conditions, which we apply in two contexts. In statistical genetics, we identify response resampling procedures as the targets of existing SPAs and establish guarantees in a representative setting. In conditional independence testing, we introduce spaCRT, an SPA for the distilled conditional randomization test (dCRT), which has been applied successfully in biology. Our rates quantify the effects of sparsity and signal strength, with matching lower bounds in special cases. We additionally establish asymptotic Type-I error control of the corresponding plug-in resampling procedures under growing sparsity. In simulations and single-cell CRISPR data analysis, spaCRT closely approximates dCRT $p$-values and preserves its statistical performance while accelerating computation by up to 250-fold.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-15 in stat.AP).
Categorie arXiv: Methodology (stat.ME) ; Statistics Theory (math.ST); Applications (stat.AP).
Pagina del lavoro: https://arxiv.org/abs/2407.08911 — 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-16T00:16:17.956Z dalla pagina https://arxiv.org/catchup/stat.AP/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).