We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The growing range of applications of Machine Learning (ML) in a multitude of settings motivates the ability of computing small explanations for predictions made. Small explanations are generally accepted as easier for human decision makers to understand. Most earlier work on computing explanations is based on heuristic approaches, providing no guarantees of quality, in terms of how close such solutions are from cardinality- or subset-minimal explanations. This paper develops a constraint-agnostic solution for computing explanations for any ML model. The proposed solution exploits abductive reasoning, and imposes the requirement that the ML model can be represented as sets of constraints using some target constraint reasoning system for which the decision problem can be answered with some oracle. The experimental results, obtained on well-known datasets, validate the scalability of the proposed approach as well as the quality of the computed solutions.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1811.10656")
get_code_for_paper("1811.10656")
have("1811.10656")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1811.10656.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1811.10656)
Connect an agent — have() is free.