Private and Rateless Adaptive Coded Matrix-Vector Multiplication
Rawad Bitar, Yuxuan Xing, Yasaman Keshtkarjahromi, Venkat, Dasari, Salim El Rouayheb, Hulya Seferoglu

TL;DR
This paper introduces PRAC, a private and adaptive coded computation algorithm for matrix-vector multiplication at the edge, addressing privacy and resource heterogeneity in IoT environments.
Contribution
It presents a novel rateless adaptive coded computation method that ensures privacy and efficiently handles heterogeneous, time-varying edge device resources.
Findings
PRAC outperforms existing secure coded computing methods in heterogeneous settings.
Theoretical guarantees demonstrate PRAC's effectiveness and efficiency.
Simulations and Android implementations validate the practical benefits of PRAC.
Abstract
Edge computing is emerging as a new paradigm to allow processing data near the edge of the network, where the data is typically generated and collected. This enables critical computations at the edge in applications such as Internet of Things (IoT), in which an increasing number of devices (sensors, cameras, health monitoring devices, etc.) collect data that needs to be processed through computationally intensive algorithms with stringent reliability, security and latency constraints. Our key tool is the theory of coded computation, which advocates mixing data in computationally intensive tasks by employing erasure codes and offloading these tasks to other devices for computation. Coded computation is recently gaining interest, thanks to its higher reliability, smaller delay, and lower communication costs. In this paper, we develop a private and rateless adaptive coded computation…
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.
