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
Finite-key analysis for measurement-device-independent quantum key distribution
TL;DR: This work provides a rigorous security proof against general attacks in the finite-key regime by applying large deviation theory, specifically the Chernoff bound, to perform parameter estimation and demonstrates the feasibility of long-distance implementations of measurement-device-independent quantum key distribution within a reasonable time frame of signal transmission.
Journal Article
Tutorial on Practical Prediction Theory for Classification
TL;DR: This tutorial is meant to be a comprehensive compilation of results which are both theoretically rigorous and quantitatively useful and it is shown that train set bounds can sometimes be used to directly motivate learning algorithms.
Proceedings ArticleDOI
Issues in evaluation of stream learning algorithms
TL;DR: This paper proposes a general framework for assessing predictive stream learning algorithms, and defends the use of Predictive Sequential methods for error estimate - the prequential error.
Journal ArticleDOI
The Extremal Function for Complete Minors
TL;DR: Let c(t) be the minimum number c such that every graph G with e(G)?c|G| contracts to a complete graph Kt where ?=0.319... is an explicit constant.
Journal ArticleDOI
Democracy in neural nets: voting schemes for classification
Roberto Battiti,Anna Maria Colla +1 more
TL;DR: This paper found that the use of a small number of nets with a sufficiently large uncorrelation in their mistakes reaches a combined performance that is significantly higher than the best obtainable from the individual nets, with a negligible effort after starting from a pool of networks produced in the development phase of an application.
References
More filters