Generating Hierarchical Explanations on Text Classification Without Connecting Rules
Yiming Ju, Yuanzhe Zhang, Kang Liu, Jun Zhao

TL;DR
This paper introduces a novel method for generating hierarchical explanations for text classification models that does not rely on the connecting rule, thereby providing more faithful insights into model decision processes.
Contribution
It proposes a framework for hierarchical explanations without the connecting rule, improving interpretability of deep NLP models.
Findings
Effective in producing high-quality, faithful explanations.
Outperforms existing hierarchical attribution methods.
Provides detailed insights into model decision processes.
Abstract
The opaqueness of deep NLP models has motivated the development of methods for interpreting how deep models predict. Recently, work has introduced hierarchical attribution, which produces a hierarchical clustering of words, along with an attribution score for each cluster. However, existing work on hierarchical attribution all follows the connecting rule, limiting the cluster to a continuous span in the input text. We argue that the connecting rule as an additional prior may undermine the ability to reflect the model decision process faithfully. To this end, we propose to generate hierarchical explanations without the connecting rule and introduce a framework for generating hierarchical clusters. Experimental results and further analysis show the effectiveness of the proposed method in providing high-quality explanations for reflecting model predicting process.
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.
Taxonomy
TopicsTopic Modeling · Explainable Artificial Intelligence (XAI)
