Faster Convergence With Less Communication: Broadcast-Based Subgraph Sampling for Decentralized Learning Over Wireless Networks

Decentralized stochastic gradient descent (D-SGD) is a widely adopted optimization algorithm for decentralized training of machine learning models across networked agents. A crucial part of D-SGD is the consensus-based model averaging, which heavily relies on information exchange and fusion among th...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE open journal of the Communications Society Ročník 6; s. 1497 - 1511
Hlavní autoři:	Perez Herrera, Daniel, Chen, Zheng, Larsson, Erik G.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms broadcast Broadcasting Channels Collision avoidance Communication Convergence Costs D-SGD Decentralized machine learning Graph theory Laplace equations Machine learning Network topology node scheduling Nodes Optimization Sampling methods Scheduling Stochastic processes Symmetric matrices Topology Training Vectors Wireless networks broadcast Costs Symmetric matrices Laplace equations Stochastic processes wireless networks Vectors Topology node scheduling Optimization Convergence Training Network topology D-SGD Decentralized machine learning
ISSN:	2644-125X, 2644-125X
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!