CANITA: Faster Rates for Distributed Convex Optimization with Communication Compression

Due to the high communication cost in distributed and federated learning, methods relying on compressed communication are becoming increasingly popular. Besides, the best theoretically and practically performing gradient-type methods invariably rely on some form of acceleration/momentum to reduce the number of communications (faster convergence), e.g., Nesterov's accelerated gradient descent (Nesterov, 1983, 2004) and Adam (Kingma and Ba, 2014). In order to combine the benefits of communication compression and convergence acceleration, we propose a compressed and accelerated gradient method based on ANITA (Li, 2021) for distributed optimization, which we call CANITA. Our CANITA achieves the first accelerated rate Obigg(√Big(1+√fracω3nBig)fracLε + ωbig(frac1εbig)^frac13bigg), which improves upon the state-of-the-art non-accelerated rate Oleft((1+fracωn)fracLε + fracω2+ωω+nfrac1εright) of DIANA (Khaled et al., 2020) for distributed general convex problems, where ε is the target error, L is the smooth parameter of the objective, n is the number of machines/devices, and ω is the compression parameter (larger ω means more compression can be applied, and no compression implies ω=0). Our results show that as long as the number of devices n is large (often true in distributed/federated learning), or the compression ω is not very high, CANITA achieves the faster convergence rate OBig(√fracLεBig), i.e., the number of communication rounds is OBig(√fracLεBig) (vs. Obig(fracLεbig) achieved by previous works). As a result, CANITA enjoys the advantages of both compression (compressed communication in each round) and acceleration (much fewer communication rounds).