Social Learning in Community Structured Graphs (2312.12186v4)
Abstract: Traditional social learning frameworks consider environments with a homogeneous state, where each agent receives observations conditioned on that true state of nature. In this work, we relax this assumption and study the distributed hypothesis testing problem in a heterogeneous environment, where each agent can receive observations conditioned on their own personalized state of nature (or truth). We particularly focus on community structured networks, where each community admits their own true hypothesis. This scenario is common in various contexts, such as when sensors are spatially distributed, or when individuals in a social network have differing views or opinions. We show that the adaptive social learning strategy is a preferred choice for nonstationary environments, and allows each cluster to discover its own truth.
- V. Shumovskaia, M. Kayaalp, and A. H. Sayed, “Distributed decision-making for community structured networks,” Proc. IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 1–5, April 2024.
- A. Jadbabaie, P. Molavi, A. Sandroni, and A. Tahbaz-Salehi, “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.
- H. Salami, B. Ying, and A. H. Sayed, “Social learning over weakly connected graphs,” IEEE Trans. Signal and Information Processing over Networks, vol. 3, no. 2, pp. 222–238, 2017.
- A. Nedić, A. Olshevsky, and C. A. Uribe, “Fast convergence rates for distributed non-Bayesian learning,” IEEE Transactions on Automatic Control, vol. 62, no. 11, pp. 5538–5553, 2017.
- P. Molavi, A. Tahbaz-Salehi, and A. Jadbabaie, “Foundations of non-Bayesian social learning,” Columbia Business School Research Paper, no. 15-95, 2017.
- ——, “A theory of non-Bayesian social learning,” Econometrica, vol. 86, no. 2, pp. 445–490, 2018.
- V. Bordignon, V. Matta, and A. H. Sayed, “Adaptive social learning,” IEEE Transactions on Information Theory, vol. 67, no. 9, pp. 6053–6081, 2021.
- ——, “Partial information sharing over social learning networks,” IEEE Transactions on Information Theory, vol. 69, no. 3, pp. 2033–2058, 2023.
- A. Lalitha, T. Javidi, and A. D. Sarwate, “Social learning and distributed hypothesis testing,” IEEE Transactions on Information Theory, vol. 64, no. 9, pp. 6161–6179, 2018.
- D. Acemoglu, M. A. Dahleh, I. Lobel, and A. Ozdaglar, “Bayesian learning in social networks,” The Review of Economic Studies, vol. 78, no. 4, pp. 1201–1236, 2011.
- D. Gale and S. Kariv, “Bayesian learning in social networks,” Games and Economic Behavior, vol. 45, no. 2, pp. 329–346, 2003.
- Y. İnan, M. Kayaalp, E. Telatar, and A. H. Sayed, “Social learning under randomized collaborations,” in Proc. IEEE International Symposium on Information Theory (ISIT), 2022, pp. 115–120.
- J. Z. Hare, C. A. Uribe, L. Kaplan, and A. Jadbabaie, “Non-Bayesian social learning with uncertain models,” IEEE Transactions on Signal Processing, vol. 68, pp. 4178–4193, 2020.
- C. A. Uribe, A. Olshevsky, and A. Nedić, “Nonasymptotic concentration rates in cooperative learning–part i: Variational non-Bayesian social learning,” IEEE Transactions on Control of Network Systems, vol. 9, no. 3, pp. 1128–1140, 2022.
- V. Shumovskaia, M. Kayaalp, M. Cemri, and A. H. Sayed, “Discovering influencers in opinion formation over social graphs,” IEEE Open Journal of Signal Processing, vol. 4, pp. 188–207, 2023.
- J. Hkazla, A. Jadbabaie, E. Mossel, and M. A. Rahimian, “Bayesian decision making in groups is hard,” Operations Research, vol. 69, no. 2, pp. 632–654, 2021.
- C. A. Uribe, A. Olshevsky, and A. Nedić, “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.
- M. Cirillo, V. Bordignon, V. Matta, and A. H. Sayed, “The role of memory in social learning when sharing partial opinions,” in Proc. IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2023, pp. 1–5.
- M. Cemri, V. Bordignon, M. Kayaalp, V. Shumovskaia, and A. H. Sayed, “Asynchronous social learning,” in Proc. IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2023, pp. 1–5.
- V. Shumovskaia, K. Ntemos, S. Vlaski, and A. H. Sayed, “Explainability and graph learning from social interactions,” IEEE Transactions on Signal and Information Processing over Networks, vol. 8, pp. 946–959, 2022.
- M. Kayaalp and A. H. Sayed, “Causal influences over social learning networks,” arXiv:2307.09575, 2023.
- E. Abbe, “Community detection and stochastic block models: recent developments,” The Journal of Machine Learning Research, vol. 18, no. 1, pp. 6446–6531, 2017.
- K. Rohe, S. Chatterjee, and B. Yu, “Spectral clustering and the high-dimensional stochastic blockmodel,” Annals of Statistics, vol. 39, 07 2010.
- C. Lee and D. J. Wilkinson, “A review of stochastic block models and extensions for graph clustering,” Applied Network Science, vol. 4, no. 1, pp. 1–50, 2019.
- A. Goldenberg, A. X. Zheng, S. E. Fienberg, E. M. Airoldi et al., “A survey of statistical network models,” Foundations and Trends® in Machine Learning, vol. 2, no. 2, pp. 129–233, 2010.
- S. Fortunato, “Community detection in graphs,” Physics Reports, vol. 486, no. 3-5, pp. 75–174, 2010.
- N. Zalmout and M. Ghanem, “Multidimensional community detection in Twitter,” in Proc. International Conference for Internet Technology and Secured Transactions (ICITST-2013), 2013, pp. 83–88.
- D. Cherepnalkoski and I. Mozetič, “Retweet networks of the European parliament: Evaluation of the community structure,” Applied Network Science, vol. 1, pp. 1–20, 2016.
- U. Chitra and C. Musco, “Analyzing the impact of filter bubbles on social network polarization,” in Proc. International Conference on Web Search and Data Mining, 2020, pp. 115–123.
- ——, “Understanding filter bubbles and polarization in social networks,” arXiv:1906.08772, 2019.
- N. Bhalla, A. Lechowicz, and C. Musco, “Local edge dynamics and opinion polarization,” in Proc. Sixteenth ACM International Conference on Web Search and Data Mining, 2023, pp. 6–14.
- J. E. Michaels, “Detection, localization and characterization of damage in plates with an in situ array of spatially distributed ultrasonic sensors,” Smart Materials and Structures, vol. 17, no. 3, p. 035035, 2008.
- C. Matias, T. Rebafka, and F. Villers, “A semiparametric extension of the stochastic block model for longitudinal networks,” Biometrika, vol. 105, no. 3, pp. 665–680, 2018.
- J. Chen, C. Richard, and A. H. Sayed, “Adaptive clustering for multitask diffusion networks,” in Proc. European Signal Processing Conference (EUSIPCO), 2015, pp. 200–204.
- ——, “Diffusion LMS over multitask networks,” IEEE Transactions on Signal Processing, vol. 63, no. 11, pp. 2733–2748, 2015.
- J. Plata-Chaves, A. Bertrand, M. Moonen, S. Theodoridis, and A. M. Zoubir, “Heterogeneous and multitask wireless sensor networks—algorithms, applications, and challenges,” IEEE Journal of Selected Topics in Signal Processing, vol. 11, no. 3, pp. 450–465, 2017.
- X. Zhao and A. H. Sayed, “Distributed clustering and learning over networks,” IEEE Transactions on Signal Processing, vol. 63, no. 13, pp. 3285–3300, 2015.
- R. Nassif, S. Vlaski, C. Richard, J. Chen, and A. H. Sayed, “Multitask learning over graphs: An approach for distributed, streaming machine learning,” IEEE Signal Processing Magazine, vol. 37, no. 3, pp. 14–25, 2020.
- K. Ntemos, V. Bordignon, S. Vlaski, and A. H. Sayed, “Self-aware social learning over graphs,” IEEE Transactions on Information Theory, vol. 69, no. 8, pp. 5299–5317, 2023.
- E. Abbe, A. S. Bandeira, and G. Hall, “Exact recovery in the stochastic block model,” IEEE Transactions on Information Theory, vol. 62, no. 1, pp. 471–487, 2015.
- A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, “Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications,” Physical Review E, vol. 84, no. 6, p. 066106, 2011.
- H. Wang, J. Wei, and Z. Zhang, “Consensus on dynamic stochastic block models: Fast convergence and phase transitions,” arXiv:2209.03999, 2022.
- A. H. Sayed, “Adaptation, learning, and optimization over networks,” Foundations and Trends® in Machine Learning, vol. 7, no. 4-5, pp. 311–801, 2014. [Online]. Available: http://dx.doi.org/10.1561/2200000051
- P. De Meo, E. Ferrara, G. Fiumara, and A. Provetti, “Generalized Louvain method for community detection in large networks,” in Proc. IEEE Intelligent Systems Design and Applications, 2011, pp. 88–93.
- Y. Liu, M. Ott, N. Goyal, J. Du, M. Joshi, D. Chen, O. Levy, M. Lewis, L. Zettlemoyer, and V. Stoyanov, “RoBERTa: A robustly optimized BERT pretraining approach,” arXiv:1907.11692, 2019.
- D. Loureiro, F. Barbieri, L. Neves, L. E. Anke, and J. Camacho-Collados, “TimeLMs: Diachronic language models from Twitter,” arXiv:2202.03829, 2022.
- P. M. Dahlgren, “A critical review of filter bubbles and a comparison with selective exposure,” Nordicom Review, vol. 42, no. 1, pp. 15–33, 2021.
- R. Arratia and L. Gordon, “Tutorial on large deviations for the binomial distribution,” Bulletin of Mathematical Biology, vol. 51, no. 1, pp. 125–131, 1989.