Power in Monte Carlo permutation tests is non-monotonic and can decrease with more sampled permutations, with such decreases occurring infinitely often due to distributional discreteness.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Proves an impossibility theorem that no feature attribution ranking can be faithful, stable, and complete under collinearity, characterizes the design space as two families, introduces the DASH ensemble method, and formally verifies all claims in Lean 4.
citing papers explorer
-
More Permutations Do Not Always Increase Power: Non-monotonicity in Monte Carlo Permutation Tests
Power in Monte Carlo permutation tests is non-monotonic and can decrease with more sampled permutations, with such decreases occurring infinitely often due to distributional discreteness.
-
The Attribution Impossibility: No Feature Ranking Is Faithful, Stable, and Complete Under Collinearity
Proves an impossibility theorem that no feature attribution ranking can be faithful, stable, and complete under collinearity, characterizes the design space as two families, introduces the DASH ensemble method, and formally verifies all claims in Lean 4.