Papers with DailyMail
Binary and Ternary Natural Language Generation (2023.acl-long)
Copied to clipboard
| Challenge: | ternary and binary neural networks have proven difficult to optimize since both parameter and output space are discretized . authors demonstrate ternaries and binary models on downstream tasks of summarization and machine translation . |
| Approach: | They propose to use ternary and binary neural networks to optimize for multiplication-free computation . they propose to apply statistics-based quantization for the weights and elastic quantization of the activations to the transformer text generation model. |
| Outcome: | The proposed model outperforms the best existing models on machine translation tasks. |
Transformer-based Model for Single Documents Neural Summarization (D19-56)
Copied to clipboard
| Challenge: | Existing approaches for document summarization use manual feature engineering, integer linear programming and data-driven approaches. |
| Approach: | They propose a framework that encodes the source text first with a transformer, then a sequence-to-sequence model. |
| Outcome: | The proposed framework improves performance on extractive and abstractive document summarization task using the CNN/DailyMail and Newsroom datasets. |
Multiplex Graph Neural Network for Extractive Text Summarization (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for extractive text summarization do not consider multiple types of inter-sentential relationships, nor model intra-sententential relationships. |
| Approach: | They propose a novel method to combine different types of relationships among sentences and words to model sentence embedding. |
| Outcome: | The proposed model is compared with existing methods on CNN/DailyMail benchmark dataset to demonstrate its effectiveness. |
Source Identification in Abstractive Summarization (2024.eacl-short)
Copied to clipboard
| Challenge: | Existing studies define input sentences that contain essential information in the generated summary as source sentences. |
| Approach: | They define input sentences that contain essential information in the generated summary as source sentences and analyze the source sentences to determine how abstractive summaries are made. |
| Outcome: | The proposed method performs well in abstractive settings, while similarity-based methods perform robustly in extractive settings. |
AREDSUM: Adaptive Redundancy-Aware Iterative Sentence Ranking for Extractive Document Summarization (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing studies on redundancy are focused on salience alone. |
| Approach: | They propose to combine salience and novelty to score redundancy in extractive summarization systems . they also propose to balance saliance and redundancies by scoring redundants first . |
| Outcome: | Empirical results show that AREDSUM-CTX scores salience first, then learns to balance saliency and redundancy. |
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. |
Balancing Lexical and Semantic Quality in Abstractive Summarization (2023.acl-short)
Copied to clipboard
| Challenge: | Existing methods to reduce exposure bias in sequence-to-sequence models are underexplored. |
| Approach: | They propose a method to re-rank sequence-to-sequence neural models to reduce exposure bias. |
| Outcome: | The proposed method achieves an 89.67 BERTScore on the CNN/DailyMail and XSum datasets. |
Soft Layer-Specific Multi-Task Summarization with Entailment and Question Generation (P18-1)
Copied to clipboard
| Challenge: | Recent advances on abstractive summarization have allowed substantial improvements in the quality of the model, but there is still scope for improvement. |
| Approach: | They propose novel multi-task architectures with high-level layer-specific sharing across multiple encoder and decoder layers of the three tasks and soft-sharing mechanisms. |
| Outcome: | The proposed model improves on the CNN/DailyMail and Gigaword datasets and on the DUC-2002 transfer setup. |
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
Shashi Narayan, Gonçalo Simões, Yao Zhao, Joshua Maynez, Dipanjan Das, Michael Collins, Mirella Lapata
| 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. |
Searching for Effective Neural Extractive Summarization: What Works and What’s Next (P19-1)
Copied to clipboard
| Challenge: | Recent years have seen success in the use of deep neural networks on text summarization, but there is no clear understanding of why they perform so well or how they might be improved. |
| Approach: | They propose to use different types of model architectures to improve extractive summarization systems. |
| Outcome: | The proposed framework achieves state-of-the-art on CNN/DailyMail by a large margin based on observations and analysis. |
HiStruct+: Improving Extractive Text Summarization with Hierarchical Structure Information (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing models that treat texts as linear sequences do not include hierarchical structure information. |
| Approach: | They propose to inject hierarchical structure information into an extractive summarization model by combining hierarchically structured text with a pre-trained Transformer language model. |
| Outcome: | The proposed model outperforms a baseline model on PubMed and arXiv datasets and the hierarchical structure information is not injected. |
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. |
Unsupervised Extractive Summarization by Pre-training Hierarchical Transformers (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for document summarization use graphs and unlabeled documents . Existing models require labeled data, and it is expensive to create summarized documents. |
| Approach: | They propose to rank sentences using transformer attentions and pre-training objectives by unlabeled documents. |
| Outcome: | The proposed model achieves state-of-the-art on unsupervised summarization and is less dependent on sentence positions. |
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. |
ProphetNet: Predicting Future N-gram for Sequence-to-SequencePre-training (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing sequence-to-sequence models are optimized for future n-gram prediction and n stream self-attention mechanism. |
| Approach: | They propose a self-supervised objective called future n-gram prediction and the proposed n stream self-attention mechanism to optimize the model for sequence-to-sequence learning. |
| Outcome: | The proposed model achieves state-of-the-art on CNN/DailyMail, Gigaword, and SQuAD 1.1 benchmarks compared to the models using the same scale pre-training corpus. |
Pre-training for Abstractive Document Summarization by Reinstating Source Text (2020.emnlp-main)
Copied to clipboard
| Challenge: | Abstractive document summarization models are often trained on limited supervised data . authors present three objectives for pretraining abstractive summarizing models . |
| Approach: | They propose to pre-train a SEQ2SEQ based abstractive summarization model on unlabeled text. |
| Outcome: | The proposed method improves on two benchmark summarization datasets with 19GB of text . the goal is sentence reordering, next sentence generation and masked document generation . |
Learn to Copy from the Copying History: Correlational Copy Network for Abstractive Summarization (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for abstractive summarization use encoder-decoder attention, but this leads to incomplete copying. |
| Approach: | They propose a copying scheme that takes advantage of prior copying distributions and explicitly encourages the model to copy the input word that is relevant to the previously copied one. |
| Outcome: | The proposed scheme achieves state-of-the-art on summarization benchmarks . it takes advantage of prior copying distributions and explicitly encourages copying . |
Stepwise Extractive Summarization and Planning with Structured Transformers (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to extractive summarization use transformers to learn the structure of long inputs. |
| Approach: | They propose encoder-centric stepwise models for extractive summarization using structured transformers – HiBERT and Extended Transformers . |
| Outcome: | The proposed models outperform previous models on CNN/DailyMail extractive summarization and Rotowire table-to-text generation. |
Discrete Diffusion Language Model for Efficient Text Summarization (2025.findings-naacl)
Copied to clipboard
| Challenge: | Existing discrete diffusion models fail on conditional long-text generation due to incompatibility between the backbone architectures and the random noising process. |
| Approach: | They propose a semantic-aware noising process that enables Transformer backbones to handle long sequences effectively. |
| Outcome: | The proposed model outperforms existing models on three benchmark summarization datasets while achieving much faster inference speed compared to autoregressive models. |
Jointly Extracting and Compressing Documents with Summary State Representations (N19-1)
Copied to clipboard
| Challenge: | Text summarization is an important NLP problem with a wide range of applications in data-driven industries. |
| Approach: | They propose a neural model that extracts sentences from a document and compresses them. |
| Outcome: | The proposed model generates concise and informa-tive summaries on CNN/DailyMail and Newsroom datasets and human evaluations show it outperforms existing methods. |
Pre-trained language model representations for language generation (N19-1)
Copied to clipboard
| Challenge: | Pre-trained language model representations have been successful in a wide range of language understanding tasks. |
| Approach: | They propose to use pre-trained language model representations to integrate them into sequence to sequence models and apply it to machine translation and abstractive summarization. |
| Outcome: | The proposed model is able to perform 5.3 BLEU in machine translation and 5.3 on the full text version of CNN/DailyMail. |
Inverse Reinforcement Learning for Text Summarization (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies show that inverse reinforcement learning (RL) training has certain disadvantages such as object mismatch and exposure bias. |
| Approach: | They propose inverse reinforcement learning (IRL) as an effective paradigm for training abstractive summarization models. |
| Outcome: | The proposed model outperforms MLE and RL baselines on ROUGE, coverage, novelty, compression ratio, factuality, and human evaluations. |
Iterative Document Representation Learning Towards Summarization with Polishing (D18-1)
Copied to clipboard
| Challenge: | Existing summarization methods read through document only once to generate a document representation, resulting in a sub-optimal representation. |
| Approach: | They propose an iterative model for supervised extractive text summarization which polishes the document representation on many passes through the document. |
| Outcome: | The proposed model outperforms state-of-the-art extractive systems on CNN/DailyMail and DUC2002 datasets. |
Asking and Answering Questions to Evaluate the Factual Consistency of Summaries (2020.acl-main)
Copied to clipboard
| Challenge: | Existing automatic evaluation metrics for summarization are insensitive to factual inconsistencies. |
| Approach: | They propose an automatic evaluation protocol that detects factual inconsistencies in a model-generated summary. |
| Outcome: | QAGS has higher correlations with human judgments of factual consistency than other evaluation metrics. |
Element-aware Summarization with Large Language Models: Expert-aligned Evaluation and Chain-of-Thought Method (2023.acl-long)
Copied to clipboard
| Challenge: | Experimental results show that automatic summarization generates concise summaries that contain key ideas of source documents. |
| Approach: | They propose to use Element-aware test sets to annotate news-related reference summaries to focus on more fine-grained news elements objectively and comprehensively. |
| Outcome: | The proposed method outperforms state-of-the-art fine-tuned PLMs and zero-shot LLMs by +4.33/+4.77 on the two datasets, respectively. |
AlignSum: Data Pyramid Hierarchical Fine-tuning for Aligning with Human Summarization Preference (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Text summarization tasks employ Pre-trained Language Models (PLMs) to fit diverse datasets. |
| Approach: | They propose a human summarization preference alignment framework to align PLMs with human preferences. |
| Outcome: | The proposed framework narrows the gap between automatic and human evaluations by integrating three components. |
CoLo: A Contrastive Learning Based Re-ranking Framework for One-Stage Summarization (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for extractive and abstractive summarization use token-level or sentence-level training objectives. |
| Approach: | They propose a Contrastive Learning based re-ranking framework for one-stage summarization called CoLo. |
| Outcome: | The proposed framework boosts extractive and abstractive results on CNN/DailyMail benchmarks while maintaining inference efficiency. |
Data Selection Curriculum for Abstractive Text Summarization (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Abstractive Text Summarization (ATS) models are commonly trained using large-scale data that is randomly shuffled. |
| Approach: | They propose a data selection curriculum scoring system that measures the learning difficulty of an ATS model and expected performance on an instance. |
| Outcome: | The proposed system surpasses baselines on CNN/DailyMail dataset, utilizing 20% of available instances. |
Extractive Summarization as Text Matching (2020.acl-main)
Copied to clipboard
| Challenge: | Currently, most of the neural extractive summarization systems score and extract sentences individually and model the relationship between sentences. |
| Approach: | They propose to instantiate a neural extractive summarization task as a semantic text matching problem and use it to match a source document and candidate summaries in a semantic space. |
| Outcome: | The proposed framework is faster and more efficient than existing frameworks. |
PSP: Pre-trained Soft Prompts for Few-Shot Abstractive Summarization (2022.coling-1)
Copied to clipboard
| Challenge: | Experimental results show that our method outperforms full-model tuning in few-shot abstractive summarization tasks. |
| Approach: | They propose a soft prompts architecture with prompt pre-training and prompt fine-tuning paradigm to support few-shot abstractive summarization. |
| Outcome: | The proposed model outperforms Prompt Tuning and Profix-Tuning on CNN/DailyMail and XSum datasets and outperfies Profix Tuning by a large margin. |
Text or Pixels? Evaluating Efficiency and Understanding of LLMs with Visual Text Inputs (2025.findings-emnlp)
Copied to clipboard
| Challenge: | *visual text representations* are a practical and surprisingly effective form of input compression for decoder LLMs. |
| Approach: | They exploit visual representations to render long text inputs as a single image and provide it directly to the model. |
| Outcome: | The proposed method reduces token usage while preserving performance. |
Fourier Transformer: Fast Long Range Modeling by Removing Sequence Redundancy with FFT Operator (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing transformer models are computationally demanding and prohibitively costly for long sequences due to the quadratic complexity of its selfattention module. |
| Approach: | They propose a transformer-based model that inherits weights from large pretrained models by removing redundancies in hidden sequences using the ready-made Fast Fourier Transform operator. |
| Outcome: | The proposed model outperforms the standard BART model on the long-range modeling benchmark LRA with significant improvements in speed and space. |
PALM: Pre-training an Autoencoding&Autoregressive Language Model for Context-conditioned Generation (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing techniques for natural language understanding and generation use autoencoding and/or autoregressive objectives to train models. |
| Approach: | They propose a self-supervised pre-training scheme that pre-trains an autoencoding and autoregressive language model on a large unlabeled corpus for generating new text conditioned on context. |
| Outcome: | The proposed scheme achieves state-of-the-art results on a variety of language generation benchmarks covering generative question answering, abstractive summarization and conversational response generation. |
BUMP: A Benchmark of Unfaithful Minimal Pairs for Meta-Evaluation of Faithfulness Metrics (2023.acl-long)
Copied to clipboard
Liang Ma, Shuyang Cao, Robert L Logan IV, Di Lu, Shihao Ran, Ke Zhang, Joel Tetreault, Alejandro Jaimes
| Challenge: | Existing benchmarks measure the correlation with human judgements of faithfulness on model-generated summaries, but they are insufficient for diagnosing whether metrics are consistent, effective on human-written texts, and sensitive to different error types. |
| Approach: | They propose to use unfaithful minimal pairs to measure the consistency of automatic faithfulness metrics by comparing human-written summary pairs with a dataset of 889 human-writing, minimally different summary pairs. |
| Outcome: | The proposed benchmarks show that the most discriminative metrics tend not to be the most consistent, and that the best performing metrics are sensitive to errors. |
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. |
Efficient Beam Search for Large Language Models Using Trie-Based Decoding (2025.emnlp-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) face memorybound performance bottlenecks due to their high memory requirements. |
| Approach: | They propose a trie-based parallel decoding method that shares a single KV cache across beams with common prefixes to dramatically reduce memory usage and enables efficient decoding. |
| Outcome: | The proposed method significantly reduces memory usage and enables efficient decoding without compromising generation quality. |
Abstractive Document Summarization without Parallel Data (2020.lrec-1)
Copied to clipboard
| Challenge: | Abstractive summarization typically relies on large collections of paired articles and summaries. |
| Approach: | They propose a system that relies only on example summaries and non-matching articles . they use an unsupervised sentence extractor that selects salient sentences . |
| Outcome: | The proposed system performs well on CNN/DailyMail benchmark and automatic generating a press release from a scientific journal article. |
DiffuSum: Generation Enhanced Extractive Summarization with Diffusion (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for extractive summarization are formulated as a sequence labeling problem by making individual sentence label predictions. |
| Approach: | They propose a novel paradigm for extractive summarization by directly generating summary sentences with diffusion models and extracting sentences based on sentence representation matching. |
| Outcome: | The proposed framework achieves state-of-the-art extractive results on CNN/DailyMail with ROUGE scores of 44.83/22.56/40.56. |
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. |
FractalLLM: Lossless Self-Speculative Decoding with Layer Embedded Self-Compression (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Autoregressive decoding requires a full forward pass for each generated token, increasing inference latency. |
| Approach: | They propose a lossless self-speculative decoding method that embeds a compressed model within selected decoder layers of the original model. |
| Outcome: | The proposed method achieves substantial speed-ups (up to 2.47) over standard autoregressive decoding. |