Monday, February 06, 2023, 12:00
- 13:00
Building 9, Level 2, Room 2325, Hall 2
Contact Person
In this work we focus our attention on distributed optimization problems in the context where the communication time between the server and the workers is non-negligible. We obtain novel methods supporting bidirectional compression (both from the server to the workers and vice versa) that enjoy new state-of-the-art theoretical communication complexity for convex and nonconvex problems.