REVIEW 3 cited by
Increasing the Interpretability of Recurrent Neural Networks Using Hidden Markov Models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 3 Pith papers
-
Scalable Explanation of Inferences on Large Graphs
GraphExp extracts small acyclic subgraphs that faithfully reproduce a target node's belief-propagation marginal on large cyclic Markov random fields.
-
Latent States in Neural Networks: Recovering the Temporal Structure of Drifting Data from Model Weights
A hidden Markov model fit to aligned per-window classifier weights recovers temporal states, and models transfer better within those states than across boundaries.
-
A Review of Multimodal Explainable Artificial Intelligence: Past, Present and Future
A historical review that organizes multimodal explainability methods into four chronological eras and three explainability types, extending coverage to generative LLMs.
Discussion (0). Continue with ORCID to comment.