Papers with XSum

27 papers
HydraSum: Disentangling Style Features in Text Summarization with Multi-Decoder Models (2022.emnlp-main)

Copied to clipboard

Challenge: Abstractive summarization systems implicitly encode “decisions” about summary properties, but these are not enforced.
Approach: They propose a new summarization architecture that extends existing models to a mixture-of-experts version with multiple decoders.
Outcome: The proposed architecture outperforms baseline models in obtaining stylistically-diverse summaries by sampling from individual decoders or their mixtures.
Entity-level Factual Adaptiveness of Fine-tuning based Abstractive Summarization Models (2024.eacl-long)

Copied to clipboard

Challenge: Abstractive summarization models generate factually inconsistent content when parametric knowledge conflicts with knowledge in the input document.
Approach: They propose a method to enhance factual adaptiveness while achieving factual consistency on original datasets.
Outcome: The proposed method improves factual adaptiveness while achieving factual consistency on original datasets.
Planning with Learned Entity Prompts for Abstractive Summarization (2021.tacl-1)

Copied to clipboard

Challenge: a simple but flexible mechanism is used to ground the generation of abstractive summaries.
Approach: They propose a mechanism to learn an intermediate plan to ground the generation of abstractive summaries.
Outcome: The proposed model outperforms state-of-the-art methods for faithfulness on CNN and BillSum.
A Well-Composed Text is Half Done! Composition Sampling for Diverse Conditional Generation (2022.acl-long)

Copied to clipboard

Challenge: Composition Sampling is a simple but effective method to generate diverse outputs for conditional generation of higher quality compared to previous stochastic decoding strategies.
Approach: They propose a method to generate diverse outputs for conditional generation . they use a plan-based neural generation model that is trained to create a composition of the output and then generate by conditioning on it and the input.
Outcome: The proposed method avoids text degeneration by first sampling a composition in the form of an entity chain and then using beam search to generate the best possible text grounded to this entity chain.
Annotating and Modeling Fine-grained Factuality in Summarization (2021.naacl-main)

Copied to clipboard

Challenge: Recent abstractive summarization systems produce factual errors that are not faithful to the input . current methods are lacking in identifying what errors are most important to target .
Approach: They use synthetic and human-labeled data to identify factual errors in summarization and train models on the factuality detection task.
Outcome: The proposed model detects factual errors on word, dependency, and sentence levels.
Multi-View Source Ablation for Faithful Summarization (2023.findings-eacl)

Copied to clipboard

