III: Small: Collaborative Research: Towards Interpretable Machine Learning

III：小型：协作研究：迈向可解释的机器学习

• 批准号: 1526012
• 负责人: Yixin Chen
• 金额: $ 24.88万
• 依托单位: Washington University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2015
• 资助国家: 美国
• 起止时间: 2015-09-01 至 2019-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1526012&HistoricalAwards=false
• 关键词: III; Small; Collaborative; Research; Towards

This research project investigates the design and development of machine learning algorithms that make decisions that are interpretable by humans. As predictions of machine learning models are increasingly used in making decisions with critical consequences (e.g., in medicine or economics), it is important that decision makers understand the rationale behind these predictions. The project defines interpretable algorithms through three key properties; Simplicity: intuitively comprehensible by users who are not experts in machine learning, Verifiability: a clear relationship between input features and model output, and Actionability: For a given input and desired output, the user should be able to identify changes to the input features that transform the model prediction to the desired output. The project investigates how to design distance metrics supporting simplicity and verifiability, as well as algorithms to identify input changes to change outputs. The project will be evaluated in a medical context, addressing the problem of early detection of hospital patients at risk of sudden deterioration.This work builds on the well-understood k-Nearest-Neighbor classifier, which would inherently seem to provide simplicity and verifiability. The challenge is in high dimensions, e.g., when used for document classification; differences are spread across more dimensions than are humanly comprehensible. The project uses novel dimensionality reduction approaches to create dissimilarity metrics that are interpretable and accurate. Visualization techniques to present this data will be explored, including techniques supporting more complex classification approaches such as ensembles. The project investigates novel methods for delivering actionability in machine learning algorithms by identifying changes that can truly transform an entity's class membership - a problem that has recently been identified as surprisingly difficult. A secondary outcome will be improvements in classifier robustness, as small changes that change class membership are a good indication of non-robustness.

该研究项目调查了机器学习算法的设计和开发，这些算法可以做出人类可解释的决策。 随着机器学习模型的预测越来越多地用于做出具有关键后果的决策（例如，在医学或经济学中），决策者必须了解这些预测背后的基本原理。 该项目通过三个关键属性定义了可解释的算法;简单性：不是机器学习专家的用户可以直观地理解，可验证性：输入特征和模型输出之间的明确关系，可验证性：对于给定的输入和期望的输出，用户应该能够识别输入特征的变化，将模型预测转换为期望的输出。 该项目研究如何设计支持简单性和可验证性的距离度量，以及识别输入变化以改变输出的算法。 该项目将在医学背景下进行评估，解决医院患者突然恶化风险的早期检测问题。这项工作建立在众所周知的k-最近邻分类器的基础上，该分类器本身似乎提供了简单性和可验证性。 挑战在于高维度，例如，当用于文档分类时，差异分布在比人类可理解的更多的维度上。 该项目使用新颖的降维方法来创建可解释和准确的相异度量。 将探讨呈现这些数据的可视化技术，包括支持更复杂分类方法的技术，如集合。 该项目研究了在机器学习算法中提供可操作性的新方法，方法是识别可以真正改变实体类成员资格的变化-这是一个最近被认为非常困难的问题。 第二个结果将是分类器鲁棒性的改进，因为改变类成员的小变化是非鲁棒性的良好指示。