Research map / Learning theory and algorithms / Sample complexity
Distributed Learning with Sublinear Communication
Jayadev Acharya, Chris De Sa, Dylan Foster, Karthik Sridharan
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 ℓ∞-bounded rather than finite-q-bounded features | Distributed linear learning with ℓ1-bounded weights · ℓ1/ℓ∞-bounded linear models | communication required for optimal excess risk: linear in d | Hurt |
Closest papers by meaning
- Distributed Optimization for Overparameterized Problems: Achieving Optimal Dimension Independent Communication Complexity (NeurIPS 2022 · similarity 0.88)
- Debiased Distributed Learning for Sparse Partial Linear Models in High Dimensions (JMLR 2022 · similarity 0.88)
- Communication trade-offs for Local-SGD with large step size (NeurIPS 2019 · similarity 0.85)
- Distributed Mean Estimation with Limited Communication (ICML 2017 · similarity 0.85)
- Lower Bounds and Nearly Optimal Algorithms in Distributed Learning with Communication Compression (NeurIPS 2022 · similarity 0.84)
- Achieving Dimension-Free Communication in Federated Learning via Zeroth-Order Optimization (ICLR 2025 · similarity 0.83)
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.
