5 articles tagged with #distributed-optimization. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers propose q-PDGD, a quantized stochastic primal-dual optimization method for distributed systems with limited communication bandwidth. The approach achieves linear convergence under relaxed geometric conditions and matches centralized stochastic optimization rates while reducing communication overhead through quantization.
Researchers propose a hierarchical control strategy for networked systems using both model-based and data-driven approaches to ensure robust performance while optimizing network topology. The method leverages dissipativity theory and linear matrix inequality problems to design distributed controllers without requiring centralized computation, with applications demonstrated in DC microgrid voltage regulation.
Researchers present a distributed multi-agent reinforcement learning method that uses state augmentation and consensus algorithms to enforce global constraints while maintaining linear scalability. The approach enables thousands of agents to coordinate through local communication alone, outperforming centralized training methods that scale quadratically and fail on real-world constraint satisfaction problems like smart grid management.
Researchers propose Core-Halo decomposition, a novel approach to solving large-scale fixed-point problems in decentralized systems that separates write ownership from read-only evaluation context. Unlike standard strict decomposition methods that create structural bias by truncating dependencies, Core-Halo aligns with block-dependence structures to enable faithful implementation of the original fixed-point problem across distributed multi-agent systems while maintaining parallelism benefits.
Researchers propose a decentralized gradient descent framework for optimizing time-varying objectives across distributed networks processing streaming data. The work analyzes tracking error using temporal weighting strategies, showing uniform weighting achieves O(1/t) convergence while exponential discounting maintains non-vanishing error floors, with implications for distributed machine learning systems.
