Extractive Explanations for Interpretable Text Ranking

Journal Article (2023)
Authors

Jurek Leonhardt (L3S, TU Delft - Web Information Systems)

Koustav Rudra (Indian Institute of Technology (IIT))

Avishek Anand (TU Delft - Web Information Systems)

Research Group
Web Information Systems
Copyright
© 2023 L.J.L. Leonhardt, Koustav Rudra, A. Anand
To reference this document use:
https://doi.org/10.1145/3576924
More Info
expand_more
Publication Year
2023
Language
English
Copyright
© 2023 L.J.L. Leonhardt, Koustav Rudra, A. Anand
Research Group
Web Information Systems
Issue number
4
Volume number
41
DOI:
https://doi.org/10.1145/3576924
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Neural document ranking models perform impressively well due to superior language understanding gained from pre-Training tasks. However, due to their complexity and large number of parameters these (typically transformer-based) models are often non-interpretable in that ranking decisions can not be clearly attributed to specific parts of the input documents.In this article, we propose ranking models that are inherently interpretable by generating explanations as a by-product of the prediction decision. We introduce the Select-And-Rank paradigm for document ranking, where we first output an explanation as a selected subset of sentences in a document. Thereafter, we solely use the explanation or selection to make the prediction, making explanations first-class citizens in the ranking process. Technically, we treat sentence selection as a latent variable trained jointly with the ranker from the final output. To that end, we propose an end-To-end training technique for Select-And-Rank models utilizing reparameterizable subset sampling using the Gumbel-max trick.We conduct extensive experiments to demonstrate that our approach is competitive to state-of-The-Art methods. Our approach is broadly applicable to numerous ranking tasks and furthers the goal of building models that are interpretable by design. Finally, we present real-world applications that benefit from our sentence selection method.

Files

3576924.pdf
(pdf | 4.54 Mb)
- Embargo expired in 09-10-2023
License info not available