Challenge: Existing methods that require exhaustive exemplar-exemplar relevance comparisons do not consider summary lengths.
Approach: They propose a Diverse Length-aware Maximal Marginal Relevance algorithm to better control summary lengths.
Outcome: The proposed algorithm reduces the computational cost and memory consumption while maintaining the same level of informativeness.

Similar Papers

Multi-document Summarization with Maximal Marginal Relevance-guided Reinforcement Learning (2020.emnlp-main)

Copied to clipboard

Challenge: Recent studies on single-document summarization (SDS) benefit from advances in neural sequence learning, but they produce unsatisfactory results on multi-document summary (MDS).
Approach: They propose a neural sequence learning method that unifies advanced neural SDS methods and statistical measures used in classical MDS.
Outcome: The proposed method achieves state-of-the-art performance on benchmark MDS datasets.
Length Does Matter: Summary Length can Bias Summarization Metrics (2023.emnlp-main)

Copied to clipboard

Challenge: Existing summarization metrics favor shorter or longer summaries, but evaluations of these metrics are flawed.
Approach: They propose a Bayesian normalization technique that effectively diminishes this bias.
Outcome: The proposed method significantly improves the concordance between human annotators and most metrics in terms of summary coherence.
Controlling Length in Abstractive Summarization Using a Convolutional Neural Network (D18-1)

Copied to clipboard

Challenge: Convolutional neural networks (CNNs) can't generate summaries of desired lengths due to space or length constraints.
Approach: They propose an approach to constrain the summary length by extending a convolutional sequence to sequence model.
Outcome: The proposed model outperforms baseline models in terms of ROUGE score, length variations and semantic similarity.
LenAtten: An Effective Length Controlling Unit For Text Summarization (2021.findings-acl)

Copied to clipboard

Challenge: Fixed length summarization (FLS) requires generating summaries with a preset number of characters or words.
Approach: They propose a length control unit called LenAtten to break this trade-off by generating a short and coherent summary with the target length.
Outcome: The proposed model improves controllability and ROGUE scores and generalizes well.
Length Control in Abstractive Summarization by Pretraining Information Selection (2022.acl-long)

Copied to clipboard

Challenge: Existing length-controllable summarization models generate summaries as long as training data . current methods only control lengths at decoding stage, but adapt to desired lengths .
Approach: They propose a length-aware attention mechanism to adapt the encoding of the source based on the desired length.
Outcome: The proposed method produces high-quality summaries with desired lengths and even those short lengths never seen in the training data.
A Decoding Algorithm for Length-Control Summarization Based on Directed Acyclic Transformers (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for length control summarization treat the length requirement as a soft constraint, which may not always be satisfied.
Approach: They propose a novel length-control decoding algorithm based on the directed acyclic Transformer (DAT) their approach allows for multiple plausible sequence fragments and predicts a path to connect them.
Outcome: The proposed algorithm allows for multiple plausible sequence fragments and predicts a path to connect them.
Evaluating Multiple System Summary Lengths: A Case Study (D18-1)

Copied to clipboard

Challenge: Practical summarization systems are expected to produce summaries of varying lengths, per user needs.
Approach: They propose to use ROUGE metric to evaluate system summaries of multiple lengths.
Outcome: The evaluation protocol in question is competitive, the authors show . they found that the evaluation protocol is competitive with existing benchmarks.
DF-RAG: Query-Aware Diversity for Retrieval-Augmented Generation (2026.findings-eacl)

Copied to clipboard

Challenge: Retrieval-augmented generation (RAG) is a common technique for grounding language models in domain-specific information.
Approach: They propose a new retrieval technique that incorporates diversity into the retrieval step to improve performance on reasoning-intensive QA benchmarks.
Outcome: The proposed method outperforms baselines on reasoning-intensive QA benchmarks by 4–10%.
RELexED: Retrieval-Enhanced Legal Summarization with Exemplar Diversity (2025.findings-naacl)

Copied to clipboard

Challenge: Current approaches to legal summarization struggle with content theme deviation and inconsistent writing styles due to the content of the source document.
Approach: They propose a retrieval-augmented framework that utilizes exemplar summaries along with the source document to guide the model.
Outcome: The proposed model outperforms models that do not utilize exemplars and those that rely on similarity-based exemplar selection.
A New Approach to Overgenerating and Scoring Abstractive Summaries (2021.naacl-main)

Copied to clipboard

Challenge: Abstractive summarization is a learning objective to produce system outputs that resemble reference summaries on a word-to-word basis.
Approach: They propose a two-staged strategy to generate multiple variants of the target summary and score and select admissible ones according to users’ needs.
Outcome: The proposed approach can achieve state-of-the-art on benchmark summarization datasets.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations