A Note on the Interpretability of Machine Learning Algorithms - Université Paris 1 Panthéon-Sorbonne Accéder directement au contenu
Autre Publication Scientifique Documents de travail du Centre d'Économie de la Sorbonne Année : 2020

A Note on the Interpretability of Machine Learning Algorithms

Résumé

We are interested in the analysis of the concept of interpretability associated with a ML algorithm. We distinguish between the "How", i.e., how a black box or a very complex algorithm works, and the "Why", i.e. why an algorithm produces such a result. These questions appeal to many actors, users, professions, regulators among others. Using a formal standardized framework , we indicate the solutions that exist by specifying which elements of the supply chain are impacted when we provide answers to the previous questions. This presentation, by standardizing the notations, allows to compare the different approaches and to highlight the specificities of each of them: both their objective and their process. The study is not exhaustive and the subject is far from being closed.
Fichier principal
Vignette du fichier
20012.pdf (471.69 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

halshs-02900929 , version 1 (16-07-2020)

Identifiants

  • HAL Id : halshs-02900929 , version 1

Citer

Dominique Guegan. A Note on the Interpretability of Machine Learning Algorithms. 2020. ⟨halshs-02900929⟩
154 Consultations
449 Téléchargements

Partager

Gmail Facebook X LinkedIn More