List-Decodable Coded Computing: Breaking the Adversarial Toleration Barrier
Mahdi Soleymani, Ramy E. Ali, Hessam Mahdavifar, A. Salman Avestimehr

TL;DR
This paper introduces list-decoding techniques for coded computing, enabling the system to tolerate more adversarial workers than previously possible by leveraging side information and novel algorithms.
Contribution
It proposes a new approach using list-decoding and side information to surpass existing adversarial tolerance limits in coded computing.
Findings
FLCC outperforms LCC in adversarial tolerance
Threshold improved by a factor of two asymptotically
Effective use of side information for decoding
Abstract
We consider the problem of coded computing, where a computational task is performed in a distributed fashion in the presence of adversarial workers. We propose techniques to break the adversarial toleration threshold barrier previously known in coded computing. More specifically, we leverage list-decoding techniques for folded Reed-Solomon codes and propose novel algorithms to recover the correct codeword using side information. In the coded computing setting, we show how the master node can perform certain carefully designed extra computations to obtain the side information. The workload of computing this side information is negligible compared to the computations done by each worker. This side information is then utilized to prune the output of the list decoder and uniquely recover the true outcome. We further propose folded Lagrange coded computing (FLCC) to incorporate the developed…
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.
Taxonomy
TopicsWireless Communication Security Techniques · Random Matrices and Applications · Computability, Logic, AI Algorithms
MethodsLipschitz Constant Constraint
