ExplainabilityTransparencyAccountabilitycs.LG
Interpretable classifiers for tabular data via discretization and feature selection
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander
February 8, 2024
DAO-XAI@ECAI
Key Takeaways
-
Interpretability doesn't require sacrificing accuracy: The method produces classifiers as short Boolean formulas (simple if-then rules) that achieve accuracy comparable to complex "black box" models like random forests and XGBoost across 12 experiments, demonstrating that human-understandable AI systems can perform as well as harder-to-explain alternatives.
-
Simpler models enable better oversight: By converting tabular data into discretized categories and selecting only the most important features, the approach creates classifiers so concise that humans can immediately understand and verify the decision-making logic, supporting better human oversight of AI systems.
-
Mathematical guarantees matter for trust: The paper proves a new theoretical result about the probability that their classifier represents the "ideally best" solution for the underlying data distribution, providing formal assurance that the interpretable model isn't just easy to understand but also statistically sound.
-
Practical for real-world applications: The method works on actual datasets used in prior research, suggesting it could be deployed in real-world scenarios where both accuracy and explainability are required—such as healthcare, lending, or hiring decisions where stakeholders need to understand why an AI made a particular recommendation.