Learning Opinions in Social Networks
Abstract
We study the problem of learning opinions in social networks. The learner observes the states of some sample nodes from a social network, and tries to infer the states of other nodes, based on the structure of the network. We show that sample-efficient learning is impossible when the network exhibits strong noise, and give a polynomial-time algorithm for the problem with nearly optimal sample complexity when the network is sufficiently stable.
Cite
Text
Conitzer et al. "Learning Opinions in Social Networks." International Conference on Machine Learning, 2020.Markdown
[Conitzer et al. "Learning Opinions in Social Networks." International Conference on Machine Learning, 2020.](https://mlanthology.org/icml/2020/conitzer2020icml-learning/)BibTeX
@inproceedings{conitzer2020icml-learning,
title = {{Learning Opinions in Social Networks}},
author = {Conitzer, Vincent and Panigrahi, Debmalya and Zhang, Hanrui},
booktitle = {International Conference on Machine Learning},
year = {2020},
pages = {2122-2132},
volume = {119},
url = {https://mlanthology.org/icml/2020/conitzer2020icml-learning/}
}