Before revision:   We show that C-GT inherits the advantages of gradient tracking-based algorithms , and in particular, achieves linear convergence rate for strongly convex and smooth objective functions.
After revision:  In particular, C-GT is compatible with a general class of compression operators that unifies both unbiased and biased compressors. We show that C-GT inherits the advantages of gradient tracking-based algorithms , and in particular, achieves linear convergence rate for strongly convex and smooth objective functions.