Skip to main content

Robust Hypothesis Testing with Multiple Distances

  • Chapter
  • First Online:
Robust and Distributed Hypothesis Testing

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 414))

  • 973 Accesses

Abstract

As mentioned in the previous chapter, a minimax robust test can be designed based on a suitable choice of a distance between probability measures, which is most likely decided for, depending on the application. Instead of searching for a distance and performing a tedious design procedure, it is probably most convenient to choose a simple parameter, which accounts for the distance. In this way, the designer has the flexibility to choose both the degree of robustness as well as the type of the distance with only setting a few parameters.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Notes

  1. 1.

    Notice that \(\alpha \)-divergence is preferred against the Rényi’s \(\alpha \)-divergence because Rényi’s \(\alpha \)-divergence is convex only for \(\alpha \in [0,1]\) [CiA10, p. 1540].

  2. 2.

    In general \(\mathrm {arg}\sup \) may not always be achieved since \(\mathscr {G}_0\) and \(\mathscr {G}_1\) are non-compact sets in the topologies induced by the \(\alpha \)-divergence distance. In this book, existence of \(\hat{g}_0\) and \(\hat{g}_1\) is due to the KKT solution of the minimax optimization problem, which is introduced in Sect. 4.3.3.

References

  1. D. Bertsekas, A. Nedić, and A. Ozdaglar, Convex Analysis and Optimization, ser. Athena Scientific optimization and computation series.   Athena Scientific, 2003.

    MATH  Google Scholar 

  2. A. Cichocki and S. ichi Amari, “Families of alpha- beta- and gamma- divergences: Flexible and robust measures of similarities,” Entropy, vol. 12, no. 6, pp. 1532–1568, 2010.

    Google Scholar 

  3. A. G. Dabak and D. H. Johnson, “Geometrically based robust detection,” in Proceedings of the Conference on Information Sciences and Systems, Johns Hopkins University, Baltimore, MD, May 1994, pp. 73–77.

    Google Scholar 

  4. G. Gül and A. M. Zoubir, “Robust hypothesis testing with composite distances,” in Proc. IEEE Workshop on Statistical Signal Processing, Gold Coast, Australia, June 2014, pp. 432–435.

    Google Scholar 

  5. G. Gül and A. M. Zoubir, “Robust hypothesis testing with squared Hellinger distance,” in Proc. 22nd European Signal Processing Conference (EUSIPCO), Lisbon, Portugal, September 2014, pp. 1083–1087.

    Google Scholar 

  6. P. J. Huber, “A robust version of the probability ratio test,” Ann. Math. Statist., vol. 36, pp. 1753–1758, 1965.

    Article  MathSciNet  MATH  Google Scholar 

  7. P. J. Huber, “Robust confidence limits,” Z. Wahrcheinlichkeitstheorie verw. Gebiete, vol. 10, pp. 269–278, 1968.

    Google Scholar 

  8. B. C. Levy, Principles of Signal Detection and Parameter Estimation, 1st ed.   Springer Publishing Company, Incorporated, 2008.

    Book  Google Scholar 

  9. B. C. Levy, “Robust hypothesis testing with a relative entropy tolerance,” IEEE Transactions on Information Theory, vol. 55, no. 1, pp. 413–421, 2009.

    Article  MathSciNet  MATH  Google Scholar 

  10. Q. Zhao and B. M. Sadler, “A survey of dynamic spectrum access,” IEEE Signal Processing Magazine, vol. 24, no. 3, pp. 79–89, May 2007.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gökhan Gül .

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Gül, G. (2017). Robust Hypothesis Testing with Multiple Distances. In: Robust and Distributed Hypothesis Testing. Lecture Notes in Electrical Engineering, vol 414. Springer, Cham. https://doi.org/10.1007/978-3-319-49286-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49286-5_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49285-8

  • Online ISBN: 978-3-319-49286-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics