Efficient Search for Diverse Coherent Explanations

Russell, Christopher (2019) Efficient Search for Diverse Coherent Explanations In: ACM Conference on Fairness, Accountability, and Transparency (ACM FAT*).

Preview

Text Efficient search for diverse coherent explanations.pdf - Version of Record Available under License Creative Commons Attribution. Download (1MB) | Preview

Abstract

This paper proposes new search algorithms for counterfactual explanations based upon mixed integer programming. We are concerned with complex data in which variables may take any value from a contiguous range or an additional set of discrete states. We propose a novel set of constraints that we refer to as a “mixed polytope” and show how this can be used with an integer programming solver to efficiently find coherent counterfactual explanations i.e. solutions that are guaranteed to map back onto the underlying data structure, while avoiding the need for brute-force enumeration. We also look at the problem of diverse explanations and show how these can be generated within our framework.

Item Type:	Conference or Workshop Item (Conference Paper)
Divisions :	Faculty of Engineering and Physical Sciences > Electronic Engineering
Authors :	Name Email ORCID Russell, Christopher chris.russell@surrey.ac.uk
Date :	29 January 2019
DOI :	10.1145/3287560.3287569
Copyright Disclaimer :	© 2019 Copyright held by the owner/author(s). ACM ISBN 978-1-4503-6125-5/19/01.
Depositing User :	Rebecca Cooper
Date Deposited :	15 Mar 2019 11:16
Last Modified :	15 Mar 2019 11:22
URI:	http://epubs.surrey.ac.uk/id/eprint/850739

Actions (login required)

View Item

Downloads