Inference with Sequential Monte-Carlo Computation of $p$-values: Fast and Valid Approaches
Ivo V. Stoepker, Rui M. Castro

TL;DR
This paper reviews adaptive Monte-Carlo methods for hypothesis testing, introduces a new sequential approach for estimating $p$-values with validity guarantees, and offers practical recommendations for practitioners.
Contribution
It presents a novel sequential methodology for estimating $p$-values with validity guarantees, bridging gaps in existing approaches and improving practical applicability.
Findings
Proposes a sequential $p$-value estimation method with validity guarantees.
Highlights limitations of fixed-sample Monte-Carlo tests.
Provides practical guidelines for practitioners.
Abstract
Hypothesis tests calibrated by (re)sampling methods (such as permutation, rank and bootstrap tests) are useful tools for statistical analysis, at the computational cost of requiring Monte-Carlo sampling for calibration. It is common and almost universal practice to execute such tests with predetermined and large number of Monte-Carlo samples, and disregard any randomness from this sampling at the time of drawing and reporting inference. At best, this approach leads to computational inefficiency, and at worst to invalid inference. That being said, a number of approaches in the literature have been proposed to adaptively guide analysts in choosing the number of Monte-Carlo samples, by sequentially deciding when to stop collecting samples and draw inference. These works introduce varying competing notions of what constitutes "valid" inference, complicating the landscape for analysts…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference
