Timezone: »

Revisiting Gradient Clipping: Stochastic bias and tight convergence guarantees
Anastasiia Koloskova · Hadrien Hendrikx · Sebastian Stich

Tue Jul 25 05:00 PM -- 06:30 PM (PDT) @ Exhibit Hall 1 #303
Gradient clipping is a popular modification to standard (stochastic) gradient descent, at every iteration limiting the gradient norm to a certain value $c >0$. It is widely used for example for stabilizing the training of deep learning models (Goodfellow et al., 2016), or for enforcing differential privacy (Abadi et al., 2016). Despite popularity and simplicity of the clipping mechanism, its convergence guarantees often require specific values of $c$ and strong noise assumptions. In this paper, we give convergence guarantees that show precise dependence on arbitrary clipping thresholds $c$ and show that our guarantees are tight with both deterministic and stochastic gradients. In particular, we show that (i) for deterministic gradient descent, the clipping threshold only affects the higher-order terms of convergence, (ii) in the stochastic setting convergence to the true optimum cannot be guaranteed under the standard noise assumption, even under arbitrary small step-sizes. We give matching upper and lower bounds for convergence of the gradient norm when running clipped SGD, and illustrate these results with experiments.

Author Information

Anastasiia Koloskova (EPFL)
Hadrien Hendrikx (EPFL)
Sebastian Stich (CISPA Helmholtz Center for Information Security)

More from the Same Authors