Research map / Learning theory and algorithms / Sample complexity
Distributed Optimization for Overparameterized Problems: Achieving Optimal Dimension Independent Communication Complexity
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Smoothness Matrices Beat Smoothness Constants: Better Communication Compression Techniques for Distributed Optimization (NeurIPS 2021 · similarity 0.90)
- Towards Faster Decentralized Stochastic Optimization with Communication Compression (ICLR 2025 · similarity 0.90)
- Communication Compression for Decentralized Training (NeurIPS 2018 · similarity 0.90)
- Communication-Efficient Frank-Wolfe Algorithm for Nonconvex Decentralized Distributed Learning (AAAI 2021 · similarity 0.90)
- Accelerated Methods with Compressed Communications for Distributed Optimization Problems Under Data Similarity (AAAI 2025 · similarity 0.90)
- Towards a Better Theoretical Understanding of Independent Subnetwork Training (ICML 2024 · similarity 0.88)
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.