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
Families of Alpha- Beta- and Gamma- Divergences: Flexible and Robust Measures of Similarities
Andrzej Cichocki,Shun-ichi Amari +1 more
TL;DR: It is shown that a new wide class of Gamma-divergences can be generated not only from the family of Beta-diversgences but also from a family of Alpha-d divergences.
Journal ArticleDOI
Random walks in a convex body and an improved volume algorithm
László Lovász,Miklós Simonovits +1 more
TL;DR: A randomized algorithm using O(n7 log’ n) separation calls to approximate the volume of a convex body with a fixed relative error is given and the mixing rate of Markov chains from finite to arbitrary Markov Chains is analyzed.
Statistical Signal Processing
TL;DR: An understanding of the convergence and synchronization of statistical signal processing algorithms in continuous time is developed, and an understanding of linear and nonlinear circuits for analog memory is explored, and the “soft-multiplexer” is proposed.
Journal ArticleDOI
Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications
TL;DR: This work considers the sample average approximation (SAA) approach and discusses the convergence properties of the resulting problem, and presents a method for constructing statistical lower bounds for the optimal value of the considered problem.
Journal ArticleDOI
Discriminating States: the quantum Chernoff bound.
Kmr Audenaert,John Calsamiglia,Ramon Muñoz-Tapia,Emilio Bagan,Ll. Masanes,Antonio Acín,Frank Verstraete +6 more
TL;DR: The problem of discriminating two different quantum states in the setting of asymptotically many copies is considered, and the minimal probability of error is determined, leading to the identification of the quantum Chernoff bound, thereby solving a long-standing open problem.
References
More filters