Cover Image

Hard to Explain: On the Computational Hardness of In-Distribution Model Interpretation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Amir, Guy, Bassan, Shahaf, Katz, Guy
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Computational Complexity Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Local vs. Global Interpretability: A Computational Complexity Perspective
by: Bassan, Shahaf, et al.
Published: (2024)

What makes an Ensemble (Un) Interpretable?
by: Bassan, Shahaf, et al.
Published: (2025)

On the Computational Tractability of the (Many) Shapley Values
by: Marzouk, Reda, et al.
Published: (2025)

Provably Explaining Neural Additive Models
by: Bassan, Shahaf, et al.
Published: (2026)

Additive Models Explained: A Computational Complexity Approach
by: Bassan, Shahaf, et al.
Published: (2025)

Formal Mechanistic Interpretability: Automated Circuit Discovery with Provable Guarantees
by: Hadad, Itamar, et al.
Published: (2026)

Explaining, Fast and Slow: Abstraction and Refinement of Provable Explanations
by: Bassan, Shahaf, et al.
Published: (2025)

Explain Yourself, Briefly! Self-Explaining Neural Networks with Concise Sufficient Reasons
by: Bassan, Shahaf, et al.
Published: (2025)

Verified SHAP: Provable Bounds for Exact Shapley Values of Neural Networks
by: Boetius, David, et al.
Published: (2026)

Unifying Formal Explanations: A Complexity-Theoretic Perspective
by: Bassan, Shahaf, et al.
Published: (2026)

SHAP Meets Tensor Networks: Provably Tractable Explanations with Parallelism
by: Marzouk, Reda, et al.
Published: (2025)

On Improving Deep Active Learning with Formal Verification
by: Spiegelman, Jonathan, et al.
Published: (2025)

Verifying the Generalization of Deep Learning to Out-of-Distribution Domains
by: Amir, Guy, et al.
Published: (2024)

Hard Clique Formulas for Resolution
by: Atserias, Albert
Published: (2026)

Hardness of monadic second-order formulae over succinct graphs
by: Gamard, Guilhem, et al.
Published: (2023)

When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames
by: Krebs, Andreas, et al.
Published: (2025)

Structural Origin and the Minimal Syntax of NP-Hardness: Analysis of SAT from Syntactic Generativity and Compositional Collapse
by: Nishiyama, Yumiko
Published: (2025)

The Computational Complexity of Satisfiability in State Space Models
by: Alsmann, Eric, et al.
Published: (2025)

Limits of Deep Learning: Sequence Modeling through the Lens of Complexity Theory
by: Zubić, Nikola, et al.
Published: (2024)

Hard QBFs for Merge Resolution
by: Beyersdorff, Olaf, et al.
Published: (2020)

Is uniform expressivity too restrictive? Towards efficient expressivity of graph neural networks
by: Khalife, Sammy, et al.
Published: (2024)

The Descriptive Complexity of Graph Neural Networks
by: Grohe, Martin
Published: (2023)

Verifying Quantized Graph Neural Networks is PSPACE-complete
by: Sälzer, Marco, et al.
Published: (2025)

The Complexity of Verifying Feedforward Neural Networks in Quantised Settings
by: Alsmann, Eric, et al.
Published: (2026)

Shield Synthesis for LTL Modulo Theories
by: Rodriguez, Andoni, et al.
Published: (2024)

Marabou 2.0: A Versatile Formal Analyzer of Neural Networks
by: Wu, Haoze, et al.
Published: (2024)

New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs
by: Brakensiek, Joshua, et al.
Published: (2026)

Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)

On the Computational Hardness of Transformers
by: Saha, Barna, et al.
Published: (2026)

The Expressive Power of Transformers with Chain of Thought
by: Merrill, William, et al.
Published: (2023)

Proof Minimization in Neural Network Verification
by: Isac, Omri, et al.
Published: (2025)

PICID: Proof-Driven Clause Learning in Neural Network Verification
by: Isac, Omri, et al.
Published: (2025)

The Reachability Problem for Neural-Network Control Systems
by: Schilling, Christian, et al.
Published: (2024)

Transformer Encoder Satisfiability: Complexity and Impact on Formal Reasoning
by: Sälzer, Marco, et al.
Published: (2024)

Verifying Quantized GNNs With Readout Is Decidable But Highly Intractable
by: Chernobrovkin, Artem, et al.
Published: (2025)

Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
by: Bournez, Olivier
Published: (2026)

A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
by: Baillot, Patrick, et al.
Published: (2024)

Specification and Automatic Verification of Computational Reductions
by: Grange, Julien, et al.
Published: (2024)

Logic and Computation through the Lens of Semirings
by: Barlag, Timon, et al.
Published: (2025)

Transductive Learning Is Compact
by: Asilis, Julian, et al.
Published: (2024)