Pair-switching rerandomization
Ke Zhu, Hanzhong Liu

TL;DR
This paper introduces a pair-switching rerandomization method that efficiently generates balanced treatment assignments, maintaining statistical validity while significantly reducing computational time compared to classical rerandomization.
Contribution
The authors propose a novel pair-switching rerandomization technique that improves computational efficiency and maintains statistical properties, applicable to various experimental designs.
Findings
Achieves unbiased and variance-reduced estimators.
Fisher randomization tests remain valid under the new method.
Runs 3-23 times faster than classical rerandomization in simulations.
Abstract
Rerandomization discards assignments with covariates unbalanced in the treatment and control groups to improve estimation and inference efficiency. However, the acceptance-rejection sampling method used in rerandomization is computationally inefficient. As a result, it is time-consuming for rerandomization to draw numerous independent assignments, which are necessary for performing Fisher randomization tests and constructing randomization-based confidence intervals. To address this problem, we propose a pair-switching rerandomization method to draw balanced assignments efficiently. We obtain the unbiasedness and variance reduction of the difference-in-means estimator and show that the Fisher randomization tests are valid under pair-switching rerandomization. Moreover, we propose an exact approach to invert Fisher randomization tests to confidence intervals, which is faster than the…
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 in Clinical Trials · Advanced Causal Inference Techniques · Statistical Methods and Inference
