The reviewed record of science sign in
Pith

arxiv: 2106.00999 · v1 · pith:RGG6TJ2Z · submitted 2021-06-02 · cs.LG · cs.DC· cs.IT· math.IT

Communication-Efficient Split Learning Based on Analog Communication and Over the Air Aggregation

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

classification cs.LG cs.DCcs.ITmath.IT
keywords communicationbandwidthagentsinferencelimitednumberaggregationdigital
0
0 comments X
read the original abstract

Split-learning (SL) has recently gained popularity due to its inherent privacy-preserving capabilities and ability to enable collaborative inference for devices with limited computational power. Standard SL algorithms assume an ideal underlying digital communication system and ignore the problem of scarce communication bandwidth. However, for a large number of agents, limited bandwidth resources, and time-varying communication channels, the communication bandwidth can become the bottleneck. To address this challenge, in this work, we propose a novel SL framework to solve the remote inference problem that introduces an additional layer at the agent side and constrains the choices of the weights and the biases to ensure over the air aggregation. Hence, the proposed approach maintains constant communication cost with respect to the number of agents enabling remote inference under limited bandwidth. Numerical results show that our proposed algorithm significantly outperforms the digital implementation in terms of communication-efficiency, especially as the number of agents grows large.

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.