Pith. sign in

Sequential Monte-Carlo testing by betting

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

In a Monte-Carlo test, the observed dataset is fixed, and several resampled or permuted versions of the dataset are generated in order to test a null hypothesis that the original dataset is exchangeable with the resampled/permuted ones. Sequential Monte-Carlo tests aim to save computational resources by generating these additional datasets sequentially one by one, and potentially stopping early. While earlier tests yield valid inference at a particular prespecified stopping rule, our work develops a new anytime-valid Monte-Carlo test that can be continuously monitored, yielding a p-value or e-value at any stopping time possibly not specified in advance. It generalizes the well-known method by Besag and Clifford, allowing it to stop at any time, but also encompasses new sequential Monte-Carlo tests that tend to stop sooner under the null and alternative without compromising power. The core technical advance is the development of new test martingales (nonnegative martingales with initial value one) for testing exchangeability against a very particular alternative. These test martingales are constructed using new and simple betting strategies that smartly bet on whether a generated test statistic is greater or smaller than the observed one. The betting strategies are guided by the derivation of a simple log-optimal betting strategy, have closed form expressions for the wealth process, provable guarantees on resampling risk, and display excellent power in practice.

citation-role summary

background 1

citation-polarity summary

fields

math.ST 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

Cheap Permutation Testing

math.ST · 2025-02-11 · conditional · novelty 6.0

Binning data and permuting bin labels preserves exactness and minimax power of U/V-statistic permutation tests while reducing permutation cost to B s^2 operations.

citing papers explorer

Showing 1 of 1 citing paper.

  • Cheap Permutation Testing math.ST · 2025-02-11 · conditional · none · ref 18 · internal anchor

    Binning data and permuting bin labels preserves exactness and minimax power of U/V-statistic permutation tests while reducing permutation cost to B s^2 operations.