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
Proceedings ArticleDOI
LinkSCAN*: Overlapping community detection using the link-space transformation
TL;DR: A novel framework of the link-space transformation that transforms a given original graph into a link- space graph, which facilitates overlapping community detection as well as improves the resulting quality, is proposed and the algorithm LinkSCAN that performs structural clustering on the linked graph is developed.
Journal ArticleDOI
Brief Probabilistic solutions to some NP-hard matrix problems
TL;DR: This paper uses standard bounds on empirical probabilities as well as recent results from statistical learning theory on the VC-dimension of families of sets defined by a finite number of polynomial inequalities to show that for each of the above problems, there exists aPolynomial-time randomized algorithm that can provide a yes or no answer to arbitrarily small levels of accuracy and confidence.
Journal ArticleDOI
SBT soft fault diagnosis in analog electronic circuits: a sensitivity-based approach by randomized algorithms
TL;DR: This paper addresses the fault diagnosis issue based on a simulation before test philosophy in analog electronic circuits by proposing a novel method for constructing the fault dictionary under the single faulty component/unit hypothesis.
Journal IssueDOI
Ramsey properties of random discrete structures
TL;DR: The threshold for Rado's theorem for solutions of partition regular systems of equations in random subsets of the integers is determined and the 1-statement of the conjectured threshold for Ramsey's criterion for random hypergraphs is proved.
Journal Article
Concentration inequalities for the missing mass and for histogram rule error
David McAllester,Luis E. Ortiz +1 more
TL;DR: This paper gives distribution-free concentration inequalities for the missing mass and the error rate of histogram rule error and a new class of bounds on the generalization error of decision trees.
References
More filters