Challenge: MuFaSSa is a metric for evaluating faithfulness of abstractive summaries . it uses different strategies to remove information from source document to form multiple ablated views .
Approach: They propose a metric for evaluating faithfulness of abstractive summaries using multiple ablated views.
Outcome: The proposed metric outperforms existing models on summarization tasks and human-annotated faithfulness labels.
TriSum: Learning Summarization Ability from Large Language Models with Structured Rationale (2024.naacl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have advanced tasks like text summarization, but their size and computational demands limit their use in resource-constrained and privacy-centric settings.
Approach: They propose a framework for distilling LLMs’ text summarization abilities into a compact, local model using a curriculum learning strategy that evolves from simple to complex tasks.
Outcome: The proposed framework outperforms baseline models on CNN/DailyMail, XSum, and ClinicalTrial, and improves interpretability by providing insights into the summarization rationale.
Training Dynamics for Text Summarization Models (2022.findings-acl)

Copied to clipboard

Challenge: Pre-trained language models have shown impressive results when fine-tuned on large summarization datasets.
Approach: They analyze the training dynamics for generation models, focusing on summarization . they find that a propensity to copy the input is learned early in the training process .
Outcome: The proposed model learns at different stages of fine-tuning, the authors show . they show that factual errors are learnt in later stages, but not at high-loss tokens .
BRIO: Bringing Order to Abstractive Summarization (2022.acl-long)

Copied to clipboard

Challenge: Abstractive summarization models are often trained with maximum likelihood estimation (MLE) . mLE assumes a deterministic (one-point) target distribution, but can cause performance degradation .
Approach: They propose a new training paradigm which assumes a non-deterministic distribution so that different candidate summaries are assigned probability mass according to their quality.
Outcome: The proposed model can estimate probabilities of candidate summaries that are more correlated with their level of quality.
Training Data is More Valuable than You Think: A Simple and Effective Method by Retrieving from Training Data (2022.acl-long)

Copied to clipboard

Challenge: Experimental results show that REtrieving from the traINing datA only can lead to significant gains on multiple NLG and NLU tasks.
Approach: They propose to retrieve training instances from traINing datA and concatenate them with input to generate output.
Outcome: The proposed method achieves state-of-the-art results on XSum, BigPatent, and CommonsenseQA.
Z-Code++: A Pre-trained Language Model Optimized for Abstractive Summarization (2023.acl-long)

Copied to clipboard

Challenge: Z-Code++ is a pre-trained language model optimized for abstractive text summarization.
Approach: They propose a pre-trained language model optimized for abstractive text summarization that uses a two-phase pre-training technique to improve model's performance.
Outcome: The proposed model outperforms the competing models on low-resource summarization tasks in zero-shot and few-shot settings.
SummaReranker: A Multi-Task Mixture-of-Experts Re-ranking Framework for Abstractive Summarization (2022.acl-long)

Copied to clipboard

Challenge: Sequence-to-sequence neural networks have enabled great progress in abstractive summarization.
Approach: They propose to train a second-stage model performing re-ranking on a set of summary candidates by using a mixture of experts.
Outcome: The proposed model outperforms the base model on CNN- DailyMail, XSum and Reddit TIFU with a base PEGASUS.
Abstractive Summarization Guided by Latent Hierarchical Document Structure (2022.emnlp-main)

Copied to clipboard

Challenge: Sequential abstractive summarizations often do not capture hierarchical and inter-sentential dependencies in the summmarized document.
Approach: They propose a hierarchy-aware graph neural network which captures hierarchical and inter-sentential dependencies in the summmarized document.
Outcome: The proposed model improves strong sequence models such as BART with a 0.55 and 0.75 margin in ROUGE-1/2/L for CNN/DM and XSum.
Unsupervised Summarization Re-ranking (2023.findings-acl)

Copied to clipboard

Challenge: Abstractive summarization models have been gaining popularity, but performance of unsupervised models still lags behind supervised models.
Approach: They propose to re-rank summary candidates in an unsupervised manner to close the performance gap between unsupervised and supervised models.
Outcome: The proposed model improves unsupervised models by up to 7.27% and ChatGPT by up 6.86% relative mean ROUGE across four widely-adopted summarization benchmarks.
DeCoRe: Decoding by Contrasting Retrieval Heads to Mitigate Hallucinations (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models often produce unfaithful or factually incorrect outputs . masking retrieval heads can induce hallucinations, but decoding by contrast can reduce hallucinosity .
Approach: They propose a training-free decoding strategy that contrasts the outputs of the base LLM and the masked LLM.
Outcome: The proposed decoding strategy reduces hallucinations by contrasting the outputs of the base and masked LLMs.
CLIFF: Contrastive Learning for Improving Faithfulness and Factuality in Abstractive Summarization (2021.emnlp-main)

Copied to clipboard

Challenge: Existing methods for generating abstractive summarization are inconsistent and rely on heuristically created data for error handling.
Approach: They propose a contrastive learning formulation that leverages both positive and negative summaries to train summarization systems that are better at distinguishing between them.
Outcome: The proposed learning framework produces more factual summaries than strong comparisons with post error correction, entailment-based reranking, and unlikelihood training.
Time-aware Prompting for Text Generation (2022.findings-emnlp)

Copied to clipboard

Challenge: a new study investigates the effects of incorporating timestamps into generation systems . textual prompts focus more on non-temporal information and are less sensitive to given timestams .
Approach: They propose a data-to-text generation dataset that includes chronologically ordered revisions of biographical articles from English Wikipedia.
Outcome: The proposed models improve the quality of the data-to-text generation dataset TempWikiBio . the proposed models are more sensitive to time-aware prompts than textual prompts .
Improving Factual Consistency in Summarization with Compression-Based Post-Editing (2022.emnlp-main)

Copied to clipboard

Challenge: Existing methods to improve factual consistency of summarization models fail to remove entity errors if a suitable input entity replacement is not available or insert erroneous content.
Approach: They propose to remove extrinsic entity errors, or entities not in the source, to improve consistency while retaining the summary’s essential information and form.
Outcome: The proposed model improves factual consistency while maintaining ROUGE, improving entity precision by up to 30% on XSum, and can be applied on top of another post-editor, improving accuracy by 38%.
Correcting Diverse Factual Errors in Abstractive Summarization via Post-Editing and Language Model Infilling (2022.emnlp-main)

Copied to clipboard

Challenge: Abstractive summarization models often generate inconsistent summaries containing factual errors or fabricated content.
Approach: They propose to generate representative examples of non-factual summaries through infilling language models and train a robust fact-correction model to post-edit them to improve factual consistency.
Outcome: The proposed model outperforms previous methods in correcting factual errors on two popular summarization datasets.
Who Wrote This? The Key to Zero-Shot LLM-Generated Text Detection Is GECScore (2025.coling-main)

Copied to clipboard

Challenge: Existing methods for detecting LLM-generated text require no training data.
Approach: They propose a black-box zero-shot detection approach that calculates the Grammar Error Correction Score for a given text to differentiate between human-written and LLM-generated texts.
Outcome: The proposed method outperforms current state-of-the-art zero-shot and supervised methods, achieving an average AUROC of 98.62% across XSum and Writing Prompts datasets.
LLM-TOPLA: Efficient LLM Ensemble by Maximising Diversity (2024.findings-emnlp)

Copied to clipboard

Challenge: Extensive evaluation of modern large language models shows performance gain over component LLMs.
Approach: They propose a diversityoptimized LLM ensemble method with three unique properties . they introduce the focal diversity metric to capture diversityperformance correlation .
Outcome: The proposed method outperforms the best-performing ensemble on four benchmarks.
Sparsity and Sentence Structure in Encoder-Decoder Attention of Summarization Systems (2021.emnlp-main)

Copied to clipboard

Challenge: Training and inference using large transformer models can be computationally expensive because the self-attention's time and memory grow quadratically with sequence length.
Approach: They propose a modified transformer architecture that constrains the encoder-decoder attention mechanism to a subset of input sentences while maintaining system performance.
Outcome: The proposed architecture can be trained and inferenced using large transformer models with expensive training and induction costs.
Enriching and Controlling Global Semantics for Text Summarization (2021.emnlp-main)

Copied to clipboard

Challenge: Abstractive summarization models have been proven effective in creating fluent and informative summaries, but they suffer from the short-range dependency problem, causing them to produce summary that miss the key points of document.
Approach: They propose a neural topic model empowered with normalizing flow to capture global semantics of the document and integrate them into the summarization model.
Outcome: The proposed model outperforms state-of-the-art summarization models on five common text summarizing datasets, namely CNN/DailyMail, XSum, Reddit TIFU, arXiv, and PubMed.
Improving Faithfulness by Augmenting Negative Summaries from Fake Documents (2022.emnlp-main)

Copied to clipboard

Challenge: Current abstractive summarization systems tend to hallucinate unfaithful content . however, the most common method does not disentangle factual errors from other errors.
Approach: They propose a back-translation-style approach to augment negative samples that mimic factual errors made by the model.
Outcome: The proposed method improves faithfulness without sacrificing informativeness . it incorporates negative samples into training, and produces faithful/unfaithful summaries .
Model Intrinsic Features of Fine-tuning based Text Summarization Models for Factual Consistency (2023.findings-acl)

Copied to clipboard

Challenge: a summarization model with relatively low factual consistency is more likely to model summaries that are not conditional to the documents.
Approach: They analyze the model intrinsic features by varying the fine-tuning objectives and datasets.
Outcome: The proposed models have a high inductive bias for factual consistency and are more likely to model summaries that are not conditional to the documents.
Paired by the Teacher: Turning Unpaired Data into High-Fidelity Pairs for Low-Resource Text Generation (2025.emnlp-main)

Copied to clipboard

Challenge: a low-resource natural language generation task requires a large number of examples to generate outputs and outputs.
Approach: They propose a teacher-student pipeline that synthesizes accurate input–output pairs without human labels or parallel data.
Outcome: The proposed pipeline synthesizes accurate input–output pairs without human labels or parallel data.
Hallucinations as Orthogonal Noise: Inference-Time Manifold Alignment via Dynamic Contextual Orthogonalization (2026.findings-acl)

Copied to clipboard

Challenge: Hallucinations in Large Language Models persist in critical domains where generated content diverges from contextual facts or logical constraints.
Approach: They propose to generate hallucinations as orthogonal noise relative to the semantic manifold of the residual stream.
Outcome: The proposed method achieves superior contextual faithfulness compared to state-of-the-art methods.

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