Likelihood-Based Methods Improve Parameter Estimation in Opinion Dynamics Models
October 04, 2023 ยท Declared Dead ยท ๐ Web Search and Data Mining
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Jacopo Lenti, Corrado Monti, Gianmarco De Francisci Morales
arXiv ID
2310.02766
Category
cs.SI: Social & Info Networks
Cross-listed
cs.CY
Citations
8
Venue
Web Search and Data Mining
Last Checked
3 months ago
Abstract
We show that a maximum likelihood approach for parameter estimation in agent-based models (ABMs) of opinion dynamics outperforms the typical simulation-based approach. Simulation-based approaches simulate the model repeatedly in search of a set of parameters that generates data similar enough to the observed one. In contrast, likelihood-based approaches derive a likelihood function that connects the unknown parameters to the observed data in a statistically principled way. We compare these two approaches on the well-known bounded-confidence model of opinion dynamics. We do so on three realistic scenarios of increasing complexity depending on data availability: (i) fully observed opinions and interactions, (ii) partially observed interactions, (iii) observed interactions with noisy proxies of the opinions. We highlight how identifying observed and latent variables is fundamental for connecting the model to the data. To realize the likelihood-based approach, we first cast the model into a probabilistic generative guise that supports a proper data likelihood. Then, we describe the three scenarios via probabilistic graphical models and show the nuances that go into translating the model. Finally, we implement the resulting probabilistic models in an automatic differentiation framework (PyTorch). This step enables easy and efficient maximum likelihood estimation via gradient descent. Our experimental results show that the maximum likelihood estimates are up to 4x more accurate and require up to 200x less computational time.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Social & Info Networks
R.I.P.
๐ป
Ghosted
R.I.P.
๐ป
Ghosted
node2vec: Scalable Feature Learning for Networks
R.I.P.
๐ป
Ghosted
Cooperative Game Theory Approaches for Network Partitioning
R.I.P.
๐ป
Ghosted
From Louvain to Leiden: guaranteeing well-connected communities
R.I.P.
๐ป
Ghosted
Fake News Detection on Social Media: A Data Mining Perspective
R.I.P.
๐ป
Ghosted
Heterogeneous Graph Attention Network
Died the same way โ ๐ป Ghosted
R.I.P.
๐ป
Ghosted
Language Models are Few-Shot Learners
R.I.P.
๐ป
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
๐ป
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
๐ป
Ghosted