A General Search-Based Framework for Generating Textual Counterfactual Explanations

One of the prominent methods for explaining the decision of a machine-learning classifier is by a counterfactual example. Most current algorithms for generating such examples in the textual domain are based on generative language models. Generative models, however, are trained to minimize a specific loss function in order to fulfill certain requirements for the generated texts. Any change in the requirements may necessitate costly retraining, thus potentially limiting their applicability. In this paper, we present a general search-based framework for generating counterfactual explanations in the textual domain. Our framework is model-agnostic, domain-agnostic, anytime, and does not require retraining in order to adapt to changes in the user requirements. We model the task as a search problem in a space where the initial state is the classified text, and the goal state is a text in a given target class. Our framework includes domain-independent modification operators, but can also exploit domain-specific knowledge through specialized operators. The search algorithm attempts to find a text from the target class with minimal user-specified distance from the original classified object.

Authors

• Daniel Gilo Department of Computer Science Technion - Israel Institute of Technology
• Shaul Markovitch Department of Computer Science Technion - Israel Institute of Technology

Keywords

• ML: Transparent, Interpretable, Explainable ML
• NLP: Interpretability, Analysis, and Evaluation of NLP Models
• PEAI: Accountability, Interpretability & Explainability
• SO: Heuristic Search