Pith. sign in

A Survey on Explainable Artificial Intelligence (XAI): Towards Medical XAI

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Recently, artificial intelligence and machine learning in general have demonstrated remarkable performances in many tasks, from image processing to natural language processing, especially with the advent of deep learning. Along with research progress, they have encroached upon many different fields and disciplines. Some of them require high level of accountability and thus transparency, for example the medical sector. Explanations for machine decisions and predictions are thus needed to justify their reliability. This requires greater interpretability, which often means we need to understand the mechanism underlying the algorithms. Unfortunately, the blackbox nature of the deep learning is still unresolved, and many machine decisions are still poorly understood. We provide a review on interpretabilities suggested by different research works and categorize them. The different categories show different dimensions in interpretability research, from approaches that provide "obviously" interpretable information to the studies of complex patterns. By applying the same categorization to interpretability in medical research, it is hoped that (1) clinicians and practitioners can subsequently approach these methods with caution, (2) insights into interpretability will be born with more considerations for medical practices, and (3) initiatives to push forward data-based, mathematically- and technically-grounded medical education are encouraged.

fields

cs.LG 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

Efficient computation of counterfactual explanations of LVQ models

cs.LG · 2019-08-02 · conditional · novelty 6.0

Counterfactual explanations for LVQ classifiers can be computed by solving closed-form linear, quadratic, or non-convex QCQP programs derived from the nearest-prototype rule, yielding faster and closer counterfactuals than generic optimizers.

citing papers explorer

Showing 1 of 1 citing paper.

  • Efficient computation of counterfactual explanations of LVQ models cs.LG · 2019-08-02 · conditional · none · ref 7 · internal anchor

    Counterfactual explanations for LVQ classifiers can be computed by solving closed-form linear, quadratic, or non-convex QCQP programs derived from the nearest-prototype rule, yielding faster and closer counterfactuals than generic optimizers.