AdaGrad

Author: Daniel Villarraga (SYSEN 6800 Fall 2021)

Introduction

AdaGrad is a family of sub-gradient algorithms for stochastic optimization. The algorithms belonging to that family are similar to second-order stochastic gradient descend with an approximation for the Hessian of the optimized function. AdaGrad's name comes from Adaptative Gradient. Intuitively, it adapts the learning rate for each feature depending on the estimated geometry of the function; additionally, it tends to assign higher learning rates to infrequent features, which ensures that the parameter updates rely less on frequency and more on relevance.

AdaGrad was introduced by Duchi et al. in a highly cited paper published in the Journal of machine learning research in 2011. It is arguably one of the most popular algorithms for machine learning (particularly for training deep neural networks) and it influenced the development of the Adam algorithm.

Theory

The objective of AdaGrad is to minimize the expected value of a stochastic objective function, with respect to a set of parameters, given a sequence of realizations of the function. As with other sub-gradient-based methods, it achieves so by updating the parameters in the opposite direction of the sub-gradients. While standard sub-gradient methods use update rules with step-sizes that ignore the information from the past observations, AdaGrad adapts the learning rate for each parameter individually using the sequence of gradient estimates.

Definitions

$f(x)$: Stochastic objective function with parameters $x$.

$f_{t}(x)$: Realization of stochastic objective at time step $t$. For simplicity $f_{t}$.

$g_{t}(x)$: The gradient of $f_{t}(x)$ with respect to $x$, formally $\nabla _{x}f_{t}(x)$. For simplicity, $g_{t}$.

$x_{t}$: Parameters at time step $t$.

$G_{t}$: The outer product of all previous subgradients, given by ${\textstyle \sum _{\tau =1}^{t}g_{\tau }g_{\tau }^{\top }}$

Standard Sub-gradient Update

Standard sub-gradient algorithms update parameters $x$ according to the following rule:

$$x_{t+1}=x_{t}-\eta g_{t}$$

where $\eta$ denotes the step-size often refered as learning rate. Expanding each term on the previous equation,

$${\begin{bmatrix}x_{t+1}^{(2)}\\x_{t+1}^{(2)}\\\vdots \\x_{t+1}^{(m)}\end{bmatrix}}$$

AdaGrad Update

The general AdaGrad update rule is given by:

$$x_{t+1}=x_{t}-\eta G_{t}^{-1/2}g_{t}$$

where $G_{t}^{-1/2}$ is the inverse of the square root of $G_{t}$. A simplified version of the update rule takes the diagonal elements of $G_{t}$ instead of the whole matrix:

$$x_{t+1}=x_{t}-\eta {\text{diag}}(G_{t})^{-1/2}g_{t}$$

which can be computed in linear time. In practice, a small quantity $\epsilon$ is added to each diagonal element in $G_{t}$ to avoid singularity problems, the resulting update rule is given by:

$$x_{t+1}=x_{t}-\eta {\text{diag}}(\epsilon I+G_{t})^{-1/2}g_{t}$$

where $I$ denotes the identity matrix.