| Summary: | We consider information-theoretic bounds on the expected generalization error for statistical learning problems in a network setting. In this setting, there are <i>K</i> nodes, each with its own independent dataset, and the models from the <i>K</i> nodes have to be aggregated into a final centralized model. We consider both simple averaging of the models as well as more complicated multi-round algorithms. We give upper bounds on the expected generalization error for a variety of problems, such as those with Bregman divergence or Lipschitz continuous losses, that demonstrate an improved dependence of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>1</mn><mo>/</mo><mi>K</mi></mrow></semantics></math></inline-formula> on the number of nodes. These “per node” bounds are in terms of the mutual information between the training dataset and the trained weights at each node and are therefore useful in describing the generalization properties inherent to having communication or privacy constraints at each node.
|
|---|