Approximate Distributed Coded Computing: Polynomial Codes and Randomized Sketching
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914571679170560 |
|---|---|
| author | Charalambides, Neophytos Mazumdar, Arya |
| author_facet | Charalambides, Neophytos Mazumdar, Arya |
| contents | Coded computing is a distributed paradigm that uses coding theory to introduce \textit{redundancy} and overcome bottlenecks in large-scale systems. In the same vein, randomized numerical linear algebra employs probabilistic methods to \textit{compress} and accelerate linear algebraic operations, addressing challenges in high-dimensional data analysis. This article reviews the foundations of both fields and presents distributed schemes that combine techniques from both to speed up optimization and machine learning algorithms, in the presence of slow or non-responsive servers. Along the way, we touch on various related topics and mathematical concepts. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_16744 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Approximate Distributed Coded Computing: Polynomial Codes and Randomized Sketching Charalambides, Neophytos Mazumdar, Arya Distributed, Parallel, and Cluster Computing Information Retrieval Signal Processing 68W20, 65F10, 65F55, 68Q25, 94A12, 94B05, 94B35 G.1.3; F.2.2; G.3; C.2.4; E.4; G.2.1 Coded computing is a distributed paradigm that uses coding theory to introduce \textit{redundancy} and overcome bottlenecks in large-scale systems. In the same vein, randomized numerical linear algebra employs probabilistic methods to \textit{compress} and accelerate linear algebraic operations, addressing challenges in high-dimensional data analysis. This article reviews the foundations of both fields and presents distributed schemes that combine techniques from both to speed up optimization and machine learning algorithms, in the presence of slow or non-responsive servers. Along the way, we touch on various related topics and mathematical concepts. |
| title | Approximate Distributed Coded Computing: Polynomial Codes and Randomized Sketching |
| topic | Distributed, Parallel, and Cluster Computing Information Retrieval Signal Processing 68W20, 65F10, 65F55, 68Q25, 94A12, 94B05, 94B35 G.1.3; F.2.2; G.3; C.2.4; E.4; G.2.1 |
| url | https://arxiv.org/abs/2605.16744 |