A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
TLDR
In this paper, it was shown that the likelihood ratio test for fixed sample size can be reduced to this form, and that for large samples, a sample of size $n$ with the first test will give about the same probabilities of error as a sample with the second test.Abstract:
In many cases an optimum or computationally convenient test of a simple hypothesis $H_0$ against a simple alternative $H_1$ may be given in the following form. Reject $H_0$ if $S_n = \sum^n_{j=1} X_j \leqq k,$ where $X_1, X_2, \cdots, X_n$ are $n$ independent observations of a chance variable $X$ whose distribution depends on the true hypothesis and where $k$ is some appropriate number. In particular the likelihood ratio test for fixed sample size can be reduced to this form. It is shown that with each test of the above form there is associated an index $\rho$. If $\rho_1$ and $\rho_2$ are the indices corresponding to two alternative tests $e = \log \rho_1/\log \rho_2$ measures the relative efficiency of these tests in the following sense. For large samples, a sample of size $n$ with the first test will give about the same probabilities of error as a sample of size $en$ with the second test. To obtain the above result, use is made of the fact that $P(S_n \leqq na)$ behaves roughly like $m^n$ where $m$ is the minimum value assumed by the moment generating function of $X - a$. It is shown that if $H_0$ and $H_1$ specify probability distributions of $X$ which are very close to each other, one may approximate $\rho$ by assuming that $X$ is normally distributed.read more
Citations
More filters
Posted Content
Mining Frequent Itemsets over Uncertain Databases
TL;DR: In this paper, the authors provide baseline implementations of eight representative algorithms and test their performances with uniform measures fairly, according to the fair tests over many different benchmark data sets and discuss some new findings.
Journal ArticleDOI
Expected computation time for Hamiltonian path problem
Yuri Gurevich,Saharon Shelah +1 more
TL;DR: In this paper, the authors consider the problem of finding an algorithm that is fact on average with respect to a natural probability distribution on inputs and consider the Hamilto problem from that point of view.
Journal ArticleDOI
Point Selections and Weak ε-Nets for Convex Hulls
TL;DR: In this paper, the authors show that there exists a weak e-net of size at most 7/e such that every convex set containing at least e|X| elements of X intersects F.
Journal ArticleDOI
What size test set gives good error rate estimates
TL;DR: This work addresses the problem of determining what size test set guarantees statistically significant results in a character recognition task, as a function of the expected error rate, by providing a statistical analysis showing that if, for example, the expected character error rate is around 1 percent, then, with a test set of at least 10,000 statistically independent handwritten characters, that is guaranteed.
Journal ArticleDOI
Property Testing: A Learning Theory Perspective
TL;DR: This survey takes the learning-theory point of view and focuses on results for testing properties of functions that are of interest to the learning theory community, and covers results forTesting algebraic properties of function such as linearity, testing properties defined by concise representations, such as having a small DNF representation, and more.
References
More filters