Power of masking methods for adaptive testing in a multivariate normal means problem
Abhinav Chakraborty, Junu Lee, Eugene Katsevich

TL;DR
This paper compares the power of different masking methods in adaptive multivariate normal means testing, providing asymptotic expressions and practical insights into their efficiency and optimal configurations.
Contribution
It develops a unified asymptotic power framework for three masking methods and identifies conditions under which augmentation approaches outperform sample splitting.
Findings
Augmentation method is more powerful than splitting with matched tuning.
Optimal null sample size is a vanishing fraction of total tests, approaching in-sample benchmark.
Optimal null samples scale as the square root of the number of tests, with empirical support.
Abstract
Many large-scale testing procedures learn signal structure from the data to boost power. Direct data reuse can inflate Type-I error ("double dipping"), so a common remedy is masking: withholding some information during learning and using it for testing. Sample splitting masks by withholding observations for testing, while null augmentation (e.g., knockoffs or full-conformal outlier detection) masks by appending null samples or variables and withholding their identities until testing. In many settings, little is known about how the power of masking methods compares across mechanisms, across tuning choices, or against more data-efficient non-masking alternatives. We study these questions in a stylized two-groups multivariate normal means model with an unknown signal direction learned from the data. Within this testbed, we develop a transparent, unified set of asymptotic power expressions…
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.
