Data-efficient minimax quickest change detection
By Taposh Banerjee, Venugopal V. Veeravalli. 2012
122 citations recorded by the source corpus.
In [1], a Bayesian two-threshold algorithm was obtained for quickest detection of a change in the distribution of a sequence of random variables, subject to constraints of probability of false alarm and observation cost. This algorithm was shown to be asymptotically optimal and to have good trade-off curves. In this paper, the results in [1] are extended to the more practically relevant minimax setting. Motivated by the structure of the algorithm developed in [1], a CUSUM based algorithm, called DE-CUSUM is proposed, which can be used for on-off observation control and to detect change as quickly as possible subject to a false alarm constraint. It is shown that the DE-CUSUM algorithm inherits the good qualities of the algorithm in [1], i.e., it is also asymptotically optimal and has good trade-off curves. Numerical results show that the DE-CUSUM algorithm provides a substantial savings in the observation cost over the naive approach of fractional sampling.
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Gautam Kamath
- Jonathan Ullman
- Jayadev Acharya
- Mark Bun
- Adam D. Smith
- Clément Louis Canonne
- Thomas Steinke
- Peter Kairouz
Citations in the corpus
- The structure of optimal private tests for simple hypotheses (2018, background): “Change-point detection has a long history in statistics and information theory (e.g. [She31, Pag54, Pag55, Shi63, Lor71, Pol85, Mou86, Pol87, Lai95, Kul01, Mei06, VB14]).”