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

基于压缩异构图的多文档文摘

Compressed Heterogeneous Graph for Abstractive Multi-Document Summarization

School of Computing and Information Systems, The University of Melbourne(墨尔本大学计算与信息系统学院)

Miao Li, Jianzhong Qi, Jey Han Lau

摘要:

多文档摘要(MDS)旨在为多个相关文档生成摘要。我们提出了HGSUM,一种扩展编码器-解码器架构的MDS模型,以合并异构图来表示不同的语义单元(例如,的句子和句子)。这与现有的MDS模型形成对比,现有的MDS模型不考虑不同边缘类型的图,因此不捕获文档中关系的多样性。为了只保留异构图中文档的关键信息和关系,HGSUM使用图池来压缩输入图。为了指导HGSUM学习压缩,我们引入了一个额外的目标,该目标可以最大限度地提高压缩图与训练期间根据地面实况摘要构建的图之间的相似性。HGSUM使用图相似性和标准交叉熵目标进行端到端训练。在MULTI-NEWS、WCEP-100和ARXIV上的实验结果表明,HGSUM的性能优于最先进的MDS模型。我们的模型和实验的代码可以在www.example.com上找到。

英文摘要:

Multi-document summarization (MDS) aims to generate a summary for a number of related documents. We propose HGSUM, an MDS model that extends an encoder-decoder architecture, to incorporate a heterogeneous graph to represent different semantic units (e.g., words and sentences) of the documents. This contrasts with existing MDS models which do not consider different edge types of graphs and as such do not capture the diversity of relationships in the documents. To preserve only key information and relationships of the documents in the heterogeneous graph, HGSUM uses graph pooling to compress the input graph. And to guide HGSUM to learn compression, we introduce an additional objective that maximizes the similarity between the compressed graph and the graph constructed from the ground-truth summary during training. HGSUM is trained end-to-end with graph similarity and standard cross-entropy objectives. Experimental results over MULTI-NEWS, WCEP-100, and ARXIV show that HGSUM outperforms state-of-the-art MDS models. The code for our model and experiments is available at: https://github.com/oaimli/HGSum.

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

↑