Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

CORR

2011

Springer

2011

Springer

— We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k ≥ 2, we assume that the leaves have access to independent and identically distributed noisy observations of the ‘state of the world’ s. Starting with the leaves, each node makes a decision in a ﬁnite alphabet M, that it sends to its parent in the tree. Finally, the root decides between the two possible states of the world based on the information it receives. We prove that the error probability vanishes only subexponentially in the number of available observations, under quite general hypotheses. More precisely the case of binary messages, decay is subexponential for any decision rule. For general (ﬁnite) message alphabet M, decay is subexponential for ‘nodeoblivious’ decision rules, that satisfy a mild irreducibility condition. In the latter case, we propose a family of decision rules with close-to-optim...

Added |
13 May 2011 |

Updated |
13 May 2011 |

Type |
Journal |

Year |
2011 |

Where |
CORR |

Authors |
Yashodhan Kanoria, Andrea Montanari |

Comments (0)