The Impact of Network Connectivity on Collective Learning
- URL: http://arxiv.org/abs/2106.00655v1
- Date: Tue, 1 Jun 2021 17:39:26 GMT
- Title: The Impact of Network Connectivity on Collective Learning
- Authors: Michael Crosscombe and Jonathan Lawry
- Abstract summary: In decentralised autonomous systems it is the interactions between individual agents which govern the collective behaviours of the system.
In this paper we investigate the impact that the underlying network has on performance in the context of collective learning.
- Score: 1.370633147306388
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In decentralised autonomous systems it is the interactions between individual
agents which govern the collective behaviours of the system. These local-level
interactions are themselves often governed by an underlying network structure.
These networks are particularly important for collective learning and
decision-making whereby agents must gather evidence from their environment and
propagate this information to other agents in the system. Models for collective
behaviours may often rely upon the assumption of total connectivity between
agents to provide effective information sharing within the system, but this
assumption may be ill-advised. In this paper we investigate the impact that the
underlying network has on performance in the context of collective learning.
Through simulations we study small-world networks with varying levels of
connectivity and randomness and conclude that totally-connected networks result
in higher average error when compared to networks with less connectivity.
Furthermore, we show that networks of high regularity outperform networks with
increasing levels of random connectivity.
Related papers
- Problem-Solving in Language Model Networks [44.99833362998488]
This work extends the concept of multi-agent debate to more general network topologies.
It measures the question-answering accuracy, influence, consensus, and the effects of bias on the collective.
arXiv Detail & Related papers (2024-06-18T07:59:14Z) - Leveraging Low-Rank and Sparse Recurrent Connectivity for Robust
Closed-Loop Control [63.310780486820796]
We show how a parameterization of recurrent connectivity influences robustness in closed-loop settings.
We find that closed-form continuous-time neural networks (CfCs) with fewer parameters can outperform their full-rank, fully-connected counterparts.
arXiv Detail & Related papers (2023-10-05T21:44:18Z) - Reward-Sharing Relational Networks in Multi-Agent Reinforcement Learning
as a Framework for Emergent Behavior [0.0]
We integrate social' interactions into the MARL setup through a user-defined relational network.
We examine the effects of agent-agent relations on the rise of emergent behaviors.
arXiv Detail & Related papers (2022-07-12T23:27:42Z) - Competing Adaptive Networks [56.56653763124104]
We develop an algorithm for decentralized competition among teams of adaptive agents.
We present an application in the decentralized training of generative adversarial neural networks.
arXiv Detail & Related papers (2021-03-29T14:42:15Z) - Anomaly Detection on Attributed Networks via Contrastive Self-Supervised
Learning [50.24174211654775]
We present a novel contrastive self-supervised learning framework for anomaly detection on attributed networks.
Our framework fully exploits the local information from network data by sampling a novel type of contrastive instance pair.
A graph neural network-based contrastive learning model is proposed to learn informative embedding from high-dimensional attributes and local structure.
arXiv Detail & Related papers (2021-02-27T03:17:20Z) - A Latent Space Model for Multilayer Network Data [0.2538209532048866]
We propose a Bayesian statistical model to simultaneously characterize two or more social networks defined over a common set of actors.
The key feature of the model is a hierarchical prior distribution that allows us to represent the entire system jointly.
Our model's capabilities are illustrated using several real-world data sets, taking into account different types of actors, sizes, and relations.
arXiv Detail & Related papers (2021-02-18T00:53:44Z) - A game-theoretic analysis of networked system control for common-pool
resource management using multi-agent reinforcement learning [54.55119659523629]
Multi-agent reinforcement learning has recently shown great promise as an approach to networked system control.
Common-pool resources include arable land, fresh water, wetlands, wildlife, fish stock, forests and the atmosphere.
arXiv Detail & Related papers (2020-10-15T14:12:26Z) - Collective Learning by Ensembles of Altruistic Diversifying Neural
Networks [0.0]
We present a model for co-learning by ensembles of interacting neural networks that aim to maximize their own performance but also their functional relations to other networks.
We show that ensembles of interacting networks outperform independent ones, and that optimal ensemble performance is reached when the coupling between networks increases diversity and degrades the performance of individual networks.
arXiv Detail & Related papers (2020-06-20T22:53:32Z) - Detecting Communities in Heterogeneous Multi-Relational Networks:A
Message Passing based Approach [89.19237792558687]
Community is a common characteristic of networks including social networks, biological networks, computer and information networks.
We propose an efficient message passing based algorithm to simultaneously detect communities for all homogeneous networks.
arXiv Detail & Related papers (2020-04-06T17:36:24Z) - A Comparative Study of Social Network Classifiers for Predicting Churn
in the Telecommunication Industry [8.592714155264613]
Networked learning has been shown to be effective in a number of studies.
These methods have been adapted to predict customer churn in telecommunication companies.
arXiv Detail & Related papers (2020-01-18T17:05:53Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.