On Trustworthy Rule-Based Models and Explanations

• URL: http://arxiv.org/abs/2507.07576v1
• Date: Thu, 10 Jul 2025 09:28:12 GMT
• Title: On Trustworthy Rule-Based Models and Explanations
• Authors: Mohamed Siala, Jordi Planes, Joao Marques-Silva,
• Abstract summary: The paper develops algorithms for the analysis of undesired facets of rule-based ML models.<n>It concludes that well-known and widely used tools for learning rule-based ML models will induce rule sets that exhibit one or more negative facets.
• Score: 3.3398778807255782
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A task of interest in machine learning (ML) is that of ascribing explanations to the predictions made by ML models. Furthermore, in domains deemed high risk, the rigor of explanations is paramount. Indeed, incorrect explanations can and will mislead human decision makers. As a result, and even if interpretability is acknowledged as an elusive concept, so-called interpretable models are employed ubiquitously in high-risk uses of ML and data mining (DM). This is the case for rule-based ML models, which encompass decision trees, diagrams, sets and lists. This paper relates explanations with well-known undesired facets of rule-based ML models, which include negative overlap and several forms of redundancy. The paper develops algorithms for the analysis of these undesired facets of rule-based systems, and concludes that well-known and widely used tools for learning rule-based ML models will induce rule sets that exhibit one or more negative facets.

Related papers

• MoRE-LLM: Mixture of Rule Experts Guided by a Large Language Model [54.14155564592936]
  We propose a Mixture of Rule Experts guided by a Large Language Model (MoRE-LLM)<n>MoRE-LLM steers the discovery of local rule-based surrogates during training and their utilization for the classification task.<n>LLM is responsible for enhancing the domain knowledge alignment of the rules by correcting and contextualizing them.
  arXiv  Detail & Related papers  (2025-03-26T11:09:21Z)
• Cycles of Thought: Measuring LLM Confidence through Stable Explanations [53.15438489398938]
  Large language models (LLMs) can reach and even surpass human-level accuracy on a variety of benchmarks, but their overconfidence in incorrect responses is still a well-documented failure mode. We propose a framework for measuring an LLM's uncertainty with respect to the distribution of generated explanations for an answer.
  arXiv  Detail & Related papers  (2024-06-05T16:35:30Z)
• LLMs for XAI: Future Directions for Explaining Explanations [50.87311607612179]
  We focus on refining explanations computed using existing XAI algorithms. Initial experiments and user study suggest that LLMs offer a promising way to enhance the interpretability and usability of XAI.
  arXiv  Detail & Related papers  (2024-05-09T19:17:47Z)
• Pyreal: A Framework for Interpretable ML Explanations [51.14710806705126]
  Pyreal is a system for generating a variety of interpretable machine learning explanations. Pyreal converts data and explanations between the feature spaces expected by the model, relevant explanation algorithms, and human users. Our studies demonstrate that Pyreal generates more useful explanations than existing systems.
  arXiv  Detail & Related papers  (2023-12-20T15:04:52Z)
• Explainability for Large Language Models: A Survey [59.67574757137078]
  Large language models (LLMs) have demonstrated impressive capabilities in natural language processing. This paper introduces a taxonomy of explainability techniques and provides a structured overview of methods for explaining Transformer-based language models.
  arXiv  Detail & Related papers  (2023-09-02T22:14:26Z)
• Logic-Based Explainability in Machine Learning [0.0]
  The operation of the most successful Machine Learning models is incomprehensible for human decision makers. In recent years, there have been efforts on devising approaches for explaining ML models. This paper overviews the ongoing research efforts on computing rigorous model-based explanations of ML models.
  arXiv  Detail & Related papers  (2022-10-24T13:43:07Z)
• HEX: Human-in-the-loop Explainability via Deep Reinforcement Learning [2.322461721824713]
  We propose HEX, a human-in-the-loop deep reinforcement learning approach to machine learning explainability (MLX) Our formulation explicitly considers the decision boundary of the ML model in question, rather than the underlying training data. Our proposed methods thus synthesize HITL MLX policies that explicitly capture the decision boundary of the model in question for use in limited data scenarios.
  arXiv  Detail & Related papers  (2022-06-02T23:53:40Z)
• GAM(e) changer or not? An evaluation of interpretable machine learning models based on additive model constraints [5.783415024516947]
  This paper investigates a series of intrinsically interpretable machine learning models. We evaluate the prediction qualities of five GAMs as compared to six traditional ML models.
  arXiv  Detail & Related papers  (2022-04-19T20:37:31Z)
• General Pitfalls of Model-Agnostic Interpretation Methods for Machine Learning Models [1.025459377812322]
  We highlight many general pitfalls of machine learning model interpretation, such as using interpretation techniques in the wrong context. We focus on pitfalls for global methods that describe the average model behavior, but many pitfalls also apply to local methods that explain individual predictions.
  arXiv  Detail & Related papers  (2020-07-08T14:02:56Z)
• Explainable Matrix -- Visualization for Global and Local Interpretability of Random Forest Classification Ensembles [78.6363825307044]
  We propose Explainable Matrix (ExMatrix), a novel visualization method for Random Forest (RF) interpretability. It employs a simple yet powerful matrix-like visual metaphor, where rows are rules, columns are features, and cells are rules predicates. ExMatrix applicability is confirmed via different examples, showing how it can be used in practice to promote RF models interpretability.
  arXiv  Detail & Related papers  (2020-05-08T21:03:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.