A competitive Neyman-Pearson approach to universal hypothesis testing with applications

  • Authors:
  • E. Levitan;N. Merhav

  • Affiliations:
  • Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

Abstract

The problem of hypothesis testing for parametric information sources whose parameters are not explicitly known is considered. A new, modified version of the Neyman-Pearson criterion of optimality, where the uniform constraint on exponential rate of the false-alarm probability is replaced by one that depends on unknown values of the parameters, is proposed. An optimal universal decision rule, based on Kullback-Leibler divergence, is developed and shown to be efficient in the sense of achieving exponential decay of both misdetection and false-alarm probabilities for all values of unknown parameters, whenever such an efficient decision rule exists at all. Furthermore, necessary and sufficient conditions for the existence of such efficient universal tests are established and the best universally achievable error exponents are presented. Finally, the proposed approach is applied to several important problems in signal processing and communications and compared to the generalized likelihood ratio test (LRT).