pith. sign in

arxiv: 1703.10722 · v3 · pith:W7PANAWVnew · submitted 2017-03-31 · 💻 cs.CL · cs.NE· stat.ML

Factorization tricks for LSTM networks

classification 💻 cs.CL cs.NEstat.ML
keywords lstmmatrixnetworksfactorizationlargeparameterssignificantlyaccelerating
0
0 comments X
read the original abstract

We present two simple ways of reducing the number of parameters and accelerating the training of large Long Short-Term Memory (LSTM) networks: the first one is "matrix factorization by design" of LSTM matrix into the product of two smaller matrices, and the second one is partitioning of LSTM matrix, its inputs and states into the independent groups. Both approaches allow us to train large LSTM networks significantly faster to the near state-of the art perplexity while using significantly less RNN parameters.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Separable Convolutional LSTMs for Faster Video Segmentation

    cs.CV 2019-07 unverdicted novelty 6.0

    Separable convLSTMs cut parameters and FLOPs in video segmentation, delivering up to 15% faster GPU inference with similar or slightly lower accuracy.

  2. Attention Is All You Need

    cs.CL 2017-06 unverdicted novelty 5.0

    Pith review generated a malformed one-line summary.