2018/06/15 by Farzin Haddadpour, Yaoqing Yang, Haddadpour, Farzin +8
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #FOS: Computer and information sciences #Graph Theory and Algorithms #Information Theory (cs.IT) #Matrix Theory and Algorithms #Parallel Computing and Optimization Techniques #Polynomial and algebraic computation #Stochastic Gradient Optimization Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1806.06140
15 pages, 3 figures and 2 tables
arxiv created 2018/06/15 · openalex publication_date 2018/06/15 · arxiv updated 2018/06/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We propose a novel distributed iterative linear inverse solver method. Our method, PolyLin, has significantly lower communication cost, both in terms of number of rounds as well as number of bits, in comparison with the state of the art at the cost of higher computational complexity and storage. Our algorithm also has a built-in resilience to straggling and faulty computation nodes. We develop a natural variant of our main algorithm that trades off communication cost for computational complexity. Our method is inspired by ideas in error correcting codes.