The reviewed record of science sign in
Pith

arxiv: 2405.01067 · v2 · pith:FE7CDMG6 · submitted 2024-05-02 · cs.LG · cs.AI· cs.DC

AB-Training: A Communication-Efficient Approach for Distributed Low-Rank Learning

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:FE7CDMG6record.jsonopen to challenge →

classification cs.LG cs.AIcs.DC
keywords trainingab-trainingdistributedlow-rankcommunicationevennetworktrained
0
0 comments X
read the original abstract

Communication bottlenecks severely hinder the scalability of distributed neural network training, particularly in high-performance computing (HPC) environments. We introduce AB-training, a novel data-parallel method that leverages low-rank representations and independent training groups to significantly reduce communication overhead. Our experiments demonstrate an average reduction in network traffic of approximately 70.31\% across various scaling scenarios, increasing the training potential of communication-constrained systems and accelerating convergence at scale. AB-training also exhibits a pronounced regularization effect at smaller scales, leading to improved generalization while maintaining or even reducing training time. We achieve a remarkable 44.14 : 1 compression ratio on VGG16 trained on CIFAR-10 with minimal accuracy loss, and outperform traditional data parallel training by 1.55\% on ResNet-50 trained on ImageNet-2012. While AB-training is promising, our findings also reveal that large batch effects persist even in low-rank regimes, underscoring the need for further research into optimized update mechanisms for massively distributed training.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.