Explanatory Techniques for Machine Learning Models

Master thesis (2019)

Authors

K. Dedja Electrical Engineering, Mathematics and Computer Science

Contributors

P. Cirillo Applied Probability - EEMCS (mentor)
O. Oosterlee Electrical Engineering, Mathematics and Computer Science (graduation committee member)
Peter Den Iseger (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2019 Klest Dedja
More Info
expand_more

Published Date

13-11-2019

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

Since the last decade, we are assisting a widespread use of “black box” Machine Learning algorithms, these are algorithms with excellent performance but whose outcomes are hard to understand to a human agent. However, there are some situation when it is important to understand why a certain output is given,
and the field of explanability in Machine Learning has flourished in the last decade. In this work, we will go through some of these techniques. We will focus on model agnostic visualisation techniques introduced by Friedman (2001) and developed by Goldstein et al. (2015). Starting from the Partial Dependence plotting technique, we then analyse the Individual Conditional Expectation plot and its variants. Among them, we suggest the introduction of the so called “d-log-ICE” and we try identify scenarios where this techniques can bring better interpretability. We test our techniques on two models, the first one is based on the Boston Housing Dataset, and the second is an internal model at ABN Amro called “FLAG”.