Convergence of AdaGrad for Non-convex Objectives: Simple Proofs and Relaxed Assumptions

We provide a simple convergence proof for AdaGrad optimizing non-convex objectives under only affine noise variance and bounded smoothness assumptions. The proof is essentially based on a novel auxiliary function xi that helps eliminate the complexity of handling the correlation between the numerator and denominator of AdaGrad's update. Leveraging simple proofs, we are able to obtain tighter results than existing results citepfaw2022power and extend the analysis to several new and important cases. Specifically, for the over-parameterized regime, we show that AdaGrad needs only O(frac1varepsilon2) iterations to ensure the gradient norm smaller than varepsilon, which matches the rate of SGD and significantly tighter than existing rates O(frac1varepsilon4) for AdaGrad. We then discard the bounded smoothness assumption and consider a realistic assumption on smoothness called (L0,L1)-smooth condition, which allows local smoothness to grow with the gradient norm. Again based on the auxiliary function xi, we prove that AdaGrad succeeds in converging under (L0,L1)-smooth condition as long as the learning rate is lower than a threshold. Interestingly, we further show that the requirement on learning rate under the (L0,L1)-smooth condition is necessary via proof by contradiction, in contrast with the case of uniform smoothness conditions where convergence is guaranteed regardless of learning rate choices. Together, our analyses broaden the understanding of AdaGrad and demonstrate the power of the new auxiliary function in the investigations of AdaGrad.