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
Non-blind watermarking of network flows
TL;DR: This work proposes the first non-blind approach for flow watermarking, called RAINBOW, that improves watermark invisibility by inserting delays hundreds of times smaller than previous blind watermarks, hence reduces the watermark interference on network flows.
Journal ArticleDOI
On coupon colorings of graphs
TL;DR: In this paper, it was shown that every d -regular graph G has χ c (G ) ≥ ( 1 − o ( 1 ) ) d / log d as d → ∞, and the proportion of d-regular graphs G for which χc ( G ) ≤ ( 1 + o (1 ) )d/ log d tends to 1.
Journal ArticleDOI
Jointly optimal rate control and relay selection for cooperative wireless video streaming
TL;DR: An uncoordinated, distributed, and localized low-complexity algorithm is designed, for which it is shown that cooperative relaying allows nodes to save energy without leading to a perceivable decrease in video quality and to achieve performance comparable in practice to the optimal solution.
Posted Content
Quantum Stein's lemma revisited, inequalities for quantum entropies, and a concavity theorem of Lieb
TL;DR: Joint convexity of the quantum relative entropy is proven, resulting in a self-contained elementary version of Tropp's approach to Lieb's concavity theorem, according to which the map tr(exp(h+log a)) is concave in a on positive operators for self-adjoint h.
Journal ArticleDOI
On the Chernoff bound for efficiency of quantum hypothesis testing
TL;DR: In this article, the authors estimate the Chernoff rate for the efficiency of quantum hypothesis testing for both joint and separate measurements, and approximate bounds for the rate are given if both states are mixed, and exact expressions are derived if at least one of the states is pure.
References
More filters