Another explanation: Gradient can be viewed as a measure of
the effect of the past on the future. If the gradient becomes vanishingly small over longer distances (step t to step t+n), then we can’t tell whether:
Effect of vanishing gradient on RNN-LM
If the gradient becomes too big, then the SGD update step
becomes too big:
\[
\theta^{\text {new}}=\theta^{\text { old }}-\alpha \nabla_{\theta} J(\theta)
\]
This can cause bad updates: we take too large a step and reach
a bad parameter configuration (with large loss). In the worst case, this will result in Inf or NaN in your network (then you have to restart training from an earlier checkpoint).
Gradient clipping: if the norm of the gradient is greater than
some threshold, scale it down before applying SGD update
Intuition: take a step in the same direction, but a smaller step
The main problem is that it’s too difficult for the RNN to learn to preserve information over many timesteps. In a vanilla RNN, the hidden state is constantly being rewritten:
\[
\boldsymbol{h}^{(t)}=\sigma\left(\boldsymbol{W}_{h} \boldsymbol{h}^{(t-1)}+\boldsymbol{W}_{x} \boldsymbol{x}^{(t)}+\boldsymbol{b}\right)
\]
How does LSTM solve vanishing gradients?
Conclusion: Though vanishing/exploding gradients are a general
problem, RNNs are particularly unstable due to the repeated
multiplication by the same weight matrix
cs224n - Vanishing Gradients and Fancy RNNs
原文:https://www.cnblogs.com/curtisxiao/p/10666150.html