PE: A Poincare Explanation Method for Fast Text Hierarchy Generation
Not on the map. Why?
Abstract (arXiv)
The black-box nature of deep learning models in NLP hinders their widespread application. The research focus has shifted to Hierarchical Attribution (HA) for its ability to model feature interactions. Recent works model non-contiguous combinations with a time-costly greedy search in Eculidean spaces, neglecting underlying linguistic information in feature representations. In this work, we introduce a novel method, namely Poincare Explanation (PE), for modeling feature interactions with hyperbolic spaces in a time efficient manner. Specifically, we take building text hierarchies as finding spanning trees in hyperbolic spaces. First we project the embeddings into hyperbolic spaces to elicit inherit semantic and syntax hierarchical structures. Then we propose a simple yet effective strategy to calculate Shapley score. Finally we build the the hierarchy with proving the constructing process in the projected space could be viewed as building a minimum spanning tree and introduce a time efficient building algorithm. Experimental results demonstrate the effectiveness of our approach.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 32 of its 47 references that are in the map. First posted on arXiv 25 Mar 2024.
Builds on
32 of 47 references.
References · 32
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2017Axiomatic Attribution for Deep Networkscited by 3,350
- 2017Prototypical Networks for Few-shot Learningcited by 3,001
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
- 2017Learning Important Features Through Propagating Activation Differencescited by 1,454
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,307
- 2018A Survey Of Methods For Explaining Black Box Modelscited by 970
- 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 863
- 2020Quantifying Attention Flow in Transformerscited by 759
- 2019ERASER: A Benchmark to Evaluate Rationalized NLP Modelscited by 523
20 more
- 2018Hyperbolic Neural Networkscited by 393
- 2016Not Just a Black Box: Learning Important Features Through Propagating Activation Differencescited by 295
- 2019The Shapley Taylor Interaction Indexcited by 143
- 2020Geoopt: Riemannian Optimization in PyTorchcited by 109
- 2021Sampling Permutations for Shapley Value Estimationcited by 101
- 2020How does this interaction affect me? Interpretable attribution for feature interactionscited by 73
- 2018Hierarchical interpretations for neural network predictionscited by 66
- 2015A cost function for similarity-based hierarchical clusteringcited by 63
- 2022Measuring the Mixing of Contextual Information in the Transformercited by 63
- 2020Generating Hierarchical Explanations on Text Classification via Feature Interaction Detectioncited by 57
- 2023Sequential Integrated Gradients: a simple but effective method for explaining language modelscited by 52
- 2021Discretized Integrated Gradients for Explaining Language Modelscited by 45
- 2023DecompX: Explaining Transformers Decisions by Propagating Token Decompositioncited by 31
- 2022Sparse Interaction Additive Networks via Feature Interaction Detection and Sparse Selectioncited by 28
- 2019Towards Hierarchical Importance Attribution: Explaining Compositional Semantics for Neural Sequence Modelscited by 26
- 2020An Analysis of LIME for Text Datacited by 25
- 2020Investigating Saturation Effects in Integrated Gradientscited by 22
- 2023Explanations of Black-Box Models based on Directional Feature Interactionscited by 15
- 2018An Improved Cost Function for Hierarchical Cluster Treescited by 10
- 2023Asymmetric feature interaction for interpreting model predictionscited by 1
Built on by
Not cited yet.