Testing the variety hypothesis
Given a probability measure on the unit disk, we study the problem of deciding whether, for some threshold probability, this measure is supported near a real algebraic variety of given dimension and bounded degree. We call this "testing the variety hypothesis". We prove an upper bound on the so-called "sample complexity" of this problem and show how it can be reduced to a semialgebraic decision problem. This is done by studying in a quantitative way the Hausdorff geometry of the space of real algebraic varieties of a given dimension and degree.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
PAPRIKA: Private Online False Discovery Rate Control
In hypothesis testing, a false discovery occurs when a hypothesis is incorrectly rejected due to noise in the sample. When adaptively testing multiple hypotheses, the probability of a false discovery increases as more te…
Two-sample testingPrivate independence testing across two parties
We introduce $\pi$-test, a privacy-preserving algorithm for testing statistical independence between data distributed across multiple parties. Our algorithm relies on privately estimating the distance correlation between…
Privacy PreservingVocal Bursts Valence PredictionA Sampling-based Framework for Hypothesis Testing on Large Attributed Graphs
Hypothesis testing is a statistical method used to draw conclusions about populations from sample data, typically represented in tables. With the prevalence of graph representations in real-life applications, hypothesis …
Graph SamplingStatistical Limits for Testing Correlation of Hypergraphs
In this paper, we consider the hypothesis testing of correlation between two $m$-uniform hypergraphs on $n$ unlabelled nodes. Under the null hypothesis, the hypergraphs are independent, while under the alternative hypoth…
The Sample Complexity of Distributed Simple Binary Hypothesis Testing under Information Constraints
This paper resolves two open problems from a recent paper, arXiv:2403.16981, concerning the sample complexity of distributed simple binary hypothesis testing under information constraints. The first open problem asks whe…