Distributed Optimization via Energy Conservation Laws in Dilated Coordinates
Mayank Baranwal, Kushal Chakrabarti

TL;DR
This paper introduces an energy conservation framework in dilated coordinates to analyze and develop accelerated distributed optimization algorithms with improved convergence rates for smooth convex problems.
Contribution
It presents a novel energy-based analysis method and a second-order accelerated gradient flow with the best-known convergence rates for distributed convex optimization.
Findings
Achieves a convergence rate of O(1/t^{2-ε}) in continuous time.
Develops a discretized algorithm with a rate of O(1/k^{2-ε}).
Outperforms existing distributed optimization algorithms in large-scale experiments.
Abstract
Optimizing problems in a distributed manner is critical for systems involving multiple agents with private data. Despite substantial interest, a unified method for analyzing the convergence rates of distributed optimization algorithms is lacking. This paper introduces an energy conservation approach for analyzing continuous-time dynamical systems in dilated coordinates. Instead of directly analyzing dynamics in the original coordinate system, we establish a conserved quantity, akin to physical energy, in the dilated coordinate system. Consequently, convergence rates can be explicitly expressed in terms of the inverse time-dilation factor. Leveraging this generalized approach, we formulate a novel second-order distributed accelerated gradient flow with a convergence rate of in time for . We then employ a semi second-order symplectic Euler…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
