# Fully Asynchronous Push-Sum With Growing Intercommunication Intervals

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

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 23 Feb 2018.

## Built on by (most cited first, 3 of 3)

- [PersA-FL: Personalized Asynchronous Federated Learning](https://mlsanity.com/paper/2210.01176/) (2022)
- [Provably Accelerated Decentralized Gradient Method Over Unbalanced Directed Graphs](https://mlsanity.com/paper/2107.12065/) (2021)
- [The Effect of Training Parameters and Mechanisms on Decentralized Federated Learning based on MNIST Dataset](https://mlsanity.com/paper/2108.03508/) (2021)

## Abstract (arXiv)

We propose an algorithm for average consensus over a directed graph which is both fully asynchronous and robust to unreliable communications. We show its convergence to the average, while allowing for slowly growing but potentially unbounded communication failures.