Before revision:  We also propose the non-accelerated VR based EXTRA and DIGing, and provide explicit complexities, for example, the O(( \kappa_s +n)\log\frac{1}{\epsilon}) stochastic gradient computation complexity and the O((\kappa_b+\kappa_c) \log\frac{1}{\epsilon}) communication complexity for the VR based EXTRA. The two complexities are also the same as the ones of single-machine  VR methods, such as SAG, SAGA, and SVRG, and the non-accelerated full batch decentralized methods, such as EXTRA, respectively .
After revision:  We also propose the non-accelerated VR based EXTRA and DIGing, and provide explicit complexities, for example, the O(( \kappa_s +n)\log\frac{1}{\epsilon}) stochastic gradient computation complexity and the O((\kappa_b+\kappa_c) \log\frac{1}{\epsilon}) communication complexity . Our stochastic gradient computation complexity is also the same as the ones of single-machine VR methods, such as SAG, SAGA, and SVRG, and the non-accelerated full batch decentralized methods, such as EXTRA, respectively .