A Rectification-Based Approach for Distilling Boosted Trees into Decision Trees
This addresses the need for interpretable machine learning models in domains requiring transparency, though it appears incremental.
The paper tackles the problem of distilling boosted trees into decision trees to balance predictive performance and interpretability, showing empirically that their rectification-based approach provides interesting results compared to retraining-based distillation.
We present a new approach for distilling boosted trees into decision trees, in the objective of generating an ML model offering an acceptable compromise in terms of predictive performance and interpretability. We explain how the correction approach called rectification can be used to implement such a distillation process. We show empirically that this approach provides interesting results, in comparison with an approach to distillation achieved by retraining the model.