Semidefinite-Programming-Based Network Code for Ring-Topological Decentralized Federated Learning

doi:10.1109/LCOMM.2025.3604483

Semidefinite-Programming-Based Network Code for Ring-Topological Decentralized Federated Learning

2025-09-01

0

PRE

AI

DOI：10.1109/LCOMM.2025.3604483

Original

Original request for help

Save

Abstract

En 中文

This letter examines the decentralized stochastic gradient descent algorithm for federated learning over a wireless ring network, where each device connects to its $2n$ adjacent devices, termed n-tier coverage. Given this topology, the consensus coefficients, or mixing matrix, can be optimized via semidefinite programming (SDP). By employing network coding, the learning topology can be densified without additional communication costs, introducing linear constraints to the uncoded problem. The joint design of the mixing matrix and coding parameters is also formulated as an SDP problem, allowing for efficient determination. Numerical results for linear regression and image classification (using MNIST and CIFAR-10 datasets) demonstrate that our SDP-based network coding approach significantly accelerates convergence in decentralized federated learning under a variation of the pathological non-IID data distribution.

Keywords:

Wireless decentralized learning

federated learning

network coding

semidefinite programming

Semidefinite-Programming-Based Network Code for Ring-Topological Decentralized Federated Learning

Abstract

Journal

Organization