Research map / Optimization / Distributed and compressed
Straggler Mitigation in Distributed Optimization Through Data Encoding
Can Karakus, Yifan Sun, Suhas Diggavi, Wotao Yin
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use Hadamard-coded data instead of uncoded data with distributed L-BFGS | Distributed ridge regression on synthetic data · AWS EC2 cluster, k=12, m=32 | convergence | Improved |
| Reduce the fraction of worker responses awaited to η=0.375 | Distributed ridge regression · AWS EC2 cluster, m=32 | runtime: more than 40% reduction | Improved |
| Use data encoding rather than uncoded data | Distributed L-BFGS · MovieLens 1-M, m=8, k=1 | test RMSE: 0.898 -> 0.873 | Improved |
| Use data encoding rather than replication | Distributed L-BFGS · MovieLens 1-M, m=8, k=1 | test RMSE: 0.889 -> 0.873 | Improved |
| Use data encoding rather than uncoded data | Distributed L-BFGS · MovieLens 1-M, m=8, k=4 | test RMSE: 0.872 -> 0.866 | Improved |
| Use Gaussian encoding rather than replication | Distributed L-BFGS · MovieLens 1-M, m=8, k=4 | test RMSE: 0.872 -> 0.866 | Improved |
| Use Paley ETF encoding rather than uncoded data | Distributed L-BFGS · MovieLens 1-M, m=8, k=6 | test RMSE: 0.866 -> 0.860 | Improved |
| Use Paley ETF encoding rather than replication | Distributed L-BFGS · MovieLens 1-M, m=8, k=6 | test RMSE: 0.871 -> 0.860 | Improved |
| Use Paley ETF encoding rather than uncoded data | Distributed L-BFGS · MovieLens 1-M, m=24, k=3 | test RMSE: 0.902 -> 0.879 | Improved |
| Use Paley ETF encoding rather than replication | Distributed L-BFGS · MovieLens 1-M, m=24, k=3 | test RMSE: 0.893 -> 0.879 | Improved |
| Use Gaussian encoding rather than uncoded data | Distributed L-BFGS · MovieLens 1-M, m=24, k=12 | test RMSE: 0.872 -> 0.866 | Improved |
| Use Gaussian encoding rather than replication | Distributed L-BFGS · MovieLens 1-M, m=24, k=12 | test RMSE: 0.870 -> 0.866 | Improved |
Closest papers by meaning
- Approximate Gradient Coding for Distributed Learning with Heterogeneous Stragglers (NeurIPS 2025 · similarity 0.91)
- Leveraging partial stragglers within gradient coding (NeurIPS 2024 · similarity 0.89)
- Accelerated Methods with Compressed Communications for Distributed Optimization Problems Under Data Similarity (AAAI 2025 · similarity 0.87)
- Scalable Distributed Stochastic Optimization via Bidirectional Compression: Beyond Pessimistic Limits (NeurIPS 2026 · similarity 0.87)
- Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity (NeurIPS 2024 · similarity 0.86)
- Accelerating Distributed Stochastic Optimization via Self-Repellent Random Walks (ICLR 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
