.png){kind=icon}
Return
Learning Cluster Patterns for Abstractive Summarization
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2023.3346911.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Nowadays, pre-trained sequence-to-sequence models such as PEGASUS and BART have shown state-of-the-art results in abstractive summarization. In these models, during fine-tuning, the encoder transforms sentences to context vectors in the latent space and the decoder learns the summary generation task based on the context vectors. In our approach, we consider two clusters of salient and non-salient context vectors, using which the decoder can attend more over salient context vectors for summary generation. For this, we propose a novel cluster generator layer between the encoder and the decoder, which first generates two clusters of salient and non-salient vectors, and then normalizes and shrinks the clusters to make them apart in the latent space. Our experimental results show that the proposed model outperforms the state-of-the-art models such as BART and PEGASUS by learning these distinct cluster patterns, improving up to 2 similar to 30% in ROUGE and 0.1 similar to 0.8% in BERTScore in CNN/DailyMail and XSUM data sets.
Keywords:
Abstractive summarization
cluster
contextualized vector
BART
PEGASUS
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSave
View more