ExplainabilityAccountabilityTransparencycs.LG
Implementing local-explainability in Gradient Boosting Trees: Feature Contribution
Ángel Delgado-Panadero, Beatriz Hernández-Lorca, María Teresa García-Ordás, José Alberto Benítez-Andrades
February 14, 2024
Information Sciences
76 citations
1 influential
Key Takeaways
-
GBDTs are powerful but opaque: Gradient Boosting Decision Trees are effective machine learning models, but their predictions are difficult to explain because they combine many individual trees into a single output—making them "black-box" models despite each tree being individually transparent.
-
New method enables local explanations: The paper presents a feature contribution method that can identify which specific features (data inputs) influenced a particular prediction by tracking how data moves through the ensemble of trees, addressing a key gap in explainability for this widely-used algorithm.
-
Supports regulatory compliance: The proposed approach aligns with legal requirements like GDPR's "right to explain," helping organizations using GBDTs demonstrate that their AI systems can justify individual decisions and avoid discriminatory outcomes—critical for responsible AI deployment.
-
Reflects actual model behavior: Unlike some explanation methods that reinterpret models after the fact, this approach works directly with GBDT's internal architecture, providing explanations that genuinely reflect how the model actually reached its decision rather than approximating it.
-
Enables ethical AI analysis: By clarifying which features drive predictions in high-stakes applications, this method supports ethical auditing of AI systems and helps identify potential sources of bias or unfair decision-making.