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
RACT: Randomized Algorithms Control Toolbox for MATLAB
Andrey Tremba,Giuseppe Carlo Calafiore,Fabrizio Dabbene,Elena Gryazina,Boris T. Polyak,Pavel Shcherbakov,Roberto Tempo +6 more
TL;DR: A new M atlab package, R act, aimed at solving a class of probabilistic analysis and synthesis problems arising in control, which provides a full-featured framework for LMI-formulated Probabilistic synthesis problems, which includes sequential probabilism methods as well as scenario methods for robust design.
Journal ArticleDOI
Probability-of-error bounds for binary transmission on the slowly fading Rician channel
TL;DR: Chernoff bounds and tilted distribution arguments are applied to obtain error probability bounds for binary signaling on the slowly-fading Rician channel with L diversity and it is found that antipodal signals should be used if a > b^{2}(1 + b) , where a is the signal-to-noise ratio of the specular components and b is that of the fading components.
Satellite Conjunction Monte Carlo Analysis
TL;DR: In this paper, a simplified Monte Carlo process is used to assess the satellite collision probability computations of various methods and to obtain a preliminary estimate on their bounds of utility, and two statistical bounding criteria are used to determine the minimum number of cases needed.
Proceedings Article
Error Rate Analysis of Labeling by Crowdsourcing
TL;DR: Finite-sample exponential bounds on the error rate (in probability and in expectation) of hyperplane binary labeling rules for the Dawid-Skene (and Symmetric DawidSkene ) crowdsourcing model are provided.
References
More filters