Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms

Given a classification model and a prediction for some input, there are heuristic strategies for ranking features according to their importance in regard to the prediction. One common approach to this task is rooted in propositional logic and the notion of \textit{sufficient reason}. Through this concept, the categories of relevant and necessary features were proposed in order to identify the crucial aspects of the input. This paper improves the existing techniques and algorithms for deciding which are the relevant and/or necessary features, showing in particular that necessity can be detected efficiently in complex models such as neural networks. We also generalize the notion of relevancy and study associated problems. Moreover, we present a new global notion (i.e. that intends to explain whether a feature is important for the behavior of the model in general, not depending on a particular input) of \textit{usefulness} and prove that it is related to relevancy and necessity. Furthermore, we develop efficient algorithms for detecting it in decision trees and other more complex models, and experiment on three datasets to analyze its practical utility.

@article{capdevielle2025_2505.09640,
  title={ Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms },
  author={ Tomás Capdevielle and Santiago Cifuentes },
  journal={arXiv preprint arXiv:2505.09640},
  year={ 2025 }
}