%0 Journal Article %1 kim2020minimax %A Kim, Ilmun %A Balakrishnan, Sivaraman %A Wasserman, Larry %D 2020 %K game-theory hypothesis-testing readings stats theory %T Minimax optimality of permutation tests %U http://arxiv.org/abs/2003.13208 %X Permutation tests are widely used in statistics, providing a finite-sample guarantee on the type I error rate whenever the distribution of the samples under the null hypothesis is invariant to some rearrangement. Despite its increasing popularity and empirical success, theoretical properties of the permutation test, especially its power, have not been fully explored beyond simple cases. In this paper, we attempt to fill this gap by presenting a general non-asymptotic framework for analyzing the power of the permutation test. The utility of our proposed framework is illustrated in the context of two-sample and independence testing under both discrete and continuous settings. In each setting, we introduce permutation tests based on U-statistics and study their minimax performance. We also develop exponential concentration bounds for permuted U-statistics based on a novel coupling idea, which may be of independent interest. Building on these exponential bounds, we introduce permutation tests which are adaptive to unknown smoothness parameters without losing much power. The proposed framework is further illustrated using more sophisticated test statistics including weighted U-statistics for multinomial testing and Gaussian kernel-based statistics for density testing. Finally, we provide some simulation results that further justify the permutation approach.

@article{kim2020minimax, abstract = {Permutation tests are widely used in statistics, providing a finite-sample guarantee on the type I error rate whenever the distribution of the samples under the null hypothesis is invariant to some rearrangement. Despite its increasing popularity and empirical success, theoretical properties of the permutation test, especially its power, have not been fully explored beyond simple cases. In this paper, we attempt to fill this gap by presenting a general non-asymptotic framework for analyzing the power of the permutation test. The utility of our proposed framework is illustrated in the context of two-sample and independence testing under both discrete and continuous settings. In each setting, we introduce permutation tests based on U-statistics and study their minimax performance. We also develop exponential concentration bounds for permuted U-statistics based on a novel coupling idea, which may be of independent interest. Building on these exponential bounds, we introduce permutation tests which are adaptive to unknown smoothness parameters without losing much power. The proposed framework is further illustrated using more sophisticated test statistics including weighted U-statistics for multinomial testing and Gaussian kernel-based statistics for density testing. Finally, we provide some simulation results that further justify the permutation approach.}, added-at = {2020-04-01T18:55:35.000+0200}, author = {Kim, Ilmun and Balakrishnan, Sivaraman and Wasserman, Larry}, biburl = {https://www.bibsonomy.org/bibtex/2a71446a9b2df4b53dec35ecc3201ad95/kirk86}, description = {[2003.13208] Minimax optimality of permutation tests}, interhash = {5ec346dc724a39bb899f83de513f13e0}, intrahash = {a71446a9b2df4b53dec35ecc3201ad95}, keywords = {game-theory hypothesis-testing readings stats theory}, note = {cite arxiv:2003.13208}, timestamp = {2020-04-01T18:55:35.000+0200}, title = {Minimax optimality of permutation tests}, url = {http://arxiv.org/abs/2003.13208}, year = 2020 }