Adaptive-saturated RNN: Remember more with less instability

Orthogonal parameterization is a compelling solution to the vanishing gradient problem (VGP) in recurrent neural networks (RNNs). With orthogonal parameters and non-saturated activation functions, gradients in such models are constrained to unit norms. On the other hand, although the traditional vanilla RNNs are seen to have higher memory capacity, they suffer from the VGP and perform badly in many applications. This work proposes Adaptive-Saturated RNNs (asRNN), a variant that dynamically adjusts its saturation level between the two mentioned approaches. Consequently, asRNN enjoys both the capacity of a vanilla RNN and the training stability of orthogonal RNNs. Our experiments show encouraging results of asRNN on challenging sequence learning benchmarks compared to several strong competitors. The research code is accessible at https://github.com/ndminhkhoi46/asRNN/.

PDF Abstract ICLR 2023 2023 PDF ICLR 2023 2023 Abstract
Task Dataset Model Metric Name Metric Value Global Rank Result Benchmark
Sequential Image Classification Sequential MNIST Adaptive-saturated RNN Unpermuted Accuracy 99.3% # 12
Permuted Accuracy 96.96% # 15

Methods


No methods listed for this paper. Add relevant methods here