Social Opinion Formation and Decision Making Under Communication Trends (2203.02466v3)
Abstract: This work studies the learning process over social networks under partial and random information sharing. In traditional social learning models, agents exchange full belief information with each other while trying to infer the true state of nature. We study the case where agents share information about only one hypothesis, namely, the trending topic, which can be randomly changing at every iteration. We show that agents can learn the true hypothesis even if they do not discuss it, at rates comparable to traditional social learning. We also show that using one's own belief as a prior for estimating the neighbors' non-transmitted beliefs might create opinion clusters that prevent learning with full confidence. This phenomenon occurs when a single hypothesis corresponding to the truth is exchanged exclusively during all times. Such a practice, however, avoids the complete rejection of the truth under any information exchange procedure -- something that could happen if priors were uniform.
- C. P. Chamley, Rational Herds: Economic Models of Social Learning, Cambridge University Press, 2003.
- P. M. Djurić and Y. Wang, “Distributed Bayesian learning in multiagent systems: Improving our understanding of its capabilities and limitations,” IEEE Signal Processing Magazine, vol. 29, no. 2, pp. 65–76, 2012.
- “Models for the diffusion of beliefs in social networks: An overview,” IEEE Signal Processing Magazine, vol. 30, no. 3, pp. 16–29, 2013.
- V. Krishnamurthy and H. V. Poor, “Social learning and Bayesian games in multiagent signal processing: how do local and global decision makers interact?,” IEEE Signal Processing Magazine, vol. 30, no. 3, pp. 43–57, 2013.
- E. Mossel and O. Tamuz, “Opinion exchange dynamics,” Probability Surveys, vol. 14, pp. 155–204, 2017.
- “Learning from heterogeneous data based on social interactions over graphs,” IEEE Transactions on Information Theory, vol. 69, no. 5, pp. 3347–3371, 2023.
- “Non-Bayesian social learning,” Games and Economic Behavior, vol. 76, no. 1, pp. 210–225, 2012.
- X. Zhao and A. H. Sayed, “Learning over social networks via diffusion adaptation,” in Proc. Asilomar Conference on Signals, Systems and Computers, 2012, pp. 709–713.
- “Fast convergence rates for distributed non-Bayesian learning,” IEEE Transactions on Automatic Control, vol. 62, no. 11, pp. 5538–5553, 2017.
- “Social learning and distributed hypothesis testing,” IEEE Transactions on Information Theory, vol. 64, no. 9, pp. 6161–6179, 2018.
- “Non-Bayesian social learning on random digraphs with aperiodically varying network connectivity,” IEEE Transactions on Control of Network Systems, vol. 9, no. 3, pp. 1202–1214, 2022.
- “Bayesian learning in social networks,” The Review of Economic Studies, vol. 78, no. 4, pp. 1201–1236, 2011.
- “Bayesian decision making in groups is hard,” Operations Research, vol. 69, no. 2, pp. 632–654, 2021.
- H. A. Simon, “Bounded rationality,” in Utility and Probability, pp. 15–18. 1990.
- J. Conlisk, “Why bounded rationality?,” Journal of Economic Literature, vol. 34, no. 2, pp. 669–700, 1996.
- M. H. DeGroot, “Reaching a consensus,” Journal of the American Statistical Association, vol. 69, no. 345, pp. 118–121, 1974.
- A. H. Sayed, “Adaptation, learning, and optimization over networks,” Foundations and Trends in Machine Learning, vol. 7, no. 4-5, pp. 311–801, July 2014.
- “Partial information sharing over social learning networks,” IEEE Transactions on Information Theory, vol. 69, no. 3, pp. 2033–2058, 2023.
- “Social learning with sparse belief samples,” in Proc. IEEE CDC, 2020, pp. 1792–1797.
- “Event-triggered distributed inference,” in Proc. IEEE CDC, 2020, pp. 6228–6233.
- “Hypothesis assignment and partial likelihood averaging for cooperative estimation,” in Proc. IEEE CDC, 2019, pp. 7850–7856.
- “Social learning under randomized collaborations,” in Proc. IEEE ISIT, 2022, pp. 115–120.
- “Communication-efficient distributed cooperative learning with compressed beliefs,” IEEE Transactions on Control of Network Systems, vol. 9, no. 3, pp. 1215–1226, 2022.
- “Distributed inference with sparse and quantized communication,” IEEE Transactions on Signal Processing, vol. 69, pp. 3906–3921, 2021.
- “Memory-aware social learning under partial information sharing,” IEEE Transactions on Signal Processing, vol. 71, pp. 2833–2848, 2023.
- “Opinion fluctuations and disagreement in social networks,” Mathematics of Operations Research, vol. 38, no. 1, pp. 1–27, 2013.
- “Binary opinion dynamics with stubborn agents,” ACM Trans. Econ. Comput., vol. 1, no. 4, pp. 1–30, 2013.
- S. D. Lena, “Non-Bayesian social learning and the spread of misinformation in networks,” Working Papers 2019:09, Department of Economics, University of Venice Ca’ Foscari, 2019, available at SSRN: https://ssrn.com/abstract=3355245.
- D. Vial and V. Subramanian, “Local non-Bayesian social learning with stubborn agents,” IEEE Transactions on Control of Network Systems, vol. 9, no. 3, pp. 1178–1188, 2022.
- “Adaptive social learning,” IEEE Transactions on Information Theory, vol. 67, no. 9, pp. 6053–6081, 2021.
- “Distributed Bayesian learning of dynamic states,” arXiv:2212.02565, Dec. 2022.
- “On Krause’s multi-agent consensus model with state-dependent connectivity,” IEEE Transactions on Automatic Control, vol. 54, no. 11, pp. 2586–2597, 2009.
- “A model of online misinformation,” Working Paper 28884, National Bureau of Economic Research, June 2021.
- A. Nedic and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,” IEEE Transactions on Automatic Control, vol. 54, no. 1, pp. 48–61, 2009.
- A. H. Sayed, “Adaptive networks,” Proc. IEEE, vol. 102, no. 4, pp. 460–497, 2014.
- “Gossip algorithms for distributed signal processing,” Proc. IEEE, vol. 98, no. 11, pp. 1847–1864, 2010.
- A. H. Sayed, Inference and Learning from Data, Cambridge University Press, 2022, 3 vols.
- “Asynchronous decentralized optimization in heterogeneous systems,” in Proc. IEEE CDC, 2014, pp. 1125–1130.
- X. Zhao and A. H. Sayed, “Asynchronous adaptation and learning over networks—part i: Modeling and stability analysis,” IEEE Transactions on Signal Processing, vol. 63, no. 4, pp. 811–826, 2015.
- X. Zhao and A. H. Sayed, “Asynchronous adaptation and learning over networks—part ii: Performance analysis,” IEEE Transactions on Signal Processing, vol. 63, no. 4, pp. 827–842, 2015.
- X. Zhao and A. H. Sayed, “Asynchronous adaptation and learning over networks—part iii: Comparison analysis,” IEEE Transactions on Signal Processing, vol. 63, no. 4, pp. 843–858, 2015.
- “Asynchronous decentralized parallel stochastic gradient descent,” in Proc. International Conference on Machine Learning, 10–15 Jul 2018, vol. 80 of Proceedings of Machine Learning Research, pp. 3043–3052.
- “Asynchronous saddle point algorithm for stochastic optimization in heterogeneous networks,” IEEE Transactions on Signal Processing, vol. 67, no. 7, pp. 1742–1757, 2019.
- X. Cao and T. Başar, “Decentralized multi-agent stochastic optimization with pairwise constraints and quantized communications,” IEEE Transactions on Signal Processing, vol. 68, pp. 3296–3311, 2020.
- “Quantization of distributed data for learning,” IEEE Journal on Selected Areas in Information Theory, vol. 2, no. 3, pp. 987–1001, 2021.
- M. Ghassemi and A. D. Sarwate, “Distributed proportional stochastic coordinate descent with social sampling,” in Proc. Annual Allerton Conference on Communication, Control, and Computing, 2015, pp. 17–24.
- “Coordinate-descent diffusion learning by networked agents,” IEEE Transactions on Signal Processing, vol. 66, no. 2, pp. 352–367, 2017.
- “Performance of social machine learning under limited data,” in Proc. IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Rhodes Island, Greece, 2023, pp. 1–5.
- “Optimal distributed stochastic mirror descent for strongly convex optimization,” Automatica, vol. 90, pp. 196–203, 2018.
- “A tutorial on distributed (non-Bayesian) learning: Problem, algorithms and results,” in Proc. IEEE CDC, 2016, pp. 6795–6801.
- “Fusion of probability density functions,” Proc. IEEE, vol. 110, no. 4, pp. 404–453, 2022.
- “Second-order statistics analysis and comparison between arithmetic and geometric average fusion: Application to multi-sensor target tracking,” Information Fusion, vol. 51, pp. 233–243, 2019.
- “On the arithmetic and geometric fusion of beliefs for distributed inference,” IEEE Transactions on Automatic Control, pp. 1–16, 2023.
- “Nonasymptotic concentration rates in cooperative learning—part ii: Inference on compact hypothesis sets,” IEEE Transactions on Control of Network Systems, vol. 9, no. 3, pp. 1141–1153, 2022.
- “Distributed parameter estimation in sensor networks: Nonlinear observation models and imperfect communication,” IEEE Transactions on Information Theory, vol. 58, no. 6, pp. 3575–3605, 2012.
- K. Dedecius and P. M. Djurić, “Sequential estimation and diffusion of information over networks: A Bayesian approach with exponential family of distributions,” IEEE Transactions on Signal Processing, vol. 65, no. 7, pp. 1795–1809, 2017.
- Matrix Analysis, Cambridge University Press, 2012.
- D. Williams, Probability with Martingales, Cambridge University Press, 1991.
- E. Cesàro, “Sur la convergence des séries,” Nouvelles Annales de Mathématiques: Journal des Candidats aux Écoles Polytechnique et Normale, vol. 7, pp. 49–59, 1888.
- Mert Kayaalp (15 papers)
- Virginia Bordignon (19 papers)
- Ali H. Sayed (151 papers)