Tractability of explaining classifier decisions
From MaRDI portal
Cites work
- A faster strongly polynomial time algorithm for submodular function minimization
- Complexity classifications of Boolean constraint satisfaction problems
- Discrete mathematics of neural networks. Selected topics
- Explanation in artificial intelligence: insights from the social sciences
- Graphical Models: Queries, Complexity, Algorithms
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 7051222 (Why is no real title available?)
- scientific article; zbMATH DE number 2243365 (Why is no real title available?)
- Hybrid tractability of valued constraint problems
- Learning submodular functions
- On the reasons behind decisions
- Optimal bounds on approximation of submodular and XOS functions by juntas
- Optimal multi-way number partitioning
- Perspectives of Monge properties in optimization
- Principles and Practice of Constraint Programming – CP 2004
- Reducibility among combinatorial problems
- SAT-based rigorous explanations for decision lists
- Soft arc consistency revisited
- Submodular functions and optimization.
- Submodular functions: learnability, structure, and optimization
- Subquadratic submodular function minimization
- The complexity of general-valued CSPs
- The complexity of selecting maximal solutions
- The complexity of soft constraint satisfaction
- The complexity of valued CSPs
- The computational complexity of understanding binary classifier decisions
- The minimum equivalent DNF problem and shortest implicants
- Tractable constraints on ordered domains
- Tractable triangles and cross-free convexity in discrete optimisation
Cited in
(10)- A SAT-based approach to learn explainable decision sets
- An ASP-based approach to counterfactual explanations for classification
- Explaining AI decisions using efficient methods for learning sparse Boolean formulae
- Minimal and Complete Explanations for Critical Multi-attribute Decisions
- scientific article; zbMATH DE number 1946851 (Why is no real title available?)
- Explainable and explorable decision support
- Explaining classifiers with measures of statistical association
- On the failings of Shapley values for explainability
- Feature necessity and relevancy in machine learning explanations
- Explaining multivariate decision trees: characterising tractable languages
This page was built for publication: Tractability of explaining classifier decisions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098842)
