Parameter Compression of Recurrent Neural Networks and Degradation of Short-term Memory
Jonathan A. Cox

TL;DR
This paper investigates how compressing recurrent neural network parameters affects their short-term memory, demonstrating that significant compression is possible but can impair memory depending on data coherence.
Contribution
It introduces a singular value decomposition-based compression method for RNNs and a perturbation model to analyze the impact on memory performance.
Findings
Significant rank reduction is achievable without fine tuning.
Compression effects depend on data's temporal coherence.
The perturbation model predicts memory degradation under compression.
Abstract
The significant computational costs of deploying neural networks in large-scale or resource constrained environments, such as data centers and mobile devices, has spurred interest in model compression, which can achieve a reduction in both arithmetic operations and storage memory. Several techniques have been proposed for reducing or compressing the parameters for feed-forward and convolutional neural networks, but less is understood about the effect of parameter compression on recurrent neural networks (RNN). In particular, the extent to which the recurrent parameters can be compressed and the impact on short-term memory performance, is not well understood. In this paper, we study the effect of complexity reduction, through singular value decomposition rank reduction, on RNN and minimal gated recurrent unit (MGRU) networks for several tasks. We show that considerable rank reduction is…
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.
