Given the pressing need for explainability in Machine Learning systems, the studies on counterfactual explanations have gained significant interest. This research delves into this timely problem cast in a unique context of relational systems described by fuzzy relational equations. We develop a comprehensive solution to the counterfactual problems encountered in this setting, which is a novel contribution to the field. An underlying optimization problem is formulated, and its gradient-based solution is constructed. We demonstrate that the non-uniqueness of the derived solution is conveniently formalized and quantified by admitting a result coming in the form of information granules of a higher type, namely type-2 or interval-valued fuzzy set. The construction of the solution in this format is realized by invoking the principle of justifiable granularity, another innovative aspect of our research. We also discuss ways of designing fuzzy relations and elaborate on methods of carrying out counterfactual explanations in rule-based models. Illustrative examples are included to present the performance of the method and interpret the obtained results.
Read full abstract