atlas

Research map / Optimization / Distributed and compressed

FedSplit: an algorithmic framework for fast federated optimization

NeurIPS 2020 · Optimization › Distributed and compressed · approach: Decentralized optimization algorithms

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use FedSplit instead of FedGDFederated least squares at κ = 10000 · Least squares, κ = 10000iterations to reach ε = 10^-3: 34000 to roughly 400Helped
Use 10 local gradient steps to approximate each FedSplit proximal update (ablation)FedSplit · Logistic regressionoptimality gap: below 10^{-6}Helped
Use 1 or 5 local gradient steps to approximate each FedSplit proximal update (ablation)FedSplit · Logistic regressionoptimality gapHurt
Use 1, 5, or 10 local gradient steps instead of exact proximal updates (ablation)FedSplit · Least squaresoptimality gapHurt
Increase the problem condition numberFedGD and FedSplit · Least squaresiterations to reach ε = 10^-3Mixed
Use multiple local gradient epochs (e > 1) instead of one (ablation)FedGD · Least squaresoptimality gapHurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy