arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.04035cs.DBcs.LG
收藏

实体解析和联邦学习得到联合解析

Entity Resolution and Federated Learning get a Federated Resolution

University of Amsterdam(阿姆斯特丹大学);Australian National University(澳大利亚国立大学);University of Sydney(悉尼大学);N1 Analytics(N1分析公司);Data61(Data61数据科学研究中心)

Richard Nock, Stephen Hardy, Wilko Henecka, Hamish Ivey-Law, Giorgio Patrini, Guillaume Smith, Brian Thorne

摘要:

考虑两个数据提供者,每个都维护关于公共实体的不同特征集的记录。他们的目标是在整个特征集上学习线性模型。垂直分区数据上的联邦学习问题包括一个关键的上游问题:实体解析,即找到数据集行之间的对应关系。众所周知,实体解析和学习一样,在现实世界中也是容易出错的。尽管问题的重要性,一直没有正式的评估如何在实体分辨率的错误影响学习。在本文中,我们对这个问题提供了一个彻底的答案,回答了最佳分类器,经验损失,利润率和泛化能力是如何受到影响的。虽然我们的答案涵盖了广泛的损失-超越了正确的,凸的,或分类校准-它带来了简单的实际参数,以升级实体分辨率作为学习的预处理步骤。其中之一表明,实体解析的目的应该是控制或最小化不同类的示例之间的匹配错误的数量。在我们的实验中,我们修改了一个简单的基于令牌的实体分辨率算法,使其确实旨在避免匹配属于不同类别的行,并在实体分辨率依赖于噪声数据的设置中进行实验,这与现实世界的领域非常相关。值得注意的是,我们的方法涵盖的情况下,一个对等\textit{does not}类,或类的嘈杂记录。实验表明,在实体分解过程中使用类信息可以从复杂度的角度以很小的代价获得显著的学习提升。

英文摘要:

Consider two data providers, each maintaining records of different feature sets about common entities. They aim to learn a linear model over the whole set of features. This problem of federated learning over vertically partitioned data includes a crucial upstream issue: entity resolution, i.e. finding the correspondence between the rows of the datasets. It is well known that entity resolution, just like learning, is mistake-prone in the real world. Despite the importance of the problem, there has been no formal assessment of how errors in entity resolution impact learning. In this paper, we provide a thorough answer to this question, answering how optimal classifiers, empirical losses, margins and generalisation abilities are affected. While our answer spans a wide set of losses --- going beyond proper, convex, or classification calibrated ---, it brings simple practical arguments to upgrade entity resolution as a preprocessing step to learning. One of these suggests that entity resolution should be aimed at controlling or minimizing the number of matching errors between examples of distinct classes. In our experiments, we modify a simple token-based entity resolution algorithm so that it indeed aims at avoiding matching rows belonging to different classes, and perform experiments in the setting where entity resolution relies on noisy data, which is very relevant to real world domains. Notably, our approach covers the case where one peer \textit{does not} have classes, or a noisy record of classes. Experiments display that using the class information during entity resolution can buy significant uplift for learning at little expense from the complexity standpoint.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