Research map / Federated learning and privacy / Communication-efficient FL
Faster federated optimization under second-order similarity
Ahmed Khaled, Chi Jin
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 |
|---|---|---|---|
| Replace the smoothness dependence with second-order similarity in the SVRP communication bound | SVRP compared with SVRG · Federated optimization under second-order similarity | communication complexity: \frac{L}{\mu} -> \frac{\delta^2}{\mu^2} | Improved |
| Use stochastic proximal point updates rather than SGD updates | SPPM · SPPM stochastic expectation problem | iteration complexity: K_{\mathrm{SGD}} = \left( \frac{2 L}{\mu} + \frac{2 \sigma_{*}^2}{\mu^2 \epsilon} \right) \log \left( \frac{2 \sqn{x_0 - | Improved |
Closest papers by meaning
- Stabilized Proximal-Point Methods for Federated Optimization (NeurIPS 2024 · similarity 0.91)
- Federated Optimization with Doubly Regularized Drift Correction (ICML 2024 · similarity 0.89)
- SILVER: Single-loop variance reduction and application to federated learning (ICML 2024 · similarity 0.88)
- Exact and Linear Convergence for Federated Learning under Arbitrary Client Participation is Attainable (NeurIPS 2025 · similarity 0.88)
- Scaffold with Stochastic Gradients: New Analysis with Linear Speed-Up (ICML 2025 · similarity 0.88)
- Decentralized Sporadic Federated Learning: A Unified Algorithmic Framework with Convergence Guarantees (ICLR 2025 · 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.
