Optimal multiple testing under family-wise error control: elementary symmetric polynomials and a scalable algorithm
Prasanjit Dubey, Xiaoming Huo

TL;DR
This paper introduces a scalable algorithm for optimal multiple testing under family-wise error control, leveraging elementary symmetric polynomials to improve power over existing methods.
Contribution
It provides a closed-form algebraic structure for the optimal test computation, enabling a bisection-based algorithm with guaranteed convergence for exchangeable hypotheses.
Findings
Power gain over Hommel's method increases with K, from 15% at K=3 to 84% at K=12.
The algorithm guarantees unique solutions and efficient convergence.
Applications demonstrate improved power in practical scenarios.
Abstract
Simultaneously testing hypotheses while controlling the family-wise error rate is a fundamental problem in statistics. Existing procedures (Bonferroni, Holm, Hochberg, Hommel) provide valid control but sacrifice power, increasingly so as grows, because they base decisions on marginal -value ranks rather than the joint likelihood. Rosset et al. (2022) formulated the most powerful family-wise-error-rate-controlling test as a dual program and proved the existence of an optimal dual vector , but left its computation as an open problem. We solve this problem for exchangeable hypotheses. The key insight is that the family-wise error rate constraint coefficients admit closed-form expressions through elementary symmetric polynomials of the likelihood-ratio values . This algebraic structure implies a global monotonicity theorem:…
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.
