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
Joint Online Coflow Routing and Scheduling in Data Center Networks
Haisheng Tan,Shaofeng H.-C. Jiang,Yupeng Li,Xiang-Yang Li,Chenzi Zhang,Zhenhua Han,Francis C. M. Lau +6 more
TL;DR: This paper derives an online multiple coflow routing and scheduling algorithm, called OMCoflow, which is the first online algorithm with theoretical performance guarantees which considers routing and Scheduling simultaneously for multi-coflows.
Journal ArticleDOI
Measurement-device-independent quantum key distribution for nonstandalone networks
Guan-Jie Fan-Yuan,Feng-Yu Lu,Shuang Wang,Zhen-Qiang Yin,De-Yong He,Zheng Zhou,Jun Teng,Wei Chen,Guang-Can Guo,Zheng-Fu Han +9 more
TL;DR: In this article, the authors propose an evolutionary selection for existing phase-encoding BB84 networks to support quantum key distribution (QKD) in untrusted node networks, which is a crucial step on the roadmap of the quantum Internet.
Proceedings ArticleDOI
Meet and merge: approximation algorithms for confluent flows
TL;DR: It is NP-hard to approximate the congestion of the optimal confluent flow for general networks to within a factor of 4/3, and a lower bound on the gap between confluent and splittable flows is established.
Book ChapterDOI
Adaptive sensing for sparse recovery.
Jarvis Haupt,Robert Nowak +1 more
TL;DR: This chapter investigates the advantages of sequential samplingschemes that adapt to x using information gathered throughout the sampling process, and distinguishes between adaptive and non-adaptive measurement, as follows.
Journal ArticleDOI
A minimax framework for classification with applications to images and high dimensional data
TL;DR: A minimax framework for multiclass classification, applicable to general data including, in particular, imagery and other types of high-dimensional data, which often outperforms the state-of-the-art classification methods such as the support vector machine in accuracy.
References
More filters