On marginal feature attributions of tree-based models

arXiv:2302.08434v3 Announce Type: replace
Abstract: Due to their power and ease of use, tree-based machine learning models, such as random forests and gradient-boosted tree ensembles, have become very popular. To interpret them, local feature attributions based on marginal expectations, e.g. marginal (interventional) Shapley, Owen or Banzhaf values, may be employed. Such methods are true to the model and implementation invariant, i.e. dependent only on the input-output function of the model. We contrast this with the popular TreeSHAP algorithm by presenting …

abstract arxiv become cs.gt cs.lg feature forests gradient machine machine learning machine learning models popular power random random forests them tree type values