Optimizing Stochastic Gradient Push under Broadcast Communications

The authors developed a method to optimize mixing matrices for Stochastic Gradient Push (SGP) in decentralized federated learning under broadcast communications. They derived an objective function based on graph-theoretic parameters, leading to an efficient design algorithm. This approach reduces convergence time by 11–45% compared to existing methods without sacrificing model quality.

Open the full episode

More from AI Radio