pith. sign in

arxiv: 1606.05320 · v2 · pith:7S5M46QUnew · submitted 2016-06-16 · 📊 stat.ML · cs.CL· cs.LG

Increasing the Interpretability of Recurrent Neural Networks Using Hidden Markov Models

classification 📊 stat.ML cs.CLcs.LG
keywords modeltrainedincreasinglstmmodelsnetworksneuralhidden
0
0 comments X
read the original abstract

As deep neural networks continue to revolutionize various application domains, there is increasing interest in making these powerful models more understandable and interpretable, and narrowing down the causes of good and bad predictions. We focus on recurrent neural networks (RNNs), state of the art models in speech recognition and translation. Our approach to increasing interpretability is by combining an RNN with a hidden Markov model (HMM), a simpler and more transparent model. We explore various combinations of RNNs and HMMs: an HMM trained on LSTM states; a hybrid model where an HMM is trained first, then a small LSTM is given HMM state distributions and trained to fill in gaps in the HMM's performance; and a jointly trained hybrid model. We find that the LSTM and HMM learn complementary information about the features in the text.

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.