IMLI: An Incremental Framework for MaxSAT-Based Learning of Interpretable Classification Rules
Not on the map. Why?
Abstract (arXiv)
The wide adoption of machine learning in the critical domains such as medical diagnosis, law, education had propelled the need for interpretable techniques due to the need for end users to understand the reasoning behind decisions due to learning systems. The computational intractability of interpretable learning led practitioners to design heuristic techniques, which fail to provide sound handles to tradeoff accuracy and interpretability. Motivated by the success of MaxSAT solvers over the past decade, recently MaxSAT-based approach, called MLIC, was proposed that seeks to reduce the problem of learning interpretable rules expressed in Conjunctive Normal Form (CNF) to a MaxSAT query. While MLIC was shown to achieve accuracy similar to that of other state of the art black-box classifiers while generating small interpretable CNF formulas, the runtime performance of MLIC is significantly lagging and renders approach unusable in practice. In this context, authors raised the question: Is it possible to achieve the best of both worlds, i.e., a sound framework for interpretable learning that can take advantage of MaxSAT solvers while scaling to real-world instances? In this paper, we take a step towards answering the above question in affirmation. We propose IMLI: an incremental approach to MaxSAT based framework that achieves scalable runtime performance via partition-based training methodology. Extensive experiments on benchmarks arising from UCI repository demonstrate that IMLI achieves up to three orders of magnitude runtime improvement without loss of accuracy and interpretability.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Jan 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 3; 2023: 1; 2024: 1.
8 papers.
- 2021Interpretable Machine Learning: Fundamental Principles and 10 Grand Challengescited by 367
- 2022Logic-Based Explainability in Machine Learningcited by 48
- 2022Eliminating The Impossible, Whatever Remains Must Be Truecited by 23
- 2021A Scalable Two Stage Approach to Computing Optimal Decision Setscited by 7
- 2022Efficient Learning of Interpretable Classification Rulescited by 5
- 2021Rule Generation for Classification: Scalability, Interpretability, and Fairnesscited by 4
- 2023Explainable AI using expressive Boolean formulascited by 2
- 2024An Incremental MaxSAT-based Model to Learn Interpretable and Balanced Classification Rulescited by 0
- 2024An Incremental MaxSAT-based Model to Learn Interpretable and Balanced Classification Rules25 Mar 2024
- 2023Explainable AI using expressive Boolean formulas6 Jun 2023
- 2022Logic-Based Explainability in Machine Learning24 Oct 2022
- 2022Eliminating The Impossible, Whatever Remains Must Be True20 Jun 2022
- 2022Efficient Learning of Interpretable Classification Rules14 May 2022
- 2021Rule Generation for Classification: Scalability, Interpretability, and Fairness21 Apr 2021
- 2021Interpretable Machine Learning: Fundamental Principles and 10 Grand Challenges20 Mar 2021
- 2021A Scalable Two Stage Approach to Computing Optimal Decision Sets3 Feb 2021