The Need for Interpretability Biases

被引:2
作者
Fuernkranz, Johannes [1 ]
Kliegr, Tomas [2 ]
机构
[1] Tech Univ Darmstadt, Dept Comp Sci, Knowledge Engn Grp, Darmstadt, Germany
[2] Univ Econ, Dept Informat & Knowledge Engn, Prague, Czech Republic
来源
ADVANCES IN INTELLIGENT DATA ANALYSIS XVII, IDA 2018 | 2018年 / 11191卷
关键词
CONJUNCTION FALLACY; OCCAMS RAZOR; HEURISTICS; SELECTION;
D O I
10.1007/978-3-030-01768-2_2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In his seminal paper, Mitchell has defined bias as "any basis for choosing one generalization over another, other than strict consistency with the observed training instances", such as the choice of the hypothesis language or any form of preference relation between its elements. The most commonly used form is a simplicity bias, which prefers simpler hypotheses over more complex ones, even in cases when the latter provide a better fit to the data. Such a bias not only helps to avoid overfitting, but is also commonly considered to foster interpretability. In this talk, we will question this assumption, in particular with respect to commonly used rule learning heuristics that aim at learning rules that are as simple as possible. We will, in contrary, argue that in many cases, short rules are not desirable from the point of view of interpretability, and present some evidence from crowdsourcing experiments that support this hypothesis. To understand interpretability, we must relate machine learning biases to cognitive biases, which let humans prefer certain explanations over others, even in cases when such a preference cannot be rationally justified. Only then can we develop suitable interpretability biases for machine learning.
引用
收藏
页码:15 / 27
页数:13
相关论文
共 48 条
[1]   User-oriented Assessment of Classification Model Understandability [J].
Allahyari, Hiva ;
Lavesson, Niklas .
ELEVENTH SCANDINAVIAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (SCAI 2011), 2011, 227 :11-19
[2]  
[Anonymous], 2007, The Minimum Description Length Principle
[3]  
[Anonymous], 1930, UBERFLUSSIGE WESENHE
[4]  
[Anonymous], 2013, KOLMOGOROV DIRECTION
[5]  
Bensusan H., 1998, Machine Learning: ECML-98. 10th European Conference on Machine Learning. Proceedings, P119, DOI 10.1007/BFb0026680
[6]   OCCAM RAZOR [J].
BLUMER, A ;
EHRENFEUCHT, A ;
HAUSSLER, D ;
WARMUTH, MK .
INFORMATION PROCESSING LETTERS, 1987, 24 (06) :377-380
[7]  
Cohen W. W., 1995, Machine Learning. Proceedings of the Twelfth International Conference on Machine Learning, P115
[8]   The role of occam's razor in knowledge discovery [J].
Domingos, P .
DATA MINING AND KNOWLEDGE DISCOVERY, 1999, 3 (04) :409-425
[9]  
Freitas A.A., 2014, ACM SIGKDD Explorat. Newsl., V15, P1, DOI [10.1145/2594473.2594475, DOI 10.1145/2594473.2594475]
[10]   ROC 'n' rule learning -: Towards a better understanding of covering algorithms [J].
Fürnkranz, J ;
Flach, PA .
MACHINE LEARNING, 2005, 58 (01) :39-77