02/02/2021

A Scalable Two Stage Approach to Computing Optimal Decision Sets

Alexey Ignatiev, Edward Lam, Peter J. Stuckey, Joao Marques-Silva

Keywords:

Abstract Paper Similar Papers

Abstract: Machine learning (ML) is ubiquitous in modern life. Since it is being deployed in technologies that affect our privacy and safety, it is often crucial to understand the reasoning behind its decisions, warranting the need for explainable AI. Rule-based models, such as decision trees, decision lists, and decision sets, are conventionally deemed to be the most interpretable. Recent work uses propositional satisfiability (SAT) solving (and its optimization variants) to generate minimum-size decision sets. Motivated by limited practical scalability of these earlier methods, this paper proposes a novel approach to learn minimum-size decision sets by enumerating individual rules of the target decision set independently of each other, and then solving a set cover problem to select a subset of rules. The approach makes use of modern maximum satisfiability and integer linear programming technologies. Experiments on a wide range of publicly available datasets demonstrate the advantage of the new approach over the state of the art in SAT-based decision set learning.

The video of this talk cannot be embedded. You can watch it here:
https://slideslive.com/38949023
(Link will open in new window)
 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at AAAI 2021 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 16:56 
 0
 0
 0
 0
 14:43 
 0
 0
 0
 0
 15:02 
 0
 0
 0
 0
 9:41 
 0
 0
 0
 0
 3:18 
 0
 0
 0
 0
 19:31 
 0
 0
 0
 0
 14:56 
 0
 0
 0
 0
 10:41 
 0
 0
 0
 0
 15:00 
 0
 0
 0
 0
 4:46 
 0
 0
 0
 0
 4:15 
 0
 0
 0
 0
 5:07 
 0
 0
 0
 0
 15:07 
 0
 0
 0
 0
 20:19 
 0
 0
 0
 0
 4:25 
 0
 0
 0
 0
 10:08 
 0
 0
 0
 0
 4:43 
 0
 0
 0
 0
 15:08 
 0
 0
 0
 0
 5:25 
 0
 0
 0
 0
 4:52 
 0
 0
 0
 0
 14:02 
 0
 0
 0
 0
 4:57 
 0
 0
 0
 0
 2:59 
 0
 0
 0
 0
 4:21 
 0
 0
 0
 0
 12:25 
 0
 0
 0
 0
 10:05 
 0
 0
 0
 0
 14:20 
 0
 0
 0
 0
 1:01 
 0
 0
 0
 0
 15:23 
 0
 0
 0
 0
 5:09 
 1
 0
 0
 0
 18:10 
 0
 0
 0
 0
 5:03 
 0
 0
 0
 0
 11:49 
 0
 0
 0
 0
 3:20 
 0
 0
 0
 0
 17:50 
 0
 0
 0
 0
 14:40 
 0
 0
 0
 0
 12:19 
 0
 0
 0
 0
 4:41 
 0
 0
 0
 0
 13:10 
 0
 0
 0
 0
 4:53