TL;DR
This paper presents a flexible framework for distributed and parallel training of neural networks, ensuring convergence and accommodating various training criteria and regularizations in networked multi-agent systems.
Contribution
It introduces a novel framework combining convexification, dynamic consensus, and parallelization for efficient distributed neural network training.
Findings
Guarantees convergence to stationary solutions.
Supports various loss functions and regularizations.
Enables parallel optimization within each agent.
Abstract
The aim of this paper is to develop a general framework for training neural networks (NNs) in a distributed environment, where training data is partitioned over a set of agents that communicate with each other through a sparse, possibly time-varying, connectivity pattern. In such distributed scenario, the training problem can be formulated as the (regularized) optimization of a non-convex social cost function, given by the sum of local (non-convex) costs, where each agent contributes with a single error term defined with respect to its local dataset. To devise a flexible and efficient solution, we customize a recently proposed framework for non-convex optimization over networks, which hinges on a (primal) convexification-decomposition technique to handle non-convexity, and a dynamic consensus procedure to diffuse information among the agents. Several typical choices for the training…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
