Collaborative Research: IIS-III: Small Towards Fair Outlier Detection

离群值检测是机器学习和数据挖掘中的一个常见问题，其中分析实例/记录/对象的集合，系统识别出突出的对象。它有可能成为人工智能方法的一种有争议的使用，因为一个典型的结果是将一个项目/个人标记为不寻常，通常带有负面含义。异常值检测广泛用于许多领域的欺诈检测、监视和监管。有许多异常检测算法，但它们通常没有公平意识，这意味着它们可能会无意中歧视受保护的状态组或子组，这些组或子组通常会从规范中脱颖而出。该奖项解决了将公平性编码到各种类型的离群值检测算法中的问题，无论是基于传统数据挖掘还是基于现代深度学习。为离群值检测添加公平性将使其能够用于更广泛的任务，同时确保这些算法不会歧视。该项目包括三个核心任务，将在社交媒体和医学成像应用上进行评估。第一个任务是定义如何衡量公平。第二个任务探索如何为任务编码公平性，例如审计算法的输出以识别不公平性，以及如何对离群值检测算法的结果进行后处理以满足公平性要求。最后，第三个任务探索如何在现代深度学习算法中加入公平性，用于离群值检测。将公平性考虑纳入机器学习算法是一个重要且相对未得到充分研究的问题，这可能是由于算法类型多种多样。这个项目探讨了如何将公平机制纳入到各种各样的异常检测算法中。对于更传统的离群值检测算法，它探索了审计算法以确定输出是否不公平，然后最小化后处理输出以使其更公平。这样做将涉及将这些问题公式化为离散优化问题，搜索不公平的例子，并搜索在异常值和正常类之间移动哪些实例以提高公平性。对于离群值检测的深度学习公式，该项目将探索通过许多不同的策略将公平性直接编码到训练算法中，其核心目标是确定哪一种是最合适和最有用的。深度公平离群值检测的一个特殊挑战是离群值可以以几种方式呈现：i）使用阈值，ii）作为有序列表，或iii）作为分数。该项目将研究所有三种设置。它将评估社交媒体平台上用于帐户和内容过滤的第一种异常值检测（与SNAP），以及医学成像应用中使用异常值检测进行数据预处理的最后两种类型（与加州大学戴维斯分校医学中心）。该奖项反映了NSF的法定使命，并通过使用基金会的知识价值和更广泛的影响审查标准进行评估而被认为值得支持。

Outlier detection is a common problem in machine learning and data mining, in which a collection of instances/records/objects is analyzed and the system identifies ones that stand out. It has the potential of being a controversial use of AI methods, as a typical outcome is to label an item/individual as being unusual, often with negative connotations. Outlier detection is used extensively in the context of fraud detection, surveillance, and policing in numerous domains. There are many outlier-detection algorithms, but they are typically not fairness-aware, meaning they could inadvertently discriminate against protected status groups or subgroups, which often stand out from the norm. This award addresses the problem of encoding fairness into various types of outlier-detection algorithms, both traditional data-mining based as well as modern deep learning based. Adding fairness to outlier detection will allow it to be used in a wider variety of tasks while ensuring that these algorithms do not discriminate. The project consists of three core tasks, to be evaluated on social media and medical imaging applications. The first task consists of defining how to measure fairness. The second task explores how to encode fairness for tasks such as auditing the output of an algorithm to identify unfairness and how to post-process the results of an outlier-detection algorithm to meet fairness requirements. Finally, the third task explores adding fairness to modern deep learning-based algorithms used for outlier detection.Incorporating fairness considerations into machine-learning algorithms is an important and relatively understudied problem—potentially due to the wide variety of algorithm types. This project explores how to include fairness mechanisms into a wide variety of outlier-detection algorithms. For more traditional outlier-detection algorithms, it explores auditing the algorithm to determine if the output is unfair and then minimally post-processing the output to make it fairer. Doing so will involve formulating these problems as discrete optimization problems that search for examples of unfairness and search for which instances to move between the outlier and normal classes to elevate fairness. For deep learning formulations of outlier detection, the project will explore directly encoding fairness into the training algorithms via a number of different strategies, with a core goal of determining which is the most appropriate and useful. A particular challenge for deep fair outlier detection is that outliers can be presented in several ways: i) using thresholds, ii) as an ordered list, or iii) as a score. The project will study all three settings. It will evaluate the first type of outlier detection on a social media platform for account and content filtering (with SNAP), and the last two types on medical imaging applications that employ outlier detection for data preprocessing (with UC Davis Medical Center).This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.