Unmasking Clever Hans predictors and assessing what machines really learn.
Ontology highlight
ABSTRACT: Current learning machines have successfully solved hard application problems, reaching high accuracy and displaying seemingly intelligent behavior. Here we apply recent techniques for explaining decisions of state-of-the-art learning machines and analyze various tasks from computer vision and arcade games. This showcases a spectrum of problem-solving behaviors ranging from naive and short-sighted, to well-informed and strategic. We observe that standard performance evaluation metrics can be oblivious to distinguishing these diverse problem solving behaviors. Furthermore, we propose our semi-automated Spectral Relevance Analysis that provides a practically effective way of characterizing and validating the behavior of nonlinear learning machines. This helps to assess whether a learned model
SUBMITTER: Lapuschkin S
PROVIDER: S-EPMC6411769 | biostudies-literature | 2019 Mar
REPOSITORIES: biostudies-literature
ACCESS DATA