TL;DR
This paper evaluates the effectiveness of interpretable machine learning methods for feature selection in neural learning-to-rank models, revealing significant feature redundancy and potential efficiency gains.
Contribution
It compares six feature selection methods, introduces a new global method G-L2X, and demonstrates their impact on neural ranking model efficiency and interpretability.
Findings
Local method TabNet achieves optimal performance with fewer than 10 features.
Global methods like G-L2X improve efficiency with slightly more features.
Significant feature redundancy exists in LTR benchmarks.
Abstract
Neural ranking models have become increasingly popular for real-world search and recommendation systems in recent years. Unlike their tree-based counterparts, neural models are much less interpretable. That is, it is very difficult to understand their inner workings and answer questions like how do they make their ranking decisions? or what document features do they find important? This is particularly disadvantageous since interpretability is highly important for real-world systems. In this work, we explore feature selection for neural learning-to-rank (LTR). In particular, we investigate six widely-used methods from the field of interpretable machine learning (ML) and introduce our own modification, to select the input features that are most important to the ranking behavior. To understand whether these methods are useful for practitioners, we further study whether they contribute to…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGated Linear Unit · Dense Connections · Residual Connection · Feature Selection · Batch Normalization · TabNet
