Provides tight convergence analyses for EF and EF21 error feedback algorithms in distributed optimization, recovering single-agent rates independently of agent count.
Analysis and design of first-order distributed optimization algorithms over time-varying graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Tight Theory of Error Feedback Algorithms in Distributed Optimization
Provides tight convergence analyses for EF and EF21 error feedback algorithms in distributed optimization, recovering single-agent rates independently of agent count.