Score breakdown

Communication-Efficient Learning of Deep Networks from Decentralized Data

paper-0101 · paper · 2017

Brendan McMahan et al.

Federated learning; training without centralizing data.

Abstract

Modern mobile devices have access to a wealth of data suitable for learning models, which in turn can greatly improve the user experience on the device. For example, language models can improve speech recognition and text entry, and image models can automatically select good photos. However, this rich data is often privacy sensitive, large in quantity, or both, which may preclude logging to the data center and training there using conventional approaches. We advocate an alternative that leaves the training data distributed on the mobile devices, and learns a shared model by aggregating locally-computed updates. We term this decentralized approach Federated Learning. We present a practical method for the federated learning of deep networks based on iterative model averaging, and conduct an extensive empirical evaluation, considering five different model architectures and four datasets. These experiments demonstrate the approach is robust to the unbalanced and non-IID data distributions that are a defining characteristic of this setting. Communication costs are the principal constraint, and we show a reduction in required communication rounds by 10-100x as compared to synchronized stochastic gradient descent. [OpenAlex]

Academic, score -0.1766

MetricStatusValueNorm.WeightContributionSourceConfidenceLicenseProvenance
citation_countpresent5631.00.0253430.50.012671OpenAlexmediumOpenAlex, CC0 metadatalink
library_holdingsmissingrecorded as missing, penalized by rule, never imputed−0.1recorded as missing; penalized by rule, never imputed
readership_persistencepresent11.00.7142860.050.035714OpenAlexlowOpenAlex, CC0 metadatalink
syllabus_adoptionsmissingrecorded as missing, penalized by rule, never imputed−0.125recorded as missing; penalized by rule, never imputed

Broad Influence, score 0.0908

MetricStatusValueNorm.WeightContributionSourceConfidenceLicenseProvenance
citation_countpresent5631.00.0253430.20.005069OpenAlexmediumOpenAlex, CC0 metadatalink
library_holdingsmissingrecorded as missing, penalized by rule, never imputed−0.125recorded as missing; penalized by rule, never imputed
readership_persistencepresent11.00.7142860.40.285714OpenAlexlowOpenAlex, CC0 metadatalink
syllabus_adoptionsmissingrecorded as missing, penalized by rule, never imputed−0.075recorded as missing; penalized by rule, never imputed

Governance Practitioner, score -0.2472

MetricStatusValueNorm.WeightContributionSourceConfidenceLicenseProvenance
citation_countpresent5631.00.0253430.250.006336OpenAlexmediumOpenAlex, CC0 metadatalink
library_holdingsmissingrecorded as missing, penalized by rule, never imputed−0.15recorded as missing; penalized by rule, never imputed
readership_persistencepresent11.00.7142860.10.071429OpenAlexlowOpenAlex, CC0 metadatalink
syllabus_adoptionsmissingrecorded as missing, penalized by rule, never imputed−0.175recorded as missing; penalized by rule, never imputed

A rank is not a verdict on intrinsic worth. It is a transparent output of declared evidence, weights, and missing-data rules at a specific release date.

Disagree with this rank or a number? Challenge it with your evidence. Every challenge gets a public identifier and a published resolution.