Algorithms for Interpretable Machine Learning

author: Cynthia Rudin, Sloan School of Management, Massachusetts Institute of Technology, MIT
published: Oct. 7, 2014,   recorded: August 2014,   views: 9922

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


It is extremely important in many application domains to have transparency in predictive modeling. Domain experts do not tend to prefer "black box" predictive models. They would like to understand how predictions are made, and possibly, prefer models that emulate the way a human expert might make a decision, with a few important variables, and a clear convincing reason to make a particular prediction. I will discuss recent work on interpretable predictive modeling with decision lists and sparse integer linear models. I will describe several approaches, including an algorithm based on discrete optimization, and an algorithm based on Bayesian analysis. I will show examples of interpretable models for stroke prediction in medical patients and prediction of violent crime in young people raised in out-of-home care.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 Cynthia Rudin, November 27, 2014 at 5:56 a.m.:

Slides for this talk --->

Write your own review or comment:

make sure you have javascript enabled or clear this field: