A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
Reads0
Chats0
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
Estimating Local Ancestry in Admixed Populations
TL;DR: A new method, LAMP (Local Ancestry in adMixed Populations), which infers the ancestry of each individual at every single-nucleotide polymorphism (SNP), which is significantly more accurate and more efficient than existing methods for inferring locus-specific ancestries.
Proceedings ArticleDOI
Approximating s-t minimum cuts in Õ(n2) time
TL;DR: A lineartime construction is given that transforms any graph on n vertices into anO(n log n)-edge graph on the same vertices whose cuts have approximately the same value as the original graph’s.
Journal ArticleDOI
Image Segmentation Using Active Contours Driven by the Bhattacharyya Gradient Flow
TL;DR: This paper addresses the problem of image segmentation by means of active contours, whose evolution is driven by the gradient flow derived from an energy functional that is based on the Bhattacharyya distance, and proposes a method for automatically adjusting the smoothness properties of the empirical distributions.
Journal ArticleDOI
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
TL;DR: Fast and simple randomized algorithms for edge coloring a graph in the synchronous distributed point-to-point model of computation and new techniques for proving upper bounds on the tail probabilities of certain random variables which are not stochastically independent are introduced.
Journal ArticleDOI
Computing with Noisy Information
TL;DR: This paper studies the depth of noisy decision trees in which each node gives the wrong answer with some constant probability, giving tight bounds for several problems.
References
More filters