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
Journal ArticleDOI
On the strong law of large numbers for a class of stochastic processes
Journal ArticleDOI
The probabilistic method yields deterministic parallel algorithms
TL;DR: The general form of the case for which the method of conditional probabilities can be applied in the parallel context is given and the reason why this form does not lend itself to parallelization is discussed.
Journal ArticleDOI
On the hardness of approximating spanners
TL;DR: It is proved that for every fixed k, approximation of the spanner problem is at least as hard as approximating the set-cover problem.
Journal ArticleDOI
On independent sets in hypergraphs
TL;DR: The independence number αH of a hypergraph H is the size of a largest set of vertices containing no edge of H as discussed by the authors, where αH is the independence number of the vertices of H that are contained in at most d edges.
Journal ArticleDOI
Non-fragile output feedback H∞ vehicle suspension control using genetic algorithm
Haiping Du,James Lam,Kam Yim Sze +2 more
TL;DR: The approach is validated by numerical simulation which shows that the designed static output feedback H ∞ controller can achieve good active suspension performance in spite of its simplicity and the non-fragility characteristics over controller gain variations.
References
More filters