An Improved Time Feedforward Connections Recurrent Neural Networks
Jin Wang, Yongsong Zou, Se-Jung Lim

TL;DR
This paper introduces TFC-SGRU, an improved RNN model with enhanced long-term memory and reduced complexity, outperforming LSTM and GRU in language processing tasks.
Contribution
The paper proposes a novel TFC-SGRU model combining time feedforward connections and a new cell structure to improve long-term dependence and reduce computational complexity.
Findings
TFC-SGRU captures long-term dependencies effectively.
It filters noise better than traditional RNNs.
It outperforms LSTM and GRU in accuracy.
Abstract
Recurrent Neural Networks (RNNs) have been widely applied to deal with temporal problems, such as flood forecasting and financial data processing. On the one hand, traditional RNNs models amplify the gradient issue due to the strict time serial dependency, making it difficult to realize a long-term memory function. On the other hand, RNNs cells are highly complex, which will significantly increase computational complexity and cause waste of computational resources during model training. In this paper, an improved Time Feedforward Connections Recurrent Neural Networks (TFC-RNNs) model was first proposed to address the gradient issue. A parallel branch was introduced for the hidden state at time t-2 to be directly transferred to time t without the nonlinear transformation at time t-1. This is effective in improving the long-term dependence of RNNs. Then, a novel cell structure named…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Neural Networks and Reservoir Computing · Computational Physics and Python Applications
MethodsTanh Activation · Gated Recurrent Unit · Sigmoid Activation · Long Short-Term Memory
