mlsanityData to 14 Oct 2026

Fully Asynchronous Push-Sum With Growing Intercommunication Intervals

arXiv 1802.08634 ↗First posted 23 Feb 2018math.OCcited by 3

Not on the map. Why?

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.

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

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 1.

3 papers.

  1. 2022PersA-FL: Personalized Asynchronous Federated Learningcited by 5
  2. 2021Provably Accelerated Decentralized Gradient Method Over Unbalanced Directed Graphscited by 1
  3. 2021The Effect of Training Parameters and Mechanisms on Decentralized Federated Learning based on MNIST Datasetcited by 0