Provable Acceleration of Distributed Optimization with Local Updates
This paper rigorously proves that incorporating local updates into the distributed DIGing algorithm can provably accelerate convergence for a broad class of objective functions, demonstrating that two local updates are sufficient to achieve maximal improvement without requiring reduced step sizes.