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

动态数据集中用于检索的递归抽象处理

Recursive Abstractive Processing for Retrieval in Dynamic Datasets

EPFL(洛桑联邦理工学院);Philico SA(菲利科公司)

Charbel Chucri, Rami Azouz, Joachim Ott

AI总结:

针对动态数据集层次检索结构难以更新的问题,本文提出递归抽象树维护算法及兼容任意检索器的查询导向黑盒检索后处理层,实验证明可有效处理动态数据并提升检索性能。

摘要:

近期的检索增强模型通过递归嵌入、聚类和摘要,在检索到的文本块上构建层次结构,从而增强基础方法。随后,系统会从原始文本和生成的摘要中检索最相关的信息。然而,这类方法在动态数据集上面临局限:随着时间推移添加或删除文档,会使通过聚类形成的层次表示更新变得复杂。我们提出一种新算法,可在动态数据集中高效维护递归抽象树结构,同时不损失性能。此外,我们提出一种新颖的检索后方法,通过应用面向查询的递归抽象处理,显著提升上下文质量。该方法充当兼容任意检索算法的黑盒检索后层,克服了其他方法的局限。两种算法均在真实世界数据集上通过大量实验得到验证,证明了它们在处理动态数据和提升检索性能方面的有效性。

英文摘要:

Recent retrieval-augmented models enhance basic methods by building a hierarchical structure over retrieved text chunks through recursive embedding, clustering, and summarization. The most relevant information is then retrieved from both the original text and generated summaries. However, such approaches face limitations with dynamic datasets, where adding or removing documents over time complicates the updating of hierarchical representations formed through clustering. We propose a new algorithm to efficiently maintain the recursive-abstractive tree structure in dynamic datasets, without compromising performance. Additionally, we introduce a novel post-retrieval method that applies query-focused recursive abstractive processing to substantially improve context quality. Our method overcomes the limitations of other approaches by functioning as a black-box post-retrieval layer compatible with any retrieval algorithm. Both algorithms are validated through extensive experiments on real-world datasets, demonstrating their effectiveness in handling dynamic data and improving retrieval performance.

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

↑