Asynchronous Federated Optimization

March 10, 2019 · Declared Dead · 🏛 arXiv.org

👻 CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Cong Xie, Sanmi Koyejo, Indranil Gupta arXiv ID 1903.03934 Category cs.DC: Distributed Computing Cross-listed cs.LG Citations 690 Venue arXiv.org Last Checked 1 month ago
Abstract
Federated learning enables training on a massive number of edge devices. To improve flexibility and scalability, we propose a new asynchronous federated optimization algorithm. We prove that the proposed approach has near-linear convergence to a global optimum, for both strongly convex and a restricted family of non-convex problems. Empirical results show that the proposed algorithm converges quickly and tolerates staleness in various applications.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Distributed Computing

Died the same way — 👻 Ghosted