{"ID":2891318,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.17426","arxiv_id":"2507.17426","title":"Information Entropy-Based Scheduling for Communication-Efficient Decentralized Learning","abstract":"This paper addresses decentralized stochastic gradient descent (D-SGD) over resource-constrained networks by introducing node-based and link-based scheduling strategies to enhance communication efficiency. In each iteration of the D-SGD algorithm, only a few disjoint subsets of nodes or links are randomly activated, subject to a given communication cost constraint. We propose a novel importance metric based on information entropy to determine node and link scheduling probabilities. We validate the effectiveness of our approach through extensive simulations, comparing it against state-of-the-art methods, including betweenness centrality (BC) for node scheduling and \\textit{MATCHA} for link scheduling. The results show that our method consistently outperforms the BC-based method in the node scheduling case, achieving faster convergence with up to 60\\% lower communication budgets. At higher communication budgets (above 60\\%), our method maintains comparable or superior performance. In the link scheduling case, our method delivers results that are superior to or on par with those of \\textit{MATCHA}.","short_abstract":"This paper addresses decentralized stochastic gradient descent (D-SGD) over resource-constrained networks by introducing node-based and link-based scheduling strategies to enhance communication efficiency. In each iteration of the D-SGD algorithm, only a few disjoint subsets of nodes or links are randomly activated, su...","url_abs":"https://arxiv.org/abs/2507.17426","url_pdf":"https://arxiv.org/pdf/2507.17426v1","authors":"[\"Jaiprakash Nagar\",\"Zheng Chen\",\"Marios Kountouris\",\"Photios A. Stavrou\"]","published":"2025-07-23T11:33:35Z","proceeding":"cs.IT","tasks":"[\"cs.IT\",\"cs.LG\",\"cs.NI\"]","methods":"[]","has_code":false}