Combines polynomial codes and randomized sketching into approximate distributed schemes that mitigate stragglers during optimization and machine learning tasks.
Straggler Mitigation in Distributed Matrix Multi- plication: Fundamental Limits and Optimal Coding,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Approximate Distributed Coded Computing: Polynomial Codes and Randomized Sketching
Combines polynomial codes and randomized sketching into approximate distributed schemes that mitigate stragglers during optimization and machine learning tasks.