HyperAIHyperAI

Command Palette

Search for a command to run...

3 months ago

Systematically Exploring Redundancy Reduction in Summarizing Long Documents

Wen Xiao Giuseppe Carenini

Systematically Exploring Redundancy Reduction in Summarizing Long Documents

Abstract

Our analysis of large summarization datasets indicates that redundancy is a very serious problem when summarizing long documents. Yet, redundancy reduction has not been thoroughly investigated in neural summarization. In this work, we systematically explore and compare different ways to deal with redundancy when summarizing long documents. Specifically, we organize the existing methods into categories based on when and how the redundancy is considered. Then, in the context of these categories, we propose three additional methods balancing non-redundancy and importance in a general and flexible way. In a series of experiments, we show that our proposed methods achieve the state-of-the-art with respect to ROUGE scores on two scientific paper datasets, Pubmed and arXiv, while reducing redundancy significantly.

Code Repositories

Benchmarks

BenchmarkMethodologyMetrics
text-summarization-on-arxivExtSum-LG+RdLoss
ROUGE-1: 44.01
ROUGE-2: 17.79
ROUGE-L: 39.09
text-summarization-on-arxivExtSum-LG+MMR-Select+
ROUGE-1: 43.87
ROUGE-2: 17.5
ROUGE-L: 38.97
text-summarization-on-pubmed-1ExtSum-LG+MMR-Select+
ROUGE-1: 45.39
ROUGE-2: 20.37
ROUGE-L: 40.99
text-summarization-on-pubmed-1ExtSum-LG+RdLoss
ROUGE-1: 45.3
ROUGE-2: 20.42
ROUGE-L: 40.95

Build AI with AI

From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.

AI Co-coding
Ready-to-use GPUs
Best Pricing
Get Started

Hyper Newsletters

Subscribe to our latest updates
We will deliver the latest updates of the week to your inbox at nine o'clock every Monday morning
Powered by MailChimp
Systematically Exploring Redundancy Reduction in Summarizing Long Documents | Papers | HyperAI