On Robust Hypothesis Testing with respect to the Hellinger Distance
Not on the map. Why?
Abstract (arXiv)
We study a variant of the simple hypothesis testing problem where observed samples do not necessarily come from either of the specified distributions, but rather from a close variant of them. In this setting, we require a test that is robust to misspecification and identifies which distribution is closer in Hellinger distance. If the underlying distribution is nearly equidistant from both hypotheses, the problem becomes intractable. Our main result is a lower bound on the slack factor, which quantifies how much closer the underlying distribution must be to one hypothesis relative to the other for any test to remain robust. We also demonstrate the implications of this result for testing with respect to symmetric chi-squared distance. Finally, we study an alternative way to specify robustness, where each hypothesis is a Hellinger ball around a fixed distribution. We provide and analyze a test for this composite hypothesis testing problem.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 14 references that are in the map. First posted on arXiv 19 Oct 2025.
Builds on
2 of 14 references.
References · 2
Built on by
Not cited yet.