Interpretable Machine Learning for Discovery: Statistical Challenges and Opportunities

被引:15
作者
Allen, Genevera I. [1 ,2 ,3 ,4 ]
Gan, Luqin [2 ]
Zheng, Lili [1 ]
机构
[1] Rice Univ, Dept Elect & Comp Engn, Houston, TX 77005 USA
[2] Rice Univ, Dept Stat, Houston, TX 77005 USA
[3] Rice Univ, Dept Comp Sci, Houston, TX 77005 USA
[4] Baylor Coll Med, Neurol Res Inst, Houston, TX 77030 USA
基金
美国国家卫生研究院; 美国国家科学基金会;
关键词
machine learning; interpretability; explainability; data-driven discoveries; validation; stability; selection consistency; uncertainty quantification; VARIABLE SELECTION; CONSISTENCY; VALIDATION; MODELS;
D O I
10.1146/annurev-statistics-040120-030919
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
New technologies have led to vast troves of large and complex data sets across many scientific domains and industries. People routinely use machine learning techniques not only to process, visualize, and make predictions from these big data, but also to make data-driven discoveries. These discoveries are often made using interpretable machine learning, or machine learning models and techniques that yield human-understandable insights. In this article, we discuss and review the field of interpretable machine learning, focusing especially on the techniques, as they are often employed to generate new knowledge or make discoveries from large data sets.We outline the types of discoveries that can be made using interpretable machine learning in both supervised and unsupervised settings. Additionally, we focus on the grand challenge of how to validate these discoveries in a data-driven manner, which promotes trust in machine learning systems and reproducibility in science.We discuss validation both from a practical perspective, reviewing approaches based on data-splitting and stability, as well as from a theoretical perspective, reviewing statistical results on model selection consistency and uncertainty quantification via statistical inference. Finally, we conclude by highlighting open challenges in using interpretable machine learning techniques to make discoveries, including gaps between theory and practice for validating data-driven discoveries.
引用
收藏
页码:97 / 121
页数:25
相关论文
共 105 条
[2]  
[Anonymous], 1996, GRAPHICAL MODELS
[3]  
Baker M, 2016, NATURE, V533, P452, DOI 10.1038/533452a
[4]   A KNOCKOFF FILTER FOR HIGH-DIMENSIONAL SELECTIVE INFERENCE [J].
Barber, Rina Foygel ;
Candes, Emmanuel J. .
ANNALS OF STATISTICS, 2019, 47 (05) :2504-2537
[5]   Explainable Artificial Intelligence (XAI): Concepts, taxonomies, opportunities and challenges toward responsible AI [J].
Barredo Arrieta, Alejandro ;
Diaz-Rodriguez, Natalia ;
Del Ser, Javier ;
Bennetot, Adrien ;
Tabik, Siham ;
Barbado, Alberto ;
Garcia, Salvador ;
Gil-Lopez, Sergio ;
Molina, Daniel ;
Benjamins, Richard ;
Chatila, Raja ;
Herrera, Francisco .
INFORMATION FUSION, 2020, 58 :82-115
[6]   Iterative random forests to discover predictive and stable high-order interactions [J].
Basu, Sumanta ;
Kumbier, Karl ;
Brown, James B. ;
Yu, Bin .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2018, 115 (08) :1943-1948
[7]   Challenges to the Reproducibility of Machine Learning Models in Health Care [J].
Beam, Andrew L. ;
Manrai, Arjun K. ;
Ghassemi, Marzyeh .
JAMA-JOURNAL OF THE AMERICAN MEDICAL ASSOCIATION, 2020, 323 (04) :305-306
[8]   Representation Learning: A Review and New Perspectives [J].
Bengio, Yoshua ;
Courville, Aaron ;
Vincent, Pascal .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (08) :1798-1828
[9]   CONTROLLING THE FALSE DISCOVERY RATE - A PRACTICAL AND POWERFUL APPROACH TO MULTIPLE TESTING [J].
BENJAMINI, Y ;
HOCHBERG, Y .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY, 1995, 57 (01) :289-300
[10]  
Berkhin P, 2006, GROUPING MULTIDIMENSIONAL DATA: RECENT ADVANCES IN CLUSTERING, P25