A Mathematics-Inspired Learning-to-Optimize Framework for Decentralized Optimization
Yutong He, Qiulin Shang, Xinmeng Huang, Jialin Liu, Kun Yuan

TL;DR
This paper introduces MiLoDo, a mathematics-inspired learning-to-optimize framework for decentralized optimization that enhances convergence and generalization over traditional handcrafted algorithms.
Contribution
The paper develops a novel framework, MiLoDo, that leverages problem-specific features to train decentralized algorithms with superior performance and robustness.
Findings
MiLoDo-trained algorithms outperform handcrafted methods.
Algorithms generalize well to real data and higher dimensions.
Robust performance over extensive iterations.
Abstract
Most decentralized optimization algorithms are handcrafted. While endowed with strong theoretical guarantees, these algorithms generally target a broad class of problems, thereby not being adaptive or customized to specific problem features. This paper studies data-driven decentralized algorithms trained to exploit problem features to boost convergence. Existing learning-to-optimize methods typically suffer from poor generalization or prohibitively vast search spaces. In addition, the vast search space of communicating choices and final goal to reach the global solution via limited neighboring communication cast more challenges in decentralized settings. To resolve these challenges, this paper first derives the necessary conditions that successful decentralized algorithmic rules need to satisfy to achieve both optimality and consensus. Based on these conditions, we propose a novel…
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
TopicsScheduling and Optimization Algorithms
