Learning and Evaluating Sparse Interpretable Sentence Embeddings
Valentin Trifonov, Octavian-Eugen Ganea, Anna Potapenko, Thomas, Hofmann

TL;DR
This paper explores methods to create sparse, interpretable sentence embeddings, introduces a new evaluation metric for interpretability, and demonstrates increased interpretability over dense models on dialog and scene description datasets.
Contribution
It adapts sparse embedding techniques to sentences, proposes an automated interpretability metric, and empirically shows improved interpretability over dense embeddings.
Findings
Sparse sentence embeddings are more interpretable.
The new metric effectively measures interpretability.
Sparse models outperform dense ones in interpretability on tested datasets.
Abstract
Previous research on word embeddings has shown that sparse representations, which can be either learned on top of existing dense embeddings or obtained through model constraints during training time, have the benefit of increased interpretability properties: to some degree, each dimension can be understood by a human and associated with a recognizable feature in the data. In this paper, we transfer this idea to sentence embeddings and explore several approaches to obtain a sparse representation. We further introduce a novel, quantitative and automated evaluation metric for sentence embedding interpretability, based on topic coherence methods. We observe an increase in interpretability compared to dense models, on a dataset of movie dialogs and on the scene descriptions from the MS COCO dataset.
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) · Natural Language Processing Techniques
