paper-with-me

홈 › Papers

BoolXLLM: LLM-Assisted Explainability for Boolean Models

2026-05-12 · Du Cheng, Serdar Kadioglu, Xin Wang arxiv

Interpretable machine learning aims to provide transparent models whose decision-making processes can be readily understood by humans. Recent advances in rule-based approaches, such as expressive Boolean formulas (BoolXAI), offer faithful and compact representations of model behavior. However, for non-technical stakeholders, main challenges remain in practice: (i) selecting semantically meaningful features and (ii) translating formal logical rules into accessible explanations. In this work, we propose BoolXLLM , as a hybrid framework that integrates Large Language Models (LLMs) into the end-to-end pipeline of Boolean rule learning. We augment BoolXAI , an expressive Boolean rule-based classifier, with LLMs at three critical stages: (1) feature selection, where LLMs guide the identification of domain-relevant variables; (2) threshold recommendation, where LLMs propose semantically meaningful discretization strategies for numerical features; and (3) rule compression and interpretation, where Boolean rules are translated into natural language explanations at both global and local levels. This integration bridges formal, faithful explanations with human-understandable narratives. This allows build an explainable AI system that is both theoretically grounded and accessible to non-experts. Early empirical results demonstrate that LLM-assisted pipelines improve interpretability while maintaining competitive predictive performance. Our work highlights the promise of combining symbolic reasoning with language-based models for human-centered explainability.

📄 PDF Abstract BibTeX arXiv:2605.12139

Code (0)

등록된 구현이 없습니다.

Tasks

Interpretable Machine Learning

Similar Papers 제목 키워드 기반

A Refutation of Shapley Values for Explainability

2023-09-06 · Xuanxiang Huang, Joao Marques-Silva

Recent work demonstrated the existence of Boolean functions for which Shapley values provide misleading information about the relative importance of features in rule-based explanations. Such misleading information was br…

Computer-Assisted Creation of Boolean Search Rules for Text Classification in the Legal Domain

2021-12-10 · Hannes Westermann, Jaromir Savelka, Vern R. Walker, Kevin D. Ashley 외

In this paper, we present a method of building strong, explainable classifiers in the form of Boolean search rules. We developed an interactive environment called CASE (Computer Assisted Semantic Exploration) which explo…

BIG-bench Machine Learningtext-classificationText Classification

Do Answers to Boolean Questions Need Explanations? Yes

2021-12-14 · Sara Rosenthal, Mihaela Bornea, Avirup Sil, Radu Florian 외

Existing datasets that contain boolean questions, such as BoolQ and TYDI QA , provide the user with a YES/NO response to the question. However, a one word response is not sufficient for an explainable system. We promote …

Short Boolean Formulas as Explanations in Practice

2023-07-13 · Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh 외

We investigate explainability via short Boolean formulas in the data model based on unary relations. As an explanation of length k, we take a Boolean formula of length k that minimizes the error with respect to the targe…

Attribute

Polynomial Threshold Functions of Bounded Tree-Width: Some Explainability and Complexity Aspects

2025-01-14 · Karine Chubarian, Johnny Joyce, Gyorgy Turan

The tree-width of a multivariate polynomial is the tree-width of the hypergraph with hyperedges corresponding to its terms. Multivariate polynomials of bounded tree-width have been studied by Makowsky and Meer as a new s…

Explainable artificial intelligenceExplainable Artificial Intelligence (XAI)