Likelihood-free hypothesis testing
Patrik R\'obert Gerber, Yury Polyanskiy

TL;DR
This paper investigates likelihood-free hypothesis testing, revealing fundamental trade-offs between sample sizes and separation in total variation, enabling testing without full distribution estimation.
Contribution
It establishes a new trade-off between the number of observations and samples needed for likelihood-free hypothesis testing in non-parametric families.
Findings
Identifies a trade-off: nm ≈ n_GoF^2(ε) for non-parametric families.
Shows phase transition behavior in the trade-off for discrete distributions.
Demonstrates testing without full distribution estimation when m ≫ 1/ε^2.
Abstract
Consider the problem of binary hypothesis testing. Given coming from either or , to decide between the two with small probability of error it is sufficient, and in many cases necessary, to have , where measures the separation between and in total variation (). Achieving this, however, requires complete knowledge of the distributions and can be done, for example, using the Neyman-Pearson test. In this paper we consider a variation of the problem which we call likelihood-free hypothesis testing, where access to and is given through i.i.d. observations from each. In the case when and are assumed to belong to a non-parametric family, we demonstrate the existence of a fundamental trade-off between and given by…
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.
Taxonomy
TopicsAdvanced Statistical Process Monitoring · Advanced Statistical Methods and Models
