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
Black-box recognition of finite simple groups of Lie type by statistics of element orders
TL;DR: In this article, the standard name of a black-box group G is computed by a Monte Carlo algorithm, and the running time is polynomial in the input length and in the time requirement for the group operations in G.
Journal ArticleDOI
Chernoff-Type Direct Product Theorems
TL;DR: The first proof that parallel repetition with thresholds improves the security of challenge-response protocols is given, with a very general result about an attacker’s ability to solve a large fraction of many independent instances of a hard problem.
Posted Content
Bridging AIC and BIC: a new criterion for autoregression
TL;DR: To address order selection for an autoregressive model fitted to time series data, a new information criterion is proposed that adaptively achieves either consistency or efficiency depending on the underlying true model.
Journal ArticleDOI
Research paper: The saga of minimum spanning trees
TL;DR: This article surveys the many facets of the Minimum Spanning Tree problem and follows the history of the problem since the first polynomial-time solution by Bor@?uvka to the modern algorithms by Chazelle, Pettie and Ramachandran.
Journal ArticleDOI
Bridging the gap between theory and practice of approximate Bayesian inference
Johan Kwisthout,Iris van Rooij +1 more
TL;DR: In this article, three candidate notions of "approximation" are discussed, each of which has been suggested in the cognitive science literature, and the authors sketch how parameterized computational complexity analyses can yield model variants that are tractable and which can serve as the basis of computationally plausible models of cognition.
References
More filters