arXiv Machine Learning

Decentralized SGD with Controlled Disagreement Finds Flatter Minima

arXiv:2602. 02899v2 Announce Type: replace Abstract: Decentralized training is often regarded as inferior to centralized training because the consensus errors between workers are thought to undermine convergence and generalization.

arXiv Machine Learning
1d ago

On the Escaping Efficiency of Distributed Adversarial Training Algorithms

The paper compares distributed adversarial training algorithms—both centralized and decentralized—within multi‑agent learning environments. It introduces a theoretical framework to analyze how efficiently these algorithms escape local minima, a property linked to model flatness and robustness. The study finds that with small perturbation bounds and large batch sizes, decentralized methods (consensus and diffusion) escape local minima faster than centralized ones, but this advantage may diminish as attack strength increases.

By Ying Cao, Kun Yuan, Ali H. Sayed