权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

III: Small: Collaborative Research: Algorithms, systems, and theories for exploiting data dependencies in crowdsourcing

III：小型：协作研究：在众包中利用数据依赖性的算法、系统和理论

基本信息

批准号：
2007941
负责人：
Qi Li
金额：
$ 25万
依托单位：
Iowa State University
依托单位国家：
美国
项目类别：
Standard Grant
财政年份：
2020
资助国家：
美国
起止时间：
2020-10-01 至 2024-09-30
项目状态：
已结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=2007941&HistoricalAwards=false
关键词：
III Small Collaborative Research Algorithms

项目摘要

Data are abundantly available to encode knowledge in many domains, such as biomedical research, online commerce, open government, education, and public health. Machine learning is a powerful tool to discover novel knowledge from data and to help individuals and organizations make informed decisions. However, machine learning needs to be bootstrapped by human-annotated knowledge, which can be expensive to obtain and also contain human errors. The team of researchers discovers and exploits the dependencies in the data, via novel methodologies to significantly reduce the cost and noises when providing critical knowledge for machine learning. The research outputs, including algorithms, systems, and theories, are sufficiently generic to benefit many domains where machine learning is applicable. By conducting the fundamental research, the team will train undergraduates and graduates for the STEM workforce in the nation.The researchers will collaborate to develop algorithms, systems, and theories for reducing costs and noises when annotating dependent data, termed as “structured annotations”, to provide supervision knowledge for machine learning. While the dependencies can make data annotations costly and error-prone, the researchers view the dependencies as a useful inductive bias for selective and accurate annotations. In particular, the research team proposes a human-in-the-loop system to aid the construction of proper probabilistic graphical models to encode the dependencies. The project team combines contextual and multi-armed bandits with scalable graph inference algorithms to reduce labeling costs. Based on the graphical bandits, the team addresses the budget allocation when querying labels of the same data point repetitively for robustness. With noisy human annotations, the team formulates optimization problems and algorithms to jointly infer the annotator competences and the ground truth labels of the data. From the theoretical perspective, the project will advance the active learning in crowdsourcing settings with more realistic noise distributions and will analyze the regrets in structured annotations. The project will result in datasets, algorithms, and a testbed system that benefit not only the core machine learning research community but also many domains that use machine learning.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.

在许多领域，如生物医学研究、在线商务、开放式政府、教育和公共卫生，都有大量的数据可用于编码知识。机器学习是从数据中发现新知识并帮助个人和组织做出明智决策的强大工具。然而，机器学习需要由人类注释的知识引导，这可能是昂贵的获得，也包含人为错误。研究团队发现并利用数据中的依赖关系，通过新颖的方法，在为机器学习提供关键知识时显着降低成本和噪音。研究成果，包括算法、系统和理论，都是足够通用的，可以使机器学习适用的许多领域受益。通过进行基础研究，该团队将为全国的STEM劳动力培养本科生和研究生。研究人员将合作开发算法，系统和理论，以减少注释依赖数据时的成本和噪音，称为"结构化注释"，为机器学习提供监督知识。虽然依赖关系可能会使数据注释成本高昂且容易出错，但研究人员认为依赖关系是选择性和准确注释的有用归纳偏差。特别是，研究小组提出了一个人在回路系统，以帮助构建适当的概率图形模型来编码依赖关系。该项目团队将上下文和多臂强盗与可扩展的图推理算法相结合，以降低标记成本。基于图形强盗，该团队在重复查询同一数据点的标签时解决了预算分配问题，以确保鲁棒性。通过嘈杂的人类注释，该团队制定了优化问题和算法，以共同推断注释者的能力和数据的地面真实标签。从理论的角度来看，该项目将在具有更真实的噪声分布的众包环境中推进主动学习，并将分析结构化注释中的遗憾。该项目将产生数据集、算法和测试平台系统，不仅有利于核心机器学习研究社区，也有利于许多使用机器学习的领域。该奖项反映了NSF的法定使命，并通过使用基金会的知识价值和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

期刊论文数量（9）

专著数量（0）

科研奖励数量（0）

会议论文数量（0）

专利数量（0）

SagDRE: Sequence-Aware Graph-Based Document-Level Relation Extraction with Adaptive Margin Loss

DOI：
10.1145/3534678.3539304
发表时间：
2022-08
期刊：
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
影响因子：
0
作者：
Ying Wei;Qi Li
通讯作者：
Ying Wei;Qi Li

Relation-Aware Network with Attention-Based Loss for Few-Shot Knowledge Graph Completion

DOI：
10.1007/978-3-031-33380-4_8
发表时间：
2023-06
期刊：
ArXiv
影响因子：
0
作者：
Qiao Qiao-Qiao;Yuepei Li;Kang Zhou;Qi Li
通讯作者：
Qiao Qiao-Qiao;Yuepei Li;Kang Zhou;Qi Li

CPTAM: Constituency Parse Tree Aggregation Method

CPTAM：选区解析树聚合方法

DOI：
10.1137/1.9781611977172.71
发表时间：
2022
期刊：
Proceedings of the SIAM International Conference on Data Mining
影响因子：
0
作者：
Kulkarni, Adithya;Sabetpour, Nasim;Markin, Alexey;Eulenstein, Oliver;Li, Qi
通讯作者：
Li, Qi

OptSLA: an Optimization-Based Approach for Sequential Label Aggregation

OptSLA：一种基于优化的顺序标签聚合方法

DOI：
发表时间：
2020
期刊：
Findings of the Association for Computational Linguistics: EMNLP 2020
影响因子：
0
作者：
Sabetpour, Nasim;Kulkarni, Adithya;Li, Qi
通讯作者：
Li, Qi

Open-Domain Aspect-Opinion Co-Mining with Double-Layer Span Extraction

DOI：
10.1145/3534678.3539386
发表时间：
2022-08
期刊：
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
影响因子：
0
作者：
Mohna Chakraborty;Adithya Kulkarni;Qi Li
通讯作者：
Mohna Chakraborty;Adithya Kulkarni;Qi Li