Robust Decentralized Detection and Social Learning in Tandem Networks

We study a tandem of agents who make decisions about an underlying binary hypothesis, where the distribution of the agent observations under each hypothesis comes from an uncertainty class defined by a 2-alternating capacity. We investigate both decentralized detection rules, where agents collaborate to minimize the error probability of the final agent, and social learning rules, where each agent minimizes its own local minimax error probability. We then extend our results to the infinite tandem network, and derive necessary and sufficient conditions on the uncertainty classes for the minimax error probability to converge to zero when agents know their positions in the tandem. On the other hand, when agents do not know their positions in the network, we study the cases where agents collaborate to minimize the asymptotic minimax error probability, and where agents seek to minimize their worst-case minimax error probability (over all possible positions in the tandem). We show that asymptotic learning of the true hypothesis is no longer possible in these cases, and derive characterizations for the minimax error performance.

[1]  P.K. Varshney,et al.  Optimal Data Fusion in Multiple Sensor Detection Systems , 1986, IEEE Transactions on Aerospace and Electronic Systems.

[2]  Charu C. Aggarwal,et al.  On Credibility Estimation Tradeoffs in Assured Social Sensing , 2013, IEEE Journal on Selected Areas in Communications.

[3]  Edwin K. P. Chong,et al.  This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. 1 Hypothesis Testing in Feedforward Networks with Broadcast Failures , 2022 .

[4]  Drew Fudenberg,et al.  Word-of-mouth learning , 2004, Games Econ. Behav..

[5]  Srikanth V. Krishnamurthy,et al.  Special Section on A World of Wireless, Mobile and Multimedia Networks , 2011, Pervasive Mob. Comput..

[6]  Lones Smith,et al.  Pathological Outcomes of Observational Learning , 2000 .

[7]  P. J. Huber A Robust Version of the Probability Ratio Test , 1965 .

[8]  P.K. Varshney,et al.  Decision fusion rules in multi-hop wireless sensor networks , 2005, IEEE Transactions on Aerospace and Electronic Systems.

[9]  Baik Hoh,et al.  Sell your experiences: a market mechanism based incentive for participatory sensing , 2010, 2010 IEEE International Conference on Pervasive Computing and Communications (PerCom).

[10]  Edwin K. P. Chong,et al.  Error Probability Bounds for Balanced Binary Relay Trees , 2012, IEEE Transactions on Information Theory.

[11]  H. Vincent Poor,et al.  Minimax robust decentralized detection , 1994, IEEE Trans. Inf. Theory.

[12]  T. Cover Hypothesis Testing with Finite Statistics , 1969 .

[13]  Lance Kaplan,et al.  On truth discovery in social sensing: A maximum likelihood estimation approach , 2012, 2012 ACM/IEEE 11th International Conference on Information Processing in Sensor Networks (IPSN).

[14]  Daron Acemoglu,et al.  Bayesian Learning in Social Networks , 2008 .

[15]  Pramod K. Varshney,et al.  Distributed Detection and Data Fusion , 1996 .

[16]  D. Kleinman,et al.  Optimization of detection networks. I. Tandem structures , 1990, 1990 IEEE International Conference on Systems, Man, and Cybernetics Conference Proceedings.

[17]  P. F. Swaszek,et al.  On the performance of serial networks in distributed detection , 1993 .

[18]  Edwin K. P. Chong,et al.  Learning in Hierarchical Social Networks , 2012, IEEE Journal of Selected Topics in Signal Processing.

[19]  Evaggelos Geraniotis,et al.  Robust data fusion for multisensor detection systems , 1990, IEEE Trans. Inf. Theory.

[20]  P. J. Huber,et al.  Minimax Tests and the Neyman-Pearson Lemma for Capacities , 1973 .

[21]  Pramod K. Varshney,et al.  Distributed detection with multiple sensors I. Fundamentals , 1997, Proc. IEEE.

[22]  J. Tsitsiklis Decentralized Detection' , 1993 .

[23]  Ramanarayanan Viswanathan,et al.  Optimal serial distributed decision fusion , 1987, 26th IEEE Conference on Decision and Control.

[24]  Murat Ali Bayir,et al.  Crowd-sourced sensing and collaboration using twitter , 2010, 2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM).

[25]  Edwin K. P. Chong,et al.  Error Probability Bounds for M-ary Relay Trees , 2012, ArXiv.

[26]  S. Bikhchandani,et al.  You have printed the following article : A Theory of Fads , Fashion , Custom , and Cultural Change as Informational Cascades , 2007 .

[27]  M. Athans,et al.  Distributed detection by a large team of sensors in tandem , 1992 .

[28]  Jack Koplowitz,et al.  Necessary and sufficient memory size for m-hypothesis testing , 1975, IEEE Trans. Inf. Theory.

[29]  Moe Z. Win,et al.  On the Subexponential Decay of Detection Error Probabilities in Long Tandems , 2008, IEEE Trans. Inf. Theory.

[30]  S.A. Kassam,et al.  Robust techniques for signal processing: A survey , 1985, Proceedings of the IEEE.

[31]  A. Banerjee,et al.  A Simple Model of Herd Behavior , 1992 .

[32]  John N. Tsitsiklis,et al.  On Learning With Finite Memory , 2012, IEEE Transactions on Information Theory.

[33]  Douglas Gale,et al.  Bayesian learning in social networks , 2003, Games Econ. Behav..

[34]  Wee Peng Tay Whose Opinion to Follow in Multihypothesis Social Learning? A Large Deviations Perspective , 2014, IEEE Journal of Selected Topics in Signal Processing.