Collaborative Research: CIF: Small: Interpretable Fair Machine Learning: Frameworks, Robustness, and Scalable Algorithms

协作研究：CIF：小型：可解释的公平机器学习：框架、稳健性和可扩展算法

• 批准号: 2153607
• 负责人: Weijun Xie
• 金额: $ 25万
• 依托单位: Virginia Polytechnic Institute and State University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2022
• 资助国家: 美国
• 起止时间: 2022-02-15 至 2022-10-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2153607&HistoricalAwards=false
• 关键词: Collaborative; Research; CIF; Small; Interpretable

Machine-learning algorithms are revolutionizing modern decision-making processes, from deciding job offers, evaluating loans, and determining university enrollments to proposing medical interventions. However, despite the recent success of machine-learning algorithms in solving large-scale problems, serious concerns have been raised that they are not entirely objective and can inadvertently amplify human biases. The proposed research project addresses this fundamental shortcoming by developing scalable data-driven methods and algorithms that generate interpretable policies aiming for provable fairness guarantees. The project will inform the policy-makers or decision-makers about possible outcomes and tradeoffs between machine learning outcomes and social equity/fairness. Furthermore, the research results will provide guidelines to support policies as well as regulations to promote diversity and fairness in many relevant domains of application. The proposed research leverages recent advances in discrete and robust optimization, aiming for solution methodologies that faithfully address the exact learning models with fairness measures, provide strong out-of-sample fairness guarantees, are robust against bias and noisy outliers in the dataset, and can be solved efficiently for large-scale problem instances. More specifically, the proposed research aims to develop effective new frameworks for fair learning via sub-data selection that can leverage past efforts and enhance the fairness in the learning outcomes. Robust solution schemes will be carefully designed to significantly mitigate the severe overfitting effects of empirical-based methods and improve out-of-sample performance. Efforts will also be devoted to addressing algorithmic fairness in multi-stage decision-making and resource-allocation problems.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.

机器学习算法正在彻底改变现代决策过程，从决定工作机会、评估贷款、决定大学招生到提出医疗干预措施。然而，尽管最近机器学习算法在解决大规模问题方面取得了成功，但人们还是提出了严重的担忧，即它们并不完全客观，可能会无意中放大人类的偏见。拟议的研究项目通过开发可扩展的数据驱动方法和算法来解决这一基本缺陷，这些方法和算法生成旨在证明公平保证的可解释策略。该项目将告知政策制定者或决策者关于机器学习结果与社会公平/公平之间可能的结果和权衡。此外，研究结果将为支持政策和法规提供指导，以促进许多相关应用领域的多样性和公平性。所提出的研究利用了离散和鲁棒优化的最新进展，旨在解决具有公平性措施的精确学习模型的解决方法，提供强大的样本外公平性保证，对数据集中的偏差和噪声异常值具有鲁棒性，并且可以有效地解决大规模问题实例。更具体地说，本研究旨在通过子数据选择开发有效的公平学习新框架，以利用过去的努力并增强学习结果的公平性。稳健的解决方案将被精心设计，以显著减轻基于经验的方法的严重过拟合效应，并提高样本外性能。还将致力于解决多阶段决策和资源分配问题中的算法公平性。该奖项反映了美国国家科学基金会的法定使命，并通过使用基金会的知识价值和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

Smooth Robust Tensor Completion for Background/Foreground Separation with Missing Pixels: Novel Algorithm with Convergence Guarantee

• DOI: 10.48550/arxiv.2203.16328
• 发表时间: 2022-03
• 期刊: J. Mach. Learn. Res.
• 作者: Bo Shen;Weijun Xie;Zhen Kong