人类世界能够赋予的最高学历,一般被视为进入科研领域和学术圈的门槛。

VIP内容

报告主题: 信息检索

报告摘要: 引入结构化的知识是目前辅助自然语言处理任务的重要方法之一。如何准确地从自由文本中获取结构化信息,以及进行有效的知识表示在近几年取得了广泛关注。在这次报告中,讲者将梳理知识表示与获取的发展脉络,分享相关领域的最新工作进展,报告人将会以他在知识表示与关系抽取上的若干代表工作为例子,对研究中遇到的具体问题进行深入探讨分析,并结合讲者个人的工作经验,讨论如何体系化地开展研究工作以及学术合作等问题,分享其在解决问题的过程中的一些心得体会。

邀请嘉宾: 韩旭 清华大学计算机系17级博士研究生,来自清华大学自然语言处理组,由刘知远副教授指导,主要研究方向为自然语言处理及信息抽取。目前已在人工智能、自然语言处理等领域的著名国际会议ACL,EMNLP,NAACL,COLING,AAAI发表相关论文多篇,在Github上维护开源工程多项。

成为VIP会员查看完整内容
0
27

最新论文

We introduce a variant of the three-sided stable matching problem for a PhD market with students, advisors, and co-advisors. In our formalization, students have consistent (lexicographic) preferences over advisors and co-advisors, and the latter have preferences over students only (hence advisors and co-advisors are cooperative). A student must be matched to one advisor and one co-advisor, or not at all. In contrast to previous work, advisor-student and student-co-advisor pairs may not be mutually acceptable, e.g., a student may not want to work with an advisor or co-advisor and vice versa. We show that stable three-sided matchings always exist, and present the PhD algorithm, a three-sided matching algorithm with polynomial running time which uses any two-sided stable matching algorithm as matching engine. Borrowing from results on two-sided markets, we provide some approximate optimality results. We also present an extension to three-sided markets with quotas, where each student conducts several projects, and each project is supervised by one advisor and one co-advisor. As it is often the case in practice that the same student should not do more than one project with the same advisor or co-advisor, we modify our PhD algorithm for this setting by adapting the two-sided Gale--Shapley algorithm to many-to-many two-sided markets, in which the same pair can match at most once. We also generalize the three-sided market to an $n$-sided market consisting of $n-1$ two-sided markets. We extend the PhD algorithm to this multi-sided setting to compute a stable matching in polynomial time, and we discuss its extension to arbitrary quotas. Finally, we illustrate the challenges that arise when not all advisor-co-advisor pairs are compatible, and critically review the statements from [30, 29].

0
0
下载
预览
Top