Restricted Recurrent Neural Networks

Abstract

Recurrent Neural Network (RNN) and its variations such as Long Short-Term Memory (LSTM) and Gated Recurrent Unit (GRU), have become standard building blocks for learning online data of sequential nature in many research areas, including natural language processing and speech data analysis. In this paper, we present a new methodology to significantly reduce the number of parameters in RNNs while maintaining performance that is comparable or even better than classical RNNs. The new proposal, referred to as Restricted Recurrent Neural Network (RRNN), restricts the weight matrices corresponding to the input data and hidden states at each time step to share a large proportion of parameters. The new architecture can be regarded as a compression of its classical counterpart, but it does not require pre-training or sophisticated parameter fine-tuning, both of which are major issues in most existing compression techniques. Experiments on natural language modeling show that compared with its cla

Stats

• citations9
• S2 citations—
• github stars0
• HF likes0
• heat score7.50
• arxiv keydiao2019restricted

Related papers

• Learning Compact Recurrent Neural Networks (2016)0.00
• Memory Visualization For Gated Recurrent Neural Networks In Speech Recognition (2016)11.76
• Improving Speech Recognition By Revising Gated Recurrent Units (2017)11.19
• High Order Recurrent Neural Networks For Acoustic Modelling (2018)8.60
• Light Gated Recurrent Units For Speech Recognition (2018)18.90
• A Fully Tensorized Recurrent Neural Network (2020)0.00
• Residual Memory Networks: Feed-forward Approach To Learn Long Temporal Dependencies (2018)7.16
• Persistent Hidden States And Nonlinear Transformation For Long Short-term Memory (2018)8.09