__ Summary and Contributions__: The paper proposes a new version of Local-SGD/Federated Averaging algorithm -- Federated Accelerated SGD (FedAc). In particular, the algorithm solves a smooth convex expectation minimization problem in a distributed/federated fashion: M workers in parallel can access the stochastic gradients of the objective function and periodically communicate with a parameter-server.
FedAc is a combination of AC-SA method from (Ghadimi and Lan, 2012) and Federated Averaging. Authors propose a first analysis of this method for generally strongly convex functions (in the convex case this method was analyzed in (Woodworth et al., 2020), but only for quadratic objectives) under the assumption that the variance of the stochastic gradients is uniformly bounded. The derived bounds outperform the state-of-the-art result for federated methods in this setting, and these rates are close to the accelerated ones.
Moreover, authors show how their bounds improve under the additional assumption that the Hessian is Lipschitz continuous, and the 4-th central moment of the stochastic gradient is bounded and also extended known results for Local-SGD (FedAvg) to this case.
Finally, using the l_2-penalization technique, which is a well-known trick, authors extend the obtained results to the case of generally convex functions without strong convexity.
==========After Reading the Response=============
I have read the response and other reviews. I want to thank the authors for their response. Despite some weaknesses of the paper like big logarithmical factors in the bounds, the analysis of the convex case through the lens of l_2-penalization, and the assumption about the homogeneity of the data, I find the main contribution of the paper significant enough to be accepted to NeurIPS. Therefore, I want to keep my initial score (7) and thank the authors for the interesting paper.

__ Strengths__: 1. The first (almost) accelerated method with infrequent communications in the case of homogeneous data and uniformly bounded variance of the stochastic gradient. This is a significant contribution since it makes a first step towards developing optimal federated methods. However, the obtained bound for the proposed method is worse than expected from accelerated method at least in exponentially decaying term: the extra squared root of K (number of local steps between two consequent communications) is needed to obtain acceleration in the usual sense. For example, in the case when the objective function is quadratic one can apply the restarts technique for Local-AC-SA and using Corollary 1 from (Woodworth et al., 2020) one can get the exponentially decaying term of order exp(-\sqrt{\mu/L}T).
2. Clear comparison with the state-of-the-art results in these settings with explicit convergence rates.

__ Weaknesses__: 1. Convex case (without strong convexity) is considered through the lens of l_2-penalization. This trick allows to reduce the convex case to the strongly convex case and apply the result for the strongly convex case. However, this technique requires a particular choice of penalization parameter. That is, to use this method in practice, one should additionally tune the penalization parameter. Furthermore, this technique gives extra logarithmical factors in the complexity bounds.
2. Homogeneous data. Typically, in this case, the analysis becomes simpler, and federated methods perform very well. In some sense, it was not surprising that acceleration works well in this setting. However, a much more interesting case is the case of heterogeneous data.
3. The uniformly bounded variance of the stochastic gradients. Despite the fact that this is assumption was widely used in the stochastic optimization literature, it is quite restrictive. It would be interesting to investigate the milder assumption on noise.

__ Correctness__: Unfortunatelly, I didn't have enough time to check all the proofs, but the results seem to be reasonable.

__ Clarity__: The paper uses accurate claims and many aspects of the work are shown explicitly which is very important for theoretical paper. This makes the work easy to follow.

__ Relation to Prior Work__: The most relevant literature is clearly discussed. However, I was surprised that in lines 97-98 authors do not mention the following works on quantization:
1. Dan Alistarh, Demjan Grubic, Jerry Li, Ryota Tomioka, and Milan Vojnovic. QSGD: Communication-efficient SGD via gradient quantization and encoding. In Advances in Neural Information Processing Systems, pages 1709–1720, 2017.
2. Wei Wen, Cong Xu, Feng Yan, Chunpeng Wu, Yandan Wang, Yiran Chen, and Hai Li. Terngrad: Ternary gradients to reduce communication in distributed deep learning. In Advances in Neural Information Processing Systems, pages 1509–1519, 2017.
3. Mishchenko, K., Gorbunov, E., Takáč, M. and Richtárik, P., 2019. Distributed learning with compressed gradient differences. arXiv preprint arXiv:1901.09269.

__ Reproducibility__: Yes

__ Additional Feedback__: 1. line 39: it would be nice to notice that (Woodworth et al., 2020) analyzed Local-AC-SA for quadratic problems as well.
2. For logistic regression one can evaluate smoothness constant L for each individual function in the sum and for the total loss as well. Therefore, one can choose \lambda to be explictly proportional to L. It will clarify what is the actual condition number of the problem.
3. Why do you test only FedAc-I in the experimental part? Have you tried to conduct experiments with Fed-Ac-II? Does it really give better communication complexity than FedAc-I in your experiments?

