# On the Limit Performance of Floating Gossip

arXiv: https://arxiv.org/abs/2302.08413 · HTML: https://mlsanity.com/paper/2302.08413/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 6 of its 30 references that are in the map.
- First posted on arXiv 16 Feb 2023.

## Builds on (most cited first, 6 of 6)

- [A Tutorial on 5G NR V2X Communications](https://mlsanity.com/paper/2102.04538/) (2021)
- [Accelerating Gossip SGD with Periodic Global Averaging](https://mlsanity.com/paper/2105.09080/) (2021)
- [GossipGraD: Scalable Deep Learning using Gossip Communication based Asynchronous Gradient Descent](https://mlsanity.com/paper/1803.05880/) (2018)
- [Opportunistic Federated Learning: An Exploration of Egocentric Collaboration for Pervasive Computing Applications](https://mlsanity.com/paper/2103.13266/) (2021)
- [A Capacity Scaling Law for Artificial Neural Networks](https://mlsanity.com/paper/1708.06019/) (2017)
- [GoSGD: Distributed Optimization for Deep Learning with Gossip Exchange](https://mlsanity.com/paper/1804.01852/) (2018)

## Abstract (arXiv)

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.