Research map / Learning theory and algorithms / Prediction and decision losses
Provable Explanations for Any-Order Neural Additive Models
Idan Refaeli, Shahaf Bassan, Yizhak Y. Elboher, Guy Katz
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Proposes provably sufficient, cardinally minimal feature explanations for any-order neural additive models, building on tractable explanations for neural additive models.
Problem
Post-hoc explanations for neural networks are heuristic; computing cardinally minimal provably sufficient feature subsets is intractable for general neural networks.
Approach
Extends tractable provable explanations from neural additive models to any-order neural additive models, which allow feature interactions while keeping explanation computation tractable. Full method details are not available in the provided text.
Experimental setup
Builds on: neural additive models
Closest papers by meaning
- Explaining, Fast and Slow: Abstraction and Refinement of Provable Explanations (ICML 2025 · similarity 0.91)
- Additive Models Explained: A Computational Complexity Approach (NeurIPS 2025 · similarity 0.90)
- Explainable Neural Networks with Guarantee: A Sparse Estimation Approach (AAAI 2025 · similarity 0.89)
- Defining and extracting generalizable interaction primitives from DNNs (ICLR 2024 · similarity 0.87)
- SHAP Meets Tensor Networks: Provably Tractable Explanations with Parallelism (NeurIPS 2025 · similarity 0.87)
- Towards Modeling Uncertainties of Self-Explaining Neural Networks via Conformal Prediction (AAAI 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
