Efficient Decentralized Deep Learning by Dynamic Model Averaging

July 09, 2018 ยท Declared Dead ยท ๐Ÿ› ECML/PKDD

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Michael Kamp, Linara Adilova, Joachim Sicking, Fabian Hรผger, Peter Schlicht, Tim Wirtz, Stefan Wrobel arXiv ID 1807.03210 Category cs.LG: Machine Learning Cross-listed cs.AI, cs.DC, stat.ML Citations 129 Venue ECML/PKDD Last Checked 3 months ago
Abstract
We propose an efficient protocol for decentralized training of deep neural networks from distributed data sources. The proposed protocol allows to handle different phases of model training equally well and to quickly adapt to concept drifts. This leads to a reduction of communication by an order of magnitude compared to periodically communicating state-of-the-art approaches. Moreover, we derive a communication bound that scales well with the hardness of the serialized learning problem. The reduction in communication comes at almost no cost, as the predictive performance remains virtually unchanged. Indeed, the proposed protocol retains loss bounds of periodically averaging schemes. An extensive empirical evaluation validates major improvement of the trade-off between model performance and communication which could be beneficial for numerous decentralized learning applications, such as autonomous driving, or voice recognition and image classification on mobile phones.
Community shame:
Not yet rated
Community Contributions

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

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning

Died the same way โ€” ๐Ÿ‘ป Ghosted