2022
DOI: 10.48550/arxiv.2208.06151
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Unifying local and global model explanations by functional decomposition of low dimensional structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…In the examples in the next section, we compare the conditional and unconditional versions (4.5) and (4.6), respectively, and for the extrapolation, we simply use the one provided by the fitted neural network. We remark that there is interesting work that extends Shapley values to higher order decompositions and representations; we refer to Tsai et al [34] and Hiabu et al [15]. The basic idea is to give a functional decomposition of the regression function by including higher interaction terms.…”
Section: Additive and Fair Decompositionmentioning
confidence: 99%
See 1 more Smart Citation
“…In the examples in the next section, we compare the conditional and unconditional versions (4.5) and (4.6), respectively, and for the extrapolation, we simply use the one provided by the fitted neural network. We remark that there is interesting work that extends Shapley values to higher order decompositions and representations; we refer to Tsai et al [34] and Hiabu et al [15]. The basic idea is to give a functional decomposition of the regression function by including higher interaction terms.…”
Section: Additive and Fair Decompositionmentioning
confidence: 99%
“…The basic idea is to give a functional decomposition of the regression function by including higher interaction terms. This can partly mitigate the difficulty of the decision whether one should work with conditional or unconditional expectations, however, some issues remain, e.g., the above mentioned support constraints cannot be dealt with the (unconstrained) marginal identification given by formula (2) in Hiabu et al [15].…”
Section: Additive and Fair Decompositionmentioning
confidence: 99%