__ Summary and Contributions__: This paper explores a principled acceleration for federated learning. The theoretical results show that acceleration can significantly improve the communication efficiency in the federated learning context. The supplementary gives complete analysis.

__ Strengths__: I appreciate this work for the combination of acceleration into the federated learning context. I think the improvement for the synchronization R is very significant theoretically despite many large constants and polylog factors. In the
appendix, the authors show a systematic analysis.

__ Weaknesses__: This is a convex paper, but is full of the style of nonconvex ones. In nonconvex optimization, we are tolerated for large constants and polylog factors, but in the convex setting, it is often the case that the analysis can be very elegant and tight.
In my experience, convex analys is often so tight that the effect of the constants in the convergence bound can be found in experiments. As a researcher mainly in convex area, I think the bounds have many undesired terms such as exp(18) and polylog^4, etc. I strongly believe such terms are not essential. Meanwhile, in the main body, if the authors can not cancel these strange terms, I recommend the authors do not use tilde(O) to hide any log factors or large constants, which I believe is not the style for convex analysis.
Again, for convex optimizationk, I should emphasize that log factors are significant. If we do not consider log factors, studying the general convex setting is meaningless as the log suboptimal result can always be derived from the strongly convex setting.
I think the treatment for the general convex setting by regularization is not very careful.
This paper considers the stochastic optimization setting with infinite data assumption. However, as the experiment shows the data is large scale but is often finite. Can author also compare with distributed finite sum solvers in experiments?

__ Correctness__: I am not quite sure about the correctness of Theorems 2 and 3. For quadratic function, Q = 0, so the term about the stochastic variance is independent from R. Is it correct?

__ Clarity__: I recommend authors not to hide logfactors in the main body.

__ Relation to Prior Work__: Clearly discussed.

__ Reproducibility__: Yes

__ Additional Feedback__:

__ Summary and Contributions__: This paper proposed an accelerated variant of FedAvg, where the acceleration technique is applied to the updates of local variables. The convergence property of this algorithm is analyzed, which suggests the convergence rate and the required number of synchronization are better than FedAvg. Experiments also proved its efficiency.

__ Strengths__: The theory in this work is sound, and the theoretical bound is better than existing related methods.

__ Weaknesses__: Though this paper developed theoretical bounds better than existing methods, the insights of these bounds are lacked, e.g., why this bound looks like this, what each term intuitively implies, which part of improvement is contributed by acceleration technique. Just showing "our bound is better than others" is not good enough and may limit the impact of the paper.

__ Correctness__: Yes.

__ Clarity__: The algorithm and experiment parts are easy to read. But more explanation and discussion are needed for the theoretical results.

__ Relation to Prior Work__: Yes.

__ Reproducibility__: Yes

__ Additional Feedback__: I think it is better to compare the theoretical bounds with more existing works, such as accelerated distributed SGD. I am curious how much communication costs can be saved by communicating every K iterations instead of every iteration.
In line 10 of Algorithm 1, the meaning of $m$ is ambiguous. it is better to use another symbol in the summations.
==========After Authors' Rebuttal=============
I have read authors' feedback, and decided to raise my score.

__ Summary and Contributions__: This work propose a new Accelerated Stochastic Gradient Descent for Federated learning setting. The algorithm is based on ASGD from Ghadimi and Lan (2012) and has been proved theoretically to achieve a significant lower synchronization rounds over FEDAVG for strongly convex and convex setting. Numerical experiments are provided to verify the theoretical results.

__ Strengths__: As far as I know, this is the first provable acceleration of FED-AVG. Since federated learning is more and more popular this year, I believe NeuRIPS community will be interested. The technique it uses is of independent interest.

__ Weaknesses__: The convergence analysis is still limited to convex functions but the authors conjecture that Fed-AC can be generalized to non-convex cases. Does that mean we can implement accelerated sgd in nonconvex settings such as that in (Ghadimi and Lan 2013) to Federated learning setting and gain performance improvement? Please provide more comments and details.
The authors feedback has addressed my concern.
Ghadimi and Lan 2013: Accelerated Gradient Methods for Nonconvex Nonlinear and Stochastic Programming

__ Correctness__: The analysis looks sound to me.

__ Clarity__: Yeah, very clear.

__ Relation to Prior Work__: Yes. The authors provide very detailed literature review.

__ Reproducibility__: Yes

__ Additional Feedback__: