Robust hypothesis testing and distribution estimation in Hellinger distance
Not on the map. Why?
Abstract (arXiv)
We propose a simple robust hypothesis test that has the same sample complexity as that of the optimal Neyman-Pearson test up to constants, but robust to distribution perturbations under Hellinger distance. We discuss the applicability of such a robust test for estimating distributions in Hellinger distance. We empirically demonstrate the power of the test on canonical distributions.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 3 Nov 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1; 2026: 1.
3 papers.
- 2022Communication-constrained hypothesis testing: Optimality, robustness, and reverse data processing inequalitiescited by 11
- 2025On Robust Hypothesis Testing with respect to the Hellinger Distancecited by 0
- 2026Density estimation for Hellinger via minimum-distance estimators: mixtures of Gaussians, log-concave, and morecited by 0
- 2026Density estimation for Hellinger via minimum-distance estimators: mixtures of Gaussians, log-concave, and more9 Jun 2026
- 2025On Robust Hypothesis Testing with respect to the Hellinger Distance19 Oct 2025
- 2022Communication-constrained hypothesis testing: Optimality, robustness, and reverse data processing inequalities6 Jun 2022