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
Discriminating quantum states: the multiple Chernoff distance
TL;DR: The main ingredient of the proof is a new upper bound for the average error probability, for testing an ensemble of finite-dimensional, but otherwise general, quantum states, which matches the multiple-state generalization of Nussbaum and Szko\l a's lower bound.
Proceedings ArticleDOI
Dynamic deflection routing on arrays (preliminary version)
Andrei Z. Broder,Eli Upfal +1 more
TL;DR: It is proved that on the two dimension torus network the one-bend packet routing algorithm is stable for an arrival rate that is within a constant factor of the hardware bandwidth.
Proceedings ArticleDOI
A randomness-efficient sampler for matrix-valued functions and applications
Avi Wigderson,David Xiao +1 more
TL;DR: In this article, a random walk on an expander approximates the recent Chernoff-like bound for matrix-valued functions of Ahlswede and Winter [2002], in a manner which depends optimally on the spectral gap.
Book ChapterDOI
Probabilistic Robustness Analysis and Design of Uncertain Systems
Roberto Tempo,Fabrizio Dabbene +1 more
TL;DR: How probabilistic robust design can be performed and connections with Learning Theory, showing how the problem structure can be taken into account are explained and current research directions related to sample generation in various sets are outlined.
Journal ArticleDOI
On Clustering Histograms with k-Means by Using Mixed α-Divergences
TL;DR: This paper investigates the use of a parametric family of distortion measures, called the α-divergences, for clustering histograms, and presents a novel extension of k-means clustering to mixed divergences and reports a guaranteed probabilistic bound.
References
More filters