In this work, we study non-parametric hypothesis testing problem with distribution function constraints. The empirical likelihood ratio test has been widely used in testing problems with moment (in)equality constraints. However, some detection problems cannot be described using moment (in)equalities. We propose a distribution function constraint along with an empirical likelihood ratio test. This detector is applicable to a wide variety of robust parametric non-parametric detection problems. Since the distribution function constraints provide a more exact description of the null hypothesis, the test outperforms the empirical likelihood ratio test with moment constraints as well as many popular goodness-of-fit tests, such as the robust Kolmogorov-Smirnov test and the Cramer-von Mises test. Examples from communication systems with real-world noise samples are provided to show their performance. Specifically, the proposed test significantly outperforms the robust Kolmogorov-Smirnov test and the Cramer-von Mises test when the null hypothesis is nested in the alternative hypothesis. The same example is repeated when we assume no noise uncertainty. By doing so, we are able to claim that in our case, it is necessary to include uncertainty in noise distribution. Additionally, the asymptotic optimality of the proposed test is provided.
The problem under study in the paper covers a wide range of applications. Several studies in the literature are closely related to this work. As previously discussed, Huber's robust detection problem can be treated as a special case of our problem. In @cite_2 , Huber's test features a clipped version of the likelihood ratio test between the nominal densities that delivers performance which minimizes the worst-case probability of false alarm and miss. However, the clipped test has limited application since it requires parametric model for the nominal probability distributions. In @cite_22 , the author provides a framework of the robust likelihood ratio test when the uncertainty region is described by the Kullback-Leibler divergence. In the parametric case, this problem is also known as the composite hypothesis testing problem [p. 169] levy2008principles . In this case, the generalized likelihood ratio test (GLRT) has optimal error performance when the probability distributions under all the hypotheses are in the same exponential family, c.f. [p. 204] levy2008principles , @cite_18 . Again, this test requires complete parametric description of the probability distributions.
@cite_18 @cite_22 @cite_2
2127904409 2169357279 2944465737 2962796373
The generalized likelihood ratio test (GLRT), which is commonly used in composite hypothesis testing problems, is investigated. Conditions for asymptotic optimality of the GLRT in the Neyman-Pearson sense are studied and discussed. First, a general necessary and sufficient condition is established, and then based on this, a sufficient condition, which is easier to verify, is derived. A counterexample where the GLRT is not optimal, is provided as well. A conjecture is stated concerning the optimality of the GLRT for the class of finite-state sources. > We consider the change-point detection problem of deciding, based on noisy measurements, whether an unknown signal over a given graph is constant or is instead piecewise constant over two connected induced subgraphs of relatively low cut size. We analyze the corresponding generalized likelihood ratio (GLR) statistics and relate it to the problem of finding a sparsest cut in a graph. We develop a tractable relaxation of the GLR statistic based on the combinatorial Laplacian of the graph, which we call the spectral scan statistic, and analyze its properties. We show how its performance as a testing procedure depends directly on the spectrum of the graph, and use this result to explicitly derive its asymptotic properties on few significant graph topologies. Finally, we demonstrate both theoretically and by simulations that the spectral scan statistic can outperform naive testing procedures based on edge thresholding and @math testing. In this paper, we study sequential testing problems with overlapping hypotheses. We first focus on the simple problem of assessing if the mean µ of a Gaussian distribution is @math , both answers are considered to be correct. Then, we consider PAC-best arm identification in a bandit model: given K probability distributions on R with means @math , we derive the asymptotic complexity of identifying, with risk at most @math , an index @math such that @math . We provide non asymptotic bounds on the error of a parallel General Likelihood Ratio Test, which can also be used for more general testing problems. We further propose lower bound on the number of observation needed to identify a correct hypothesis. Those lower bounds rely on information-theoretic arguments, and specifically on two versions of a change of measure lemma (a high-level form, and a low-level form) whose relative merits are discussed. We consider the change-point detection problem of deciding, based on noisy measurements, whether an unknown signal over a given graph is constant or is instead piecewise constant over two induced subgraphs of relatively low cut size. We analyze the corresponding generalized likelihood ratio (GLR) statistic and relate it to the problem of nding a sparsest cut in a graph. We develop a tractable relaxation of the GLR statistic based on the combinatorial Laplacian of the graph, which we call the spectral scan statistic, and analyze its properties. We show how its performance as a testing procedure depends directly on the spectrum of the graph, and use this result to explicitly derive its asymptotic properties on few graph topologies. Finally, we demonstrate both theoretically and by simulations that the spectral scan statistic can outperform naive testing procedures based on edge thresholding and 2 testing.