Pith. sign in

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

arxiv 1606.05320 v2 pith:7S5M46QU submitted 2016-06-16 stat.ML cs.CLcs.LG

classification stat.MLcs.CLcs.LG
keywords modeltrainedincreasinglstmmodelsnetworksneuralhidden
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Scalable Explanation of Inferences on Large Graphs

    cs.SI 2019-08 conditional novelty 6.0 of 10

    GraphExp extracts small acyclic subgraphs that faithfully reproduce a target node's belief-propagation marginal on large cyclic Markov random fields.

  2. Latent States in Neural Networks: Recovering the Temporal Structure of Drifting Data from Model Weights

    cs.LG 2026-07 conditional novelty 5.0 of 10

    A hidden Markov model fit to aligned per-window classifier weights recovers temporal states, and models transfer better within those states than across boundaries.

  3. A Review of Multimodal Explainable Artificial Intelligence: Past, Present and Future

    cs.CV 2024-12 conditional novelty 4.0 of 10

    A historical review that organizes multimodal explainability methods into four chronological eras and three explainability types, extending coverage to generative LLMs.

Pith tools