Proves an impossibility theorem that no feature attribution ranking can be faithful, stable, and complete under collinearity, characterizes the design space as two families, introduces the DASH ensemble method, and formally verifies all claims in Lean 4.
Innovations in Theoretical Computer Science (ITCS) , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
The Attribution Impossibility: No Feature Ranking Is Faithful, Stable, and Complete Under Collinearity
Proves an impossibility theorem that no feature attribution ranking can be faithful, stable, and complete under collinearity, characterizes the design space as two families, introduces the DASH ensemble method, and formally verifies all claims in Lean 4.