arrow
Return

Explainability and Graph Learning From Social Interactions

delete2022-01-01
delete6
delete
OA
AI
V
Valentina Shumovskaia *
Κ
Κωνσταντίνος Ντέμος
S
Stefan Vlaski
A
Ali H. Sayed
DOI:10.1109/TSIPN.2022.3223805delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Social learning algorithms provide models for the formation of opinions over social networks resulting from local reasoning and peer-to-peer exchanges. Interactions occur over an underlying graph topology, which describes the flow of information among the agents. To account for drifting conditions in the environment, this work adopts an adaptive social learning strategy, which is able to track variations in the underlying signal statistics. Among other results, we propose a technique that addresses questions of explainability and interpretability of the results when the graph is hidden. Given observations of the evolution of the beliefs over time, we aim to infer the underlying graph topology, discover pairwise influences between the agents, and identify significant trajectories in the network. The proposed framework is online in nature and can adapt dynamically to changes in the graph topology or the true hypothesis.
Keywords:
Explainability
graph learning
inverse modeling
online learning
social learning

Journal

IEEE Transactions on Signal and Information Processing over Networks cover
IEEE Transactions on Signal and Information Processing over Networks
IF:
4.9
Papers:
726
Citations:
1.9K

Organization

U
University of Basel
Scholars:
3.1W
Papers: 2.4W
Citations: 38
E
Ecole Polytechnique Federale de Lausanne
Scholars:
1.7W
Papers: 1.3W
Citations: 25
S
swiss federal institutes of technology domain
Scholars:
9.0W
Papers: 8.0W
Citations: 163
researcher View more organizations