Review for NeurIPS paper: Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping

Weaknesses: * In [71] there are several theoretical guarantees both for convex and non-convex cases. I am wondering why they are not mentioned in Table 2. On the other hand, their analysis also covers the case where the domain doesn't need to be compact. Doesn't this reduce the novelty of this paper? I am willing to increase my grade if this concern is addressed. It would be interesting to see a comparison between the results in this paper and theirs.