Data Summarization for Federated Learning
Abstract
We explore data summarization techniques as a mean to reduce the energy footprint of Federated Learning (FL). We formulate the problem of selecting a small subset of data points that best represent the gradient of each local dataset as a submodular maximization problem and provide sufficient conditions under which the FL training is guaranteed to converge to the same global model as if the whole local datasets have been used on each client. Experimental results on IID and non-IID datasets show that this approach yields a similar accuracy as training on the full local datasets, but with a significant reduction of runtimes. There is however no clear advantage of data summarization over random sampling.
Domains
Computer Science [cs]Origin | Files produced by the author(s) |
---|