Data Shuffling in Wireless Distributed Computing via Low-Rank Optimization
Kai Yang, Yuanming Shi, and Zhi Ding

TL;DR
This paper introduces a low-rank optimization approach using a DC algorithm to enhance data shuffling efficiency in wireless distributed computing, enabling better communication among mobile devices for low-latency machine learning applications.
Contribution
It develops a novel DC-based low-rank optimization method to improve interference alignment for data shuffling in wireless distributed systems.
Findings
Significant improvement in communication efficiency.
Achievable degrees-of-freedom remains stable with more devices.
Proposed method outperforms existing approaches.
Abstract
Intelligent mobile platforms such as smart vehicles and drones have recently become the focus of attention for onboard deployment of machine learning mechanisms to enable low latency decisions with low risk of privacy breach. However, most such machine learning algorithms are both computation-and-memory intensive, which makes it highly difficult to implement the requisite computations on a single device of limited computation, memory, and energy resources. Wireless distributed computing presents new opportunities by pooling the computation and storage resources among devices. For low-latency applications, the key bottleneck lies in the exchange of intermediate results among mobile devices for data shuffling. To improve communication efficiency, we propose a co-channel communication model and design transceivers by exploiting the locally computed intermediate values as side information.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
