Decentralized Optimization

Overview

Decentralized optimization studies how networked agents can jointly minimize an objective or coordinate decisions while each uses local data and communicates with neighbors rather than relying on a central coordinator. Common approaches include gossip and consensus, decentralized stochastic gradient descent with gradient tracking, primal-dual and ADMM methods, and local updates paired with compressed or intermittent communication. These methods are tested in settings such as image and language-model training, online and bilevel learning, power systems, and multi-robot estimation. A central challenge is balancing communication cost, network topology, data heterogeneity, and robustness against noise or adversaries while retaining fast convergence and reliable solutions.

Latest papers

CardsList

63 papers7 papers in the last four weeks, down 46% on the four weeks before. 0.0% of all new papers.

  1. Game-theoretic Regulated Decentralized Coordination for Airspace Sector Overload Mitigation

    Nov 14, 2025Jaehan Im, Daniel Delahaye, David Fridovich-Keil +1Multi-Agent CoordinationAir Traffic Management

  2. Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization

    Jan 30, 2025Yiyang Lu, Mohammad Pedramfar, Vaneet AggarwalSubmodular OptimizationOnline Convex Optimization