BIRD+:为资源有限的分布式学习平台设计轻量级通信压缩器

IF 5.6 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS
Donglei Wu;Weihao Yang;Xiangyu Zou;Hao Feng;Dingwen Tao;Shiyi Li;Wen Xia;Binxing Fang
{"title":"BIRD+:为资源有限的分布式学习平台设计轻量级通信压缩器","authors":"Donglei Wu;Weihao Yang;Xiangyu Zou;Hao Feng;Dingwen Tao;Shiyi Li;Wen Xia;Binxing Fang","doi":"10.1109/TPDS.2024.3447221","DOIUrl":null,"url":null,"abstract":"The Top-K sparsification-based compression framework is extensively explored for reducing communication costs in distributed learning. However, we identified several issues with existing Top-K sparsification-based compression methods: (\n<i>i</i>\n) The limited compressibility of the Top-K parameter's indexes critically restricts the overall communication compression ratio; (\n<i>ii</i>\n) Several time-consuming compression operations significantly offset the benefits of communication compression; (\n<i>iii</i>\n) The use of error feedback techniques to maintain model quality results in a high memory footprint consumption. To solve these issues, we propose BIRD, a lightweight tensor-wise \n<i>Bi-Random sampling</i>\n strategy with an expectation invariance property. Specifically, BIRD applies a tensor-wise \n<i>index sharing</i>\n mechanism that reduces the index proportion by allowing multiple tensor elements to share a single index, thus improving the overall compression ratio. Additionally, BIRD replaces the time-consuming Top-K sorting with a faster \n<i>Bi-Random sampling</i>\n strategy based on the aforementioned \n<i>index sharing</i>\n mechanism, significantly reducing compression overheads; Moreover, BIRD establishes an \n<i>expectation invariance</i>\n property into the \n<i>Bi-Random sampling</i>\n to ensure an approximate unbiased representation for the \n<inline-formula><tex-math>$L_1$</tex-math></inline-formula>\n-norm of the sampled tensors, effectively maintaining the model quality without incurring extra memory costs. We further optimize BIRD to BIRD+ by introducing the uniform distribution-based sampling and Gamma correction on the tensor-wise sampling process, achieving a more flexibly adjustment of the sparsity with better convergence performance. Experimental evaluations across multiple conventional distributed learning tasks demonstrate that compared to state-of-the-art approaches, BIRD+ achieves higher communication compression ratios up to 36.2\n<inline-formula><tex-math>$\\times$</tex-math></inline-formula>\n and higher computation throughput up to 149.6\n<inline-formula><tex-math>$\\times$</tex-math></inline-formula>\n while maintaining the model quality without incurring extra memory costs.","PeriodicalId":13257,"journal":{"name":"IEEE Transactions on Parallel and Distributed Systems","volume":"35 11","pages":"2193-2207"},"PeriodicalIF":5.6000,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"BIRD+: Design of a Lightweight Communication Compressor for Resource-Constrained Distribution Learning Platforms\",\"authors\":\"Donglei Wu;Weihao Yang;Xiangyu Zou;Hao Feng;Dingwen Tao;Shiyi Li;Wen Xia;Binxing Fang\",\"doi\":\"10.1109/TPDS.2024.3447221\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Top-K sparsification-based compression framework is extensively explored for reducing communication costs in distributed learning. However, we identified several issues with existing Top-K sparsification-based compression methods: (\\n<i>i</i>\\n) The limited compressibility of the Top-K parameter's indexes critically restricts the overall communication compression ratio; (\\n<i>ii</i>\\n) Several time-consuming compression operations significantly offset the benefits of communication compression; (\\n<i>iii</i>\\n) The use of error feedback techniques to maintain model quality results in a high memory footprint consumption. To solve these issues, we propose BIRD, a lightweight tensor-wise \\n<i>Bi-Random sampling</i>\\n strategy with an expectation invariance property. Specifically, BIRD applies a tensor-wise \\n<i>index sharing</i>\\n mechanism that reduces the index proportion by allowing multiple tensor elements to share a single index, thus improving the overall compression ratio. Additionally, BIRD replaces the time-consuming Top-K sorting with a faster \\n<i>Bi-Random sampling</i>\\n strategy based on the aforementioned \\n<i>index sharing</i>\\n mechanism, significantly reducing compression overheads; Moreover, BIRD establishes an \\n<i>expectation invariance</i>\\n property into the \\n<i>Bi-Random sampling</i>\\n to ensure an approximate unbiased representation for the \\n<inline-formula><tex-math>$L_1$</tex-math></inline-formula>\\n-norm of the sampled tensors, effectively maintaining the model quality without incurring extra memory costs. We further optimize BIRD to BIRD+ by introducing the uniform distribution-based sampling and Gamma correction on the tensor-wise sampling process, achieving a more flexibly adjustment of the sparsity with better convergence performance. Experimental evaluations across multiple conventional distributed learning tasks demonstrate that compared to state-of-the-art approaches, BIRD+ achieves higher communication compression ratios up to 36.2\\n<inline-formula><tex-math>$\\\\times$</tex-math></inline-formula>\\n and higher computation throughput up to 149.6\\n<inline-formula><tex-math>$\\\\times$</tex-math></inline-formula>\\n while maintaining the model quality without incurring extra memory costs.\",\"PeriodicalId\":13257,\"journal\":{\"name\":\"IEEE Transactions on Parallel and Distributed Systems\",\"volume\":\"35 11\",\"pages\":\"2193-2207\"},\"PeriodicalIF\":5.6000,\"publicationDate\":\"2024-08-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Parallel and Distributed Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10643365/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Parallel and Distributed Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10643365/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

为降低分布式学习中的通信成本,基于 Top-K 稀疏化的压缩框架得到了广泛探索。然而,我们发现现有的基于 Top-K 稀疏化的压缩方法存在几个问题:(i) Top-K 参数索引的可压缩性有限,严重限制了整体通信压缩率;(ii) 一些耗时的压缩操作大大抵消了通信压缩的好处;(iii) 使用误差反馈技术来保持模型质量会消耗大量内存。为了解决这些问题,我们提出了具有期望不变性的轻量级张量双随机抽样策略 BIRD。具体来说,BIRD 采用了一种张量索引共享机制,通过允许多个张量元素共享一个索引来降低索引比例,从而提高整体压缩率。此外,BIRD 在上述索引共享机制的基础上采用了更快的双随机抽样策略,取代了耗时的 Top-K 排序,大大减少了压缩开销;而且,BIRD 在双随机抽样中建立了期望不变性属性,以确保对抽样张量的 $L_1$-norm 进行近似无偏表示,从而在不产生额外内存成本的情况下有效保持了模型质量。通过引入基于均匀分布的采样和张量采样过程中的伽马修正,我们进一步将 BIRD 优化为 BIRD+,实现了更灵活的稀疏性调整和更好的收敛性能。多个传统分布式学习任务的实验评估表明,与最先进的方法相比,BIRD+ 实现了更高的通信压缩比,最高可达 36.2 美元/次,计算吞吐量最高可达 149.6 美元/次,同时保持了模型质量,不会产生额外的内存成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
BIRD+: Design of a Lightweight Communication Compressor for Resource-Constrained Distribution Learning Platforms
The Top-K sparsification-based compression framework is extensively explored for reducing communication costs in distributed learning. However, we identified several issues with existing Top-K sparsification-based compression methods: ( i ) The limited compressibility of the Top-K parameter's indexes critically restricts the overall communication compression ratio; ( ii ) Several time-consuming compression operations significantly offset the benefits of communication compression; ( iii ) The use of error feedback techniques to maintain model quality results in a high memory footprint consumption. To solve these issues, we propose BIRD, a lightweight tensor-wise Bi-Random sampling strategy with an expectation invariance property. Specifically, BIRD applies a tensor-wise index sharing mechanism that reduces the index proportion by allowing multiple tensor elements to share a single index, thus improving the overall compression ratio. Additionally, BIRD replaces the time-consuming Top-K sorting with a faster Bi-Random sampling strategy based on the aforementioned index sharing mechanism, significantly reducing compression overheads; Moreover, BIRD establishes an expectation invariance property into the Bi-Random sampling to ensure an approximate unbiased representation for the $L_1$ -norm of the sampled tensors, effectively maintaining the model quality without incurring extra memory costs. We further optimize BIRD to BIRD+ by introducing the uniform distribution-based sampling and Gamma correction on the tensor-wise sampling process, achieving a more flexibly adjustment of the sparsity with better convergence performance. Experimental evaluations across multiple conventional distributed learning tasks demonstrate that compared to state-of-the-art approaches, BIRD+ achieves higher communication compression ratios up to 36.2 $\times$ and higher computation throughput up to 149.6 $\times$ while maintaining the model quality without incurring extra memory costs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems 工程技术-工程:电子与电气
CiteScore
11.00
自引率
9.40%
发文量
281
审稿时长
5.6 months
期刊介绍: IEEE Transactions on Parallel and Distributed Systems (TPDS) is published monthly. It publishes a range of papers, comments on previously published papers, and survey articles that deal with the parallel and distributed systems research areas of current importance to our readers. Particular areas of interest include, but are not limited to: a) Parallel and distributed algorithms, focusing on topics such as: models of computation; numerical, combinatorial, and data-intensive parallel algorithms, scalability of algorithms and data structures for parallel and distributed systems, communication and synchronization protocols, network algorithms, scheduling, and load balancing. b) Applications of parallel and distributed computing, including computational and data-enabled science and engineering, big data applications, parallel crowd sourcing, large-scale social network analysis, management of big data, cloud and grid computing, scientific and biomedical applications, mobile computing, and cyber-physical systems. c) Parallel and distributed architectures, including architectures for instruction-level and thread-level parallelism; design, analysis, implementation, fault resilience and performance measurements of multiple-processor systems; multicore processors, heterogeneous many-core systems; petascale and exascale systems designs; novel big data architectures; special purpose architectures, including graphics processors, signal processors, network processors, media accelerators, and other special purpose processors and accelerators; impact of technology on architecture; network and interconnect architectures; parallel I/O and storage systems; architecture of the memory hierarchy; power-efficient and green computing architectures; dependable architectures; and performance modeling and evaluation. d) Parallel and distributed software, including parallel and multicore programming languages and compilers, runtime systems, operating systems, Internet computing and web services, resource management including green computing, middleware for grids, clouds, and data centers, libraries, performance modeling and evaluation, parallel programming paradigms, and programming environments and tools.
×
引用
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学术官方微信