Saddlepoint approximations for plug-in resampling

Clicks: 11
ID: 332524
2026
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Emerging

Ranked #174 of 198 articles by views in jurnal biometrika dan kependudukan

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 198 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
Abstract 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 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 saddlepoint approximations and establish guarantees in a representative setting. In conditional independence testing, we introduce a saddlepoint approximation for the distilled conditional randomization test, 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, our new test closely approximates distilled conditional randomization test p -values and preserves its statistical performance while accelerating computation by up to 250-fold.
Reference Key
openalex_W4400667748 Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Ziang Niu, Zhihan Huang, Jyotishka Ray Choudhury, Eugene Katsevich
Journal jurnal biometrika dan kependudukan
Year 2026
DOI
10.1093/biomet/asag063
URL
https://doi.org/10.1093/biomet/asag063
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.