Least favorable distributions for robust quickest change detection

  • Authors:

  • Jayakrishnan Unnikrishnan;Venugopal V. Veeravalli;Sean Meyn

  • Affiliations:

  • Department of Electrical and Computer Engineering, and Coordinated Science Laboratory, University of Illinois at Urbana-Champaign;Department of Electrical and Computer Engineering, and Coordinated Science Laboratory, University of Illinois at Urbana-Champaign;Department of Electrical and Computer Engineering, and Coordinated Science Laboratory, University of Illinois at Urbana-Champaign

  • Venue:
  • ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the problem of robust quickest change detection where the pre-change and post-change distributions are not known exactly but belong to known uncertainty classes of distributions. Both Bayesian and minimax versions of the quickest change detection problem are considered. When the uncertainty classes satisfy some specific conditions, we identify least favorable distributions (LFD's) from the uncertainty classes, and show that the detection rule designed for the LFD's is optimal in a minimax sense. The condition is similar to that required for the existence of LFD's for the robust hypothesis testing problem studied by Huber.