arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2012.02287cs.IRcs.CLcs.LG
收藏

用于联合检索和分类的由粗到细记忆匹配

Coarse-to-Fine Memory Matching for Joint Retrieval and Classification

Harvard University(哈佛大学)

Allen Schmaltz, Andrew Beam

摘要:

我们提出了一种新的端到端的联合检索和分类的语言模型,统一的双和交叉编码器的优势到一个单一的语言模型通过一个粗到细的记忆匹配搜索过程的学习和推理。在FEVER事实验证数据集的标准盲测试集上进行评估,分类准确率显著高于仅依赖于语言模型参数作为知识库的方法,并且接近一些最近的多模型管道系统,仅使用单个BERT基础模型与存储器层增强。我们进一步展示了如何耦合检索和分类可以利用,以确定低置信度的情况下,我们扩展样本审计,以分析和约束模型的设置。因此,我们的方法产生了一种更新语言模型的行为,通过两个不同的机制:检索到的信息可以显式更新,模型的行为可以通过范例数据库进行修改。

英文摘要:

We present a novel end-to-end language model for joint retrieval and classification, unifying the strengths of bi- and cross- encoders into a single language model via a coarse-to-fine memory matching search procedure for learning and inference. Evaluated on the standard blind test set of the FEVER fact verification dataset, classification accuracy is significantly higher than approaches that only rely on the language model parameters as a knowledge base, and approaches some recent multi-model pipeline systems, using only a single BERT base model augmented with memory layers. We further demonstrate how coupled retrieval and classification can be leveraged to identify low confidence instances, and we extend exemplar auditing to this setting for analyzing and constraining the model. As a result, our approach yields a means of updating language model behavior through two distinct mechanisms: The retrieved information can be updated explicitly, and the model behavior can be modified via the exemplar database.

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

↑