arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.03720cs.IR
收藏

保持文档表示的结构和语义

Structure and Semantics Preserving Document Representations

Natraj Raman, Sameena Shah, Manuela Veloso

摘要:

从语料库中检索相关文档通常基于文档内容和查询文本之间的语义相似性。包含文档之间的结构关系可以通过解决语义缺口而有益于检索机制。然而,合并这些关系需要易于处理的机制,平衡结构与语义,并利用流行的预训练/微调范式。在这里,我们提出了一个整体的方法来学习文档表示,通过整合文档内的内容与文档间的关系。我们的深度度量学习解决方案分析了关系网络中的复杂邻域结构,以有效地对相似/不相似的文档对进行采样,并定义了一个新的五元组损失函数,该函数同时鼓励语义相关的文档对在表示空间中更接近,结构上不相关的文档对在表示空间中相距较远。此外,文档之间的分隔边界灵活地变化,以编码关系强度的异质性。该模型是完全可微调的,并且在推理过程中原生地支持查询投影。我们证明,它优于竞争的方法在多个数据集上的文档检索任务。

英文摘要:

Retrieving relevant documents from a corpus is typically based on the semantic similarity between the document content and query text. The inclusion of structural relationship between documents can benefit the retrieval mechanism by addressing semantic gaps. However, incorporating these relationships requires tractable mechanisms that balance structure with semantics and take advantage of the prevalent pre-train/fine-tune paradigm. We propose here a holistic approach to learning document representations by integrating intra-document content with inter-document relations. Our deep metric learning solution analyzes the complex neighborhood structure in the relationship network to efficiently sample similar/dissimilar document pairs and defines a novel quintuplet loss function that simultaneously encourages document pairs that are semantically relevant to be closer and structurally unrelated to be far apart in the representation space. Furthermore, the separation margins between the documents are varied flexibly to encode the heterogeneity in relationship strengths. The model is fully fine-tunable and natively supports query projection during inference. We demonstrate that it outperforms competing methods on multiple datasets for document retrieval tasks.

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

↑