Algorithm uses neural network verification to compute arbitrarily tight bounds on exact SHAP values for neural networks, recovering the exact values and scaling to larger feature spaces than prior exact methods.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
verdicts
UNVERDICTED 4representative citing papers
Introduces decision-alignment to evaluate uncertainty metrics against downstream decision utilities and proposes prior-weighted proper scoring rules that align better in benchmarks and case studies.
Introduces bAdag, an AdaGrad-based block coordinate gradient method with ergodic sublinear convergence proofs for smooth nonconvex objectives under block Lipschitz gradient assumptions, covering cyclic, uniform random, and Gauss-Southwell selection plus box constraints.
LoH adds a learnable choice operator to propositional logic, compiles formulas to differentiable graphs via fuzzy logic, subsumes prior NeSy models, and supports discretization to Boolean functions via the Gödel trick.
citing papers explorer
-
Verified SHAP: Provable Bounds for Exact Shapley Values of Neural Networks
Algorithm uses neural network verification to compute arbitrarily tight bounds on exact SHAP values for neural networks, recovering the exact values and scaling to larger feature spaces than prior exact methods.
-
Decision-Aligned Evaluation of Uncertainty Quantification
Introduces decision-alignment to evaluate uncertainty metrics against downstream decision utilities and proposes prior-weighted proper scoring rules that align better in benchmarks and case studies.
-
Logic of Hypotheses: from Zero to Full Knowledge in Neurosymbolic Integration
LoH adds a learnable choice operator to propositional logic, compiles formulas to differentiable graphs via fuzzy logic, subsumes prior NeSy models, and supports discretization to Boolean functions via the Gödel trick.