Metraipolis › archive › dc_7d8a88545e66
Distributed Stochastic Approximation Algorithms and Heavy-Tailed Age of Information — arXiv:2609.27499
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.27499
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T08:57:27.273Z
- SHA-256 of the archived text
996c21c84741ddc20418ac117863a84112a2ec88eb7074d6dfec01c29f97c6a7- Stable URL of this page
https://metraipolis.com/documento/dc_7d8a88545e66
How to cite
Distributed Stochastic Approximation Algorithms and Heavy-Tailed Age of Information — arXiv:2609.27499 — arXiv (en), https://arxiv.org/abs/2609.27499 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7d8a88545e66 (Metraipolis archive dc_7d8a88545e66, sha256 996c21c84741ddc20418ac117863a84112a2ec88eb7074d6dfec01c29f97c6a7)
BibTeX
@misc{dc7d8a88545e66,
title = {Distributed Stochastic Approximation Algorithms and Heavy-Tailed Age of Information — arXiv:2609.27499},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.27499},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7d8a88545e66; sha256 996c21c84741ddc20418ac117863a84112a2ec88eb7074d6dfec01c29f97c6a7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.27499. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Algorithms in multi-agent systems such as federated learning, mobile robotic swarming, and consensus control can be designed and analyzed as distributed stochastic approximation algorithms. Such algorithms involve information exchanges between agents for various computations. The freshness of the information can be quantified using the Age of Information (AoI) metric. Consider robotic teams operating in highly obstructed geographical settings, such as subterranean or dense urban environments. Because of spatial disconnections, AoI has empirically been observed to be heavy-tailed with unbounded moments. However, most analyses assume AoI with bounded moments, creating a gap between theory and practice. To the best of our knowledge, ours is the first analysis under general heavy-tailed AoI with potentially infinite mean. We study the stability (almost sure boundedness of the distributed iterates) and convergence of multi-agent systems that are strictly dissipative in the scaling limit (system at ``infinity''). Examples include most gradient-based and consensus algorithms under the Robbins-Monro step-size regime. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-24 in cs.MA). Categorie arXiv: Optimization and Control (math.OC) ; Distributed, Parallel, and Cluster Computing (cs.DC); Multiagent Systems (cs.MA); Networking and Internet Architecture (cs.NI); Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2609.27499 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T08:03:18.948Z dalla pagina https://arxiv.org/catchup/cs.MA/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).