Function Trees: Transparent Machine Learning
Not on the map. Why?
Abstract (arXiv)
The output of a machine learning algorithm can usually be represented by one or more multivariate functions of its input variables. Knowing the global properties of such functions can help in understanding the system that produced the data as well as interpreting and explaining corresponding model predictions. A method is presented for representing a general multivariate function as a tree of simpler functions. This tree exposes the global internal structure of the function by uncovering and describing the combined joint influences of subsets of its input variables. Given the inputs and corresponding function values, a function tree is constructed that can be used to rapidly identify and compute all of the function's main and interaction effects up to high order. Interaction effects involving up to four variables are graphically visualized.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 6 of its 24 references that are in the map. First posted on arXiv 19 Mar 2024.
Builds on
6 of 24 references.
References · 6
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2016Visualizing the Effects of Predictor Variables in Black Box Supervised Learning Modelscited by 212
- 2019Purifying Interaction Effects with the Functional ANOVA: An Efficient Algorithm for Recovering Identifiable Additive Modelscited by 41
- 2018Considerations When Learning Additive Explanations for Black-Box Modelscited by 10
- 2023Interpretable Machine Learning based on Functional ANOVA Framework: Algorithms and Comparisonscited by 4
- 2022PDD-SHAP: Fast Approximations for Shapley Values using Functional Decompositioncited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.