返回
Network Support for High-Performance Distributed Machine Learning
DOI:10.1109/TNET.2022.3189077.png)
摘要
En 中文
The traditional approach to distributed machine learning is to adapt learning algorithms to the network, e.g., reducing updates to curb overhead. Networks based on intelligent edge, instead, make it possible to follow the opposite approach, i.e., to define the logical network topology around the learning task to perform, so as to meet the desired learning performance. In this paper, we propose a system model that captures such aspects in the context of supervised machine learning, accounting for both learning nodes (that perform computations) and information nodes (that provide data). We then formulate the problem of selecting (i) which learning and information nodes should cooperate to complete the learning task, and (ii) the number of epochs to run, in order to minimize the learning cost while meeting the target prediction error and execution time. After proving important properties of the above problem, we devise an algorithm, named DoubleClimb, that can find a 1 + 1/vertical bar I vertical bar-competitive solution (with I being the set of information nodes), with cubic worst-case complexity. Our performance evaluation, leveraging a real-world network topology and considering both classification and regression tasks, also shows that DoubleClimb closely matches the optimum, outperforming state-of-the-art alternatives.
Keyword:
Task analysis
Topology
Network topology
Data models
Costs
Machine learning
Training
Network orchestration
machine learning
edge computing
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
引用论文
Communication-Efficient Policy G ad en Methods for Distributed Reinforcement Learning用于分布式强化学习的通信高效策略和方法
Effect of ABCDE Bundle Implementation on Prevalence of Delirium in Intensive Care Unit PatientsABCDE集束化实施对重症监护病房患者谵妄发生率的影响
Delusions of parasitosis: World perspective on the choice of psychopharmacotherapy寄生虫妄想症:精神药物治疗选择的世界性观点

