Evaluating Local Model-Agnostic Explanations of Learning to Rank Models with Decision Paths
Not on the map. Why?
Abstract (arXiv)
Local explanations of learning-to-rank (LTR) models are thought to extract the most important features that contribute to the ranking predicted by the LTR model for a single data point. Evaluating the accuracy of such explanations is challenging since the ground truth feature importance scores are not available for most modern LTR models. In this work, we propose a systematic evaluation technique for explanations of LTR models. Instead of using black-box models, such as neural networks, we propose to focus on tree-based LTR models, from which we can extract the ground truth feature importance scores using decision paths. Once extracted, we can directly compare the ground truth feature importance scores to the feature importance scores generated with explanation techniques. We compare two recently proposed explanation techniques for LTR models when using decision trees and gradient boosting models on the MQ2008 dataset. We show that the explanation accuracy in these techniques can largely vary depending on the explained model and even which data point is explained.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 31 references that are in the map. First posted on arXiv 4 Mar 2022.
Builds on
11 of 31 references.
References · 11
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2017Towards A Rigorous Science of Interpretable Machine Learningcited by 1,400
- 2017Interpretation of Neural Networks is Fragilecited by 443
- 2017Methods for Interpreting and Understanding Deep Neural Networkscited by 342
- 2020Evaluations and Methods for Explanation through Robustness Analysiscited by 51
- 2020Looking Deeper into Tabular LIMEcited by 20
- 2019Visual Question Answering using Deep Learning: A Survey and Performance Analysiscited by 19
- 2018EXS: Explainable Search Using Local Model Agnostic Interpretabilitycited by 18
- 2019Pairwise Learning to Rank by Neural Networks Revisited: Reconstruction, Theoretical Analysis and Practical Performancecited by 13
- 2021Explainable Machine Learning for Fraud Detectioncited by 9
Built on by
Not cited yet.