Why L2 norm in AdaGrad update equation not L1?
The reason is because the article introducing the method, which can be found here, has proved bounds on the regret function using inequalities about the L2 norm.
The square is also explained by the fact that is the diagonal of some positive quadratic form.
However I don't know if anyone has ever considered using AdaGrag with L1 norm instead of L2.