Tractability of explaining classifier decisions
From MaRDI portal
Publication:6098842
DOI10.1016/j.artint.2022.103841MaRDI QIDQ6098842
Martin C. Cooper, João P. Marques-Silva
Publication date: 19 June 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hybrid tractability of valued constraint problems
- Soft arc consistency revisited
- A faster strongly polynomial time algorithm for submodular function minimization
- The minimum equivalent DNF problem and shortest implicants
- The complexity of selecting maximal solutions
- Perspectives of Monge properties in optimization
- SAT-based rigorous explanations for decision lists
- Explanation in artificial intelligence: insights from the social sciences
- The complexity of soft constraint satisfaction
- Submodular functions and optimization.
- Complexity Classifications of Boolean Constraint Satisfaction Problems
- Discrete Mathematics of Neural Networks
- Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas
- Tractable Triangles and Cross-Free Convexity in Discrete Optimisation
- The Complexity of Finite-Valued CSPs
- Submodular Functions: Learnability, Structure, and Optimization
- Optimal Multi-Way Number Partitioning
- Subquadratic submodular function minimization
- The Complexity of Valued CSPs
- Reducibility among Combinatorial Problems
- The Complexity of General-Valued CSPs
- Learning submodular functions
- The Computational Complexity of Understanding Binary Classifier Decisions
- Graphical Models: Queries, Complexity, Algorithms
- Principles and Practice of Constraint Programming – CP 2004
- Tractable constraints on ordered domains
This page was built for publication: Tractability of explaining classifier decisions
