Towards Peer-to-Peer Split Learning

Jayant Vyas, Ritesh Dhananjay Nikose, Pallavi Ramicetty, Shravan Mohan, Milind Savagaonkar, Anutosh Maitra, Shubhashis Sengupta
{"title":"Towards Peer-to-Peer Split Learning","authors":"Jayant Vyas, Ritesh Dhananjay Nikose, Pallavi Ramicetty, Shravan Mohan, Milind Savagaonkar, Anutosh Maitra, Shubhashis Sengupta","doi":"10.1109/COMSNETS59351.2024.10427274","DOIUrl":null,"url":null,"abstract":"In this paper, the $N$-split learning scheme is presented. This scheme allows for learning a feed-forward deep neural network on devices with limited memory for model and data. The central idea in this scheme is to divide the model and data over different devices. The model is split layer-wise (in subsets of consecutive layers), while the data is split homogeneously. The device with the first few layers starts the forward pass of the backpropagation algorithm for a training sample from its data subset and passes the output to the device with the next subset of layers. This process continues till the last layers are computed. The last device to compute the forward pass then computes the backward pass, and the process proceeds in the reverse direction, thereby calculating a part of the gradients. The gradients are accumulated for a batch of samples, and the parameters are updated. After completing an epoch, the devices perform a swap of the layers, and the above process starts again. It continues till the model is trained satisfactorily. In an improved variant, called Fast $N$-split learning, the forward and backward passes are considered separately and possibly done on different devices to gain from pipeline parallelism. The layers performing the forward pass store the output in a buffer, which will be used by the devices performing the backward pass. The devices performing backward passes communicate the update for parameters to the devices doing forward passes. As earlier, this continues till the model is trained satisfactorily. Analysis, routines for determining the optimal split for both schemes and simulations are presented for corroboration.","PeriodicalId":518748,"journal":{"name":"2024 16th International Conference on COMmunication Systems & NETworkS (COMSNETS)","volume":"279 4","pages":"881-888"},"PeriodicalIF":0.0000,"publicationDate":"2024-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2024 16th International Conference on COMmunication Systems & NETworkS (COMSNETS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS59351.2024.10427274","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, the $N$-split learning scheme is presented. This scheme allows for learning a feed-forward deep neural network on devices with limited memory for model and data. The central idea in this scheme is to divide the model and data over different devices. The model is split layer-wise (in subsets of consecutive layers), while the data is split homogeneously. The device with the first few layers starts the forward pass of the backpropagation algorithm for a training sample from its data subset and passes the output to the device with the next subset of layers. This process continues till the last layers are computed. The last device to compute the forward pass then computes the backward pass, and the process proceeds in the reverse direction, thereby calculating a part of the gradients. The gradients are accumulated for a batch of samples, and the parameters are updated. After completing an epoch, the devices perform a swap of the layers, and the above process starts again. It continues till the model is trained satisfactorily. In an improved variant, called Fast $N$-split learning, the forward and backward passes are considered separately and possibly done on different devices to gain from pipeline parallelism. The layers performing the forward pass store the output in a buffer, which will be used by the devices performing the backward pass. The devices performing backward passes communicate the update for parameters to the devices doing forward passes. As earlier, this continues till the model is trained satisfactorily. Analysis, routines for determining the optimal split for both schemes and simulations are presented for corroboration.
实现点对点拆分学习
本文介绍了 $N$ 分裂学习方案。该方案允许在模型和数据内存有限的设备上学习前馈深度神经网络。该方案的核心思想是将模型和数据划分到不同的设备上。模型按层划分(连续层的子集),而数据则按同质划分。拥有前几层的设备针对其数据子集中的训练样本启动反向传播算法的前向传递,并将输出传递给拥有下一个子集层的设备。这一过程一直持续到计算完最后几层。最后一个计算前向传递的设备接着计算后向传递,该过程反向进行,从而计算出部分梯度。一批样本的梯度被累积起来,参数也随之更新。在完成一个历时后,设备会进行层交换,然后重新开始上述过程。这一过程一直持续到模型训练成功为止。在一种称为快速 N$ 分层学习的改进变体中,前向和后向学习被分开考虑,并可能在不同的设备上完成,以获得流水线并行性。执行前向传递的层将输出存储在缓冲区中,供执行后向传递的设备使用。执行后向传递的设备将参数更新信息传递给执行前向传递的设备。如前所述,这一过程一直持续到模型训练成功为止。分析、确定两种方案最佳分割的例程和仿真结果均可作为佐证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信