On the Sub-Exponential Decay of Detection Error Probabilities in Long Tandems
Lists
Only you see this
Abstract
We consider the problem of decentralized binary hypothesis testing in a network of sensors arranged in a tandem. We show that the rate of error probability decay is always sub-exponential, establishing the validity of a long-standing conjecture. Under the additional assumption of bounded Kullback-Leibler divergences, we show that for all d > 1/2, the error probability is Omega(e <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-cnd</sup> ), where c is a positive constant. Furthermore, the bound Omega(e <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-c(logn)d</sup> ), for all d > 1, holds under an additional mild condition on the distributions. This latter bound is shown to be tight.
BibTeX
@inproceedings{tay2007sub,
author = {Wee-Peng Tay and John N. Tsitsiklis and Moe Z. Win},
title = {{On the Sub-Exponential Decay of Detection Error Probabilities in Long Tandems}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2007},
doi = {10.1109/icassp.2007.366366},
}Loading related content...