The same applies with attribution in general (e.g. in decision making).
As in, you’re also skeptical of traditional Shapley values in discrete coalition games?
“Completeness” strikes me as a desirable property for attributions to be properly normalized. If attributions aren’t bounded in some way, it doesn’t seem to me like they’re really ‘attributions’.
Very open to counterarguments here, though. I’m not particularly confident here either. There’s a reason this post isn’t titled ‘Integrated Gradients are the correct attribution method’.
As in, you’re also skeptical of traditional Shapley values in discrete coalition games?
“Completeness” strikes me as a desirable property for attributions to be properly normalized. If attributions aren’t bounded in some way, it doesn’t seem to me like they’re really ‘attributions’.
Very open to counterarguments here, though. I’m not particularly confident here either. There’s a reason this post isn’t titled ‘Integrated Gradients are the correct attribution method’.