On the Limit Performance of Floating Gossip
- URL: http://arxiv.org/abs/2302.08413v1
- Date: Thu, 16 Feb 2023 16:42:38 GMT
- Title: On the Limit Performance of Floating Gossip
- Authors: Gianluca Rizzo, Noelia Perez Palma, Marco Ajmone Marsan, and Vincenzo
Mancuso
- Abstract summary: Gossip Learning scheme relies on Floating Content to implement location-based probabilistic evolution of machine learning models in an infrastructure-less manner.
We consider dynamic scenarios where continuous learning is necessary, and we adopt a mean field approach to investigate the limit performance of Floating Gossip.
Our model shows that Floating Gossip can be very effective in implementing continuous training and update of machine learning models in a cooperative manner.
- Score: 6.883143706086789
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this paper we investigate the limit performance of Floating Gossip, a new,
fully distributed Gossip Learning scheme which relies on Floating Content to
implement location-based probabilistic evolution of machine learning models in
an infrastructure-less manner. We consider dynamic scenarios where continuous
learning is necessary, and we adopt a mean field approach to investigate the
limit performance of Floating Gossip in terms of amount of data that users can
incorporate into their models, as a function of the main system parameters.
Different from existing approaches in which either communication or computing
aspects of Gossip Learning are analyzed and optimized, our approach accounts
for the compound impact of both aspects. We validate our results through
detailed simulations, proving good accuracy. Our model shows that Floating
Gossip can be very effective in implementing continuous training and update of
machine learning models in a cooperative manner, based on opportunistic
exchanges among moving users.
Related papers
Err
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.