{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T14:00:34Z","timestamp":1762005634371,"version":"build-2065373602"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T00:00:00Z","timestamp":1527724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001446","name":"Economic Development Board, Singapore","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001446","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Singapore Ministry of Education Academic Research Fund Tier 2","award":["MOE2014-T2-1-028"],"award-info":[{"award-number":["MOE2014-T2-1-028"]}]},{"name":"NTU-NXP Intelligent Transport System Test-Bed Living Lab Fund","award":["S15-1105-RF-LLF"],"award-info":[{"award-number":["S15-1105-RF-LLF"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2018,5,31]]},"abstract":"<jats:p>We propose a non-Bayesian social learning update rule for agents in a network, which minimizes the sum of the Kullback-Leibler divergence between the true distribution generating the agents\u2019 local observations and the agents\u2019 beliefs (parameterized by a hypothesis set), and a weighted varentropy-related term. The varentropy-related term allows us to control the rate of convergence of our update rule, which also reuses some of the most recent observations of each agent to speed up convergence. Under mild technical conditions, we show that the belief of each agent concentrates on the optimal hypothesis set, and we derive a bound for the convergence rate. Furthermore, to overcome the performance degradation due to misinforming agents, who use a corrupted likelihood functions in their belief updates, we propose to use multiple social networks that update their beliefs independently and a convex combination mechanism among the beliefs of all the networks. Simulations with applications to location identification and group recommendation demonstrate that our proposed methods offer improvements over two other current state-of-the art non-Bayesian social learning algorithms.<\/jats:p>","DOI":"10.1145\/3199513","type":"journal-article","created":{"date-parts":[[2018,6,4]],"date-time":"2018-06-04T13:41:34Z","timestamp":1528119694000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Non-Bayesian Social Learning with Observation Reuse and Soft Switching"],"prefix":"10.1145","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0357-8356","authenticated-orcid":false,"given":"MD. Zulfiquar Ali","family":"Bhotto","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wee Peng","family":"Tay","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1093\/restud\/rdr004"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2535239"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176343654"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the American Control Conference. 634--641","author":"Bandyopadhyay Saptarshi","year":"2014","unstructured":"Saptarshi Bandyopadhyay and Soon-Jo Chung . 2014 . Distributed estimation using Bayesian concensus filtering . In Proceedings of the American Control Conference. 634--641 . Saptarshi Bandyopadhyay and Soon-Jo Chung. 2014. Distributed estimation using Bayesian concensus filtering. In Proceedings of the American Control Conference. 634--641."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.86996"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2170980"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2236831"},{"volume-title":"Proceedings of the IEEE International Conference on Communication. IEEE","key":"e_1_2_1_9_1","unstructured":"Md. Zulfiquar Ali Bhotto and Wee Peng Tay. May 2017. Non-Bayesian social learning using observation reuse and soft switching . In Proceedings of the IEEE International Conference on Communication. IEEE , Los Alamitos, CA. Md. Zulfiquar Ali Bhotto and Wee Peng Tay. May 2017. Non-Bayesian social learning using observation reuse and soft switching. In Proceedings of the IEEE International Conference on Communication. IEEE, Los Alamitos, CA."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1208770"},{"key":"e_1_2_1_11_1","first-page":"1","article-title":"Non-Bayesian learning","volume":"10","author":"Epstein L. G.","year":"2010","unstructured":"L. G. Epstein , J. Noor , and A. Sandroni . 2010 . Non-Bayesian learning . BE J. Theor. Econ. 10 , 1, 1 -- 20 . L. G. Epstein, J. Noor, and A. Sandroni. 2010. Non-Bayesian learning. BE J. Theor. Econ. 10, 1, 1--20.","journal-title":"BE J. Theor. Econ."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2725905"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2604278"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2448525"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2012.06.001"},{"key":"e_1_2_1_16_1","first-page":"1","article-title":"Information heterogeneity and the speed of learning in social networks","volume":"13","author":"Jadbabaie Ali","year":"2013","unstructured":"Ali Jadbabaie , Pooya Molavi , and Alireza Tahbaz-Salehi . 2013 . Information heterogeneity and the speed of learning in social networks . Columb. Bus. School Res. Pap. 13 , 28, 1 -- 38 . Ali Jadbabaie, Pooya Molavi, and Alireza Tahbaz-Salehi. 2013. Information heterogeneity and the speed of learning in social networks. Columb. Bus. School Res. Pap. 13, 28, 1--38.","journal-title":"Columb. Bus. School Res. Pap."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130412"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10726-016-9505-7"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11424-014-1195-0"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2364096"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2031203"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2690401"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0149-x"},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"K. Ozeki and T. Umeda. 1984. An adaptive filtering algorithm using an orthogonal projection to an affine subspace and its properties. Electron. Commun. Jpn. 67-A 19--27.  K. Ozeki and T. Umeda. 1984. An adaptive filtering algorithm using an orthogonal projection to an affine subspace and its properties. Electron. Commun. Jpn. 67-A 19--27.","DOI":"10.1002\/ecja.4400670503"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the IEEE Conference Decision and Control. IEEE","author":"Rad Kamiar Rahnama","year":"2010","unstructured":"Kamiar Rahnama Rad and Alireza Tahbaz-Salehi . 2010 . Distributed parameter estimation in networks . In Proceedings of the IEEE Conference Decision and Control. IEEE , Los Alamitos, CA, 5050--5055. Kamiar Rahnama Rad and Alireza Tahbaz-Salehi. 2010. Distributed parameter estimation in networks. In Proceedings of the IEEE Conference Decision and Control. IEEE, Los Alamitos, CA, 5050--5055."},{"key":"e_1_2_1_27_1","first-page":"222","article-title":"Social learning over weakly-connected graphs","volume":"3","author":"Salami Hawraa","year":"2017","unstructured":"Hawraa Salami , Bicheng Ying , and Ali H. Sayed . 2017 . Social learning over weakly-connected graphs . IEEE Trans. Sign. Inf. Process. Netw. 3 , 2, 222 -- 238 . Hawraa Salami, Bicheng Ying, and Ali H. Sayed. 2017. Social learning over weakly-connected graphs. IEEE Trans. Sign. Inf. Process. Netw. 3, 2, 222--238.","journal-title":"IEEE Trans. Sign. Inf. Process. Netw."},{"volume-title":"Fundamentals of Adaptive Filtering","author":"Sayed Ali H.","key":"e_1_2_1_28_1","unstructured":"Ali H. Sayed . 2003. Fundamentals of Adaptive Filtering . Wiley . Ali H. Sayed. 2003. Fundamentals of Adaptive Filtering. Wiley."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6760868"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447059"},{"key":"e_1_2_1_31_1","unstructured":"V. Strassen. 2009. Asymptotic Estimates in Shannon\u2019s Information Theory. Retrieved from https:\/\/www.math.cornell.edu\/&sim;pmlut\/strassen.pdf.  V. Strassen. 2009. Asymptotic Estimates in Shannon\u2019s Information Theory. Retrieved from https:\/\/www.math.cornell.edu\/&sim;pmlut\/strassen.pdf."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5626\/JCSE.2013.7.2.99"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2014.2365757"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2726088"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2013.2245859"},{"volume-title":"Proceedings of the Asilomar Conference on Signals, Systems, and Computers. IEEE","author":"Zhao Xiaochuan","key":"e_1_2_1_36_1","unstructured":"Xiaochuan Zhao and Ali H. Sayed . 2012. Learning over social networks via diffussion adaptation . In Proceedings of the Asilomar Conference on Signals, Systems, and Computers. IEEE , Los Alamitos, CA, 709--713. Xiaochuan Zhao and Ali H. Sayed. 2012. Learning over social networks via diffussion adaptation. In Proceedings of the Asilomar Conference on Signals, Systems, and Computers. IEEE, Los Alamitos, CA, 709--713."}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3199513","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3199513","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:17Z","timestamp":1750273637000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3199513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,31]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,5,31]]}},"alternative-id":["10.1145\/3199513"],"URL":"https:\/\/doi.org\/10.1145\/3199513","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"type":"print","value":"1550-4859"},{"type":"electronic","value":"1550-4867"}],"subject":[],"published":{"date-parts":[[2018,5,31]]},"assertion":[{"value":"2017-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}