Rigorous Explanations for Tree Ensembles
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917372847194112 |
|---|---|
| author | Izza, Yacine Ignatiev, Alexey Huang, Xuanxiang Stuckey, Peter J. Marques-Silva, Joao |
| author_facet | Izza, Yacine Ignatiev, Alexey Huang, Xuanxiang Stuckey, Peter J. Marques-Silva, Joao |
| contents | Tree ensembles (TEs) find a multitude of practical applications. They represent one of the most general and accurate classes of machine learning methods. While they are typically quite concise in representation, their operation remains inscrutable to human decision makers. One solution to build trust in the operation of TEs is to automatically identify explanations for the predictions made. Evidently, we can only achieve trust using explanations, if those explanations are rigorous, that is truly reflect properties of the underlying predictor they explain This paper investigates the computation of rigorously-defined, logically-sound explanations for the concrete case of two well-known examples of tree ensembles, namely random forests and boosted trees. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_29361 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Rigorous Explanations for Tree Ensembles Izza, Yacine Ignatiev, Alexey Huang, Xuanxiang Stuckey, Peter J. Marques-Silva, Joao Artificial Intelligence Machine Learning Logic in Computer Science Tree ensembles (TEs) find a multitude of practical applications. They represent one of the most general and accurate classes of machine learning methods. While they are typically quite concise in representation, their operation remains inscrutable to human decision makers. One solution to build trust in the operation of TEs is to automatically identify explanations for the predictions made. Evidently, we can only achieve trust using explanations, if those explanations are rigorous, that is truly reflect properties of the underlying predictor they explain This paper investigates the computation of rigorously-defined, logically-sound explanations for the concrete case of two well-known examples of tree ensembles, namely random forests and boosted trees. |
| title | Rigorous Explanations for Tree Ensembles |
| topic | Artificial Intelligence Machine Learning Logic in Computer Science |
| url | https://arxiv.org/abs/2603.29361 |