Robust Hypothesis Testing with a Relative Entropy Tolerance
Information Theory
2016-11-18 v2 math.IT
Abstract
This paper considers the design of a minimax test for two hypotheses where the actual probability densities of the observations are located in neighborhoods obtained by placing a bound on the relative entropy between actual and nominal densities. The minimax problem admits a saddle point which is characterized. The robust test applies a nonlinear transformation which flattens the nominal likelihood ratio in the vicinity of one. Results are illustrated by considering the transmission of binary data in the presence of additive noise.
Keywords
Cite
@article{arxiv.0707.2926,
title = {Robust Hypothesis Testing with a Relative Entropy Tolerance},
author = {Bernard C. Levy},
journal= {arXiv preprint arXiv:0707.2926},
year = {2016}
}
Comments
14 pages, 5 figures, submitted to the IEEE Transactions on Information Theory, July 2007, revised April 2008