Finding Counterfactual Explanations through Constraint Relaxations
- URL: http://arxiv.org/abs/2204.03429v1
- Date: Thu, 7 Apr 2022 13:18:54 GMT
- Title: Finding Counterfactual Explanations through Constraint Relaxations
- Authors: Sharmi Dev Gupta, Begum Genc and Barry O'Sullivan
- Abstract summary: Interactive constraint systems often suffer from infeasibility (no solution) due to conflicting user constraints.
A common approach to recover infeasibility is to eliminate the constraints that cause the conflicts in the system.
We propose an iterative method based on conflict detection and maximal relaxations in over-constrained constraint satisfaction problems.
- Score: 6.961253535504979
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Interactive constraint systems often suffer from infeasibility (no solution)
due to conflicting user constraints. A common approach to recover infeasibility
is to eliminate the constraints that cause the conflicts in the system. This
approach allows the system to provide an explanation as: "if the user is
willing to drop out some of their constraints, there exists a solution".
However, one can criticise this form of explanation as not being very
informative. A counterfactual explanation is a type of explanation that can
provide a basis for the user to recover feasibility by helping them understand
which changes can be applied to their existing constraints rather than removing
them. This approach has been extensively studied in the machine learning field,
but requires a more thorough investigation in the context of constraint
satisfaction. We propose an iterative method based on conflict detection and
maximal relaxations in over-constrained constraint satisfaction problems to
help compute a counterfactual explanation.
Related papers
- Deep Neural Network for Constraint Acquisition through Tailored Loss
Function [0.0]
The significance of learning constraints from data is underscored by its potential applications in real-world problem-solving.
This work introduces a novel approach grounded in Deep Neural Network (DNN) based on Symbolic Regression.
arXiv Detail & Related papers (2024-03-04T13:47:33Z) - Resilient Constrained Learning [94.27081585149836]
This paper presents a constrained learning approach that adapts the requirements while simultaneously solving the learning task.
We call this approach resilient constrained learning after the term used to describe ecological systems that adapt to disruptions by modifying their operation.
arXiv Detail & Related papers (2023-06-04T18:14:18Z) - Explainable Data-Driven Optimization: From Context to Decision and Back
Again [76.84947521482631]
Data-driven optimization uses contextual information and machine learning algorithms to find solutions to decision problems with uncertain parameters.
We introduce a counterfactual explanation methodology tailored to explain solutions to data-driven problems.
We demonstrate our approach by explaining key problems in operations management such as inventory management and routing.
arXiv Detail & Related papers (2023-01-24T15:25:16Z) - Feature-based Learning for Diverse and Privacy-Preserving Counterfactual
Explanations [46.89706747651661]
Interpretable machine learning seeks to understand the reasoning process of complex black-box systems.
One flourishing approach is through counterfactual explanations, which provide suggestions on what a user can do to alter an outcome.
arXiv Detail & Related papers (2022-09-27T15:09:13Z) - Interactively Learning Preference Constraints in Linear Bandits [100.78514640066565]
We study sequential decision-making with known rewards and unknown constraints.
As an application, we consider learning constraints to represent human preferences in a driving simulation.
arXiv Detail & Related papers (2022-06-10T17:52:58Z) - Conflict Generalisation in ASP: Learning Correct and Effective
Non-Ground Constraints [3.8673630752805432]
Generalising and re-using knowledge learned while solving one problem instance has been neglected by state-of-the-art answer set solvers.
We suggest a new approach that generalises learned nogoods for re-use to speed-up the solving of future problem instances.
arXiv Detail & Related papers (2020-08-07T12:02:32Z) - An Integer Linear Programming Framework for Mining Constraints from Data [81.60135973848125]
We present a general framework for mining constraints from data.
In particular, we consider the inference in structured output prediction as an integer linear programming (ILP) problem.
We show that our approach can learn to solve 9x9 Sudoku puzzles and minimal spanning tree problems from examples without providing the underlying rules.
arXiv Detail & Related papers (2020-06-18T20:09:53Z) - A framework for step-wise explaining how to solve constraint
satisfaction problems [21.96171133035504]
We study the problem of explaining the inference steps that one can take during propagation, in a way that is easy to interpret for a person.
Thereby, we aim to give the constraint solver explainable agency, which can help in building trust in the solver.
arXiv Detail & Related papers (2020-06-11T11:35:41Z) - Probably Approximately Correct Constrained Learning [135.48447120228658]
We develop a generalization theory based on the probably approximately correct (PAC) learning framework.
We show that imposing a learner does not make a learning problem harder in the sense that any PAC learnable class is also a constrained learner.
We analyze the properties of this solution and use it to illustrate how constrained learning can address problems in fair and robust classification.
arXiv Detail & Related papers (2020-06-09T19:59:29Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.