For linear classifiers, a relaxed notion of probabilistic sufficient reasons, (δ, ε)-SR, can be computed in polynomial time with high probability, despite exact computation being #P-hard.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Probabilistic Explanations for Linear Models
For linear classifiers, a relaxed notion of probabilistic sufficient reasons, (δ, ε)-SR, can be computed in polynomial time with high probability, despite exact computation being #P-hard.