mlsanityData to 7 Oct 2026

Contrastive Error Attribution for Finetuned Language Models

arXiv 2212.10722 ↗First posted 21 Dec 2022cs.CLcited by 12

Not on the map. Why?

Abstract (arXiv)

Recent work has identified noisy and misannotated data as a core cause of hallucinations and unfaithful outputs in Natural Language Generation (NLG) tasks. Consequently, identifying and removing these examples is a key open challenge in creating reliable NLG systems. In this work, we introduce a framework to identify and remove low-quality training instances that lead to undesirable outputs, such as faithfulness errors in text summarization. We show that existing approaches for error tracing, such as gradient-based influence measures, do not perform reliably for detecting faithfulness errors in NLG datasets. We overcome the drawbacks of existing error tracing methods through a new, contrast-based estimate that compares undesired generations to human-corrected outputs. Our proposed method can achieve a mean average precision of 0.93 at detecting known data errors across synthetic tasks with known ground truth, substantially outperforming existing approaches. Using this approach and re-training models on cleaned data leads to a 70% reduction in entity hallucinations on the NYT dataset and a 55% reduction in semantic errors on the E2E dataset.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 26 of its 36 references that are in the map. First posted on arXiv 21 Dec 2022.

Builds on

26 of 36 references.

References · 26

  1. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
  2. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  3. 2018Don't Give Me the Details, Just the Summary! Topic-Aware Convolutional Neural Networks for Extreme Summarizationcited by 1,308
  4. 2020On Faithfulness and Factuality in Abstractive Summarizationcited by 895
  5. 2018The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural Networkscited by 847
  6. 2021BARTScore: Evaluating Generated Text as Text Generationcited by 719
  7. 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 565
  8. 2020FEQA: A Question Answering Evaluation Framework for Faithfulness Assessment in Abstractive Summarizationcited by 292
  9. 2021Understanding Factuality in Abstractive Summarization with FRANK: A Benchmark for Factuality Metricscited by 285
  10. 2021Symbolic Knowledge Distillation: from General Language Models to Commonsense Modelscited by 270
  11. 2017The E2E Dataset: New Challenges For End-to-End Generationcited by 252
  12. 2018Representer Point Selection for Explaining Deep Neural Networkscited by 187
14 more
  1. 2022Datamodels: Predicting Predictions from Training Datacited by 186
  2. 2020Explaining Black Box Predictions and Unveiling Data Artifacts through Influence Functionscited by 144
  3. 2017Faithful to the Original: Fact Aware Neural Abstractive Summarizationcited by 141
  4. 2021Scaling Up Influence Functionscited by 130
  5. 2021Entity-level Factual Consistency of Abstractive Text Summarizationcited by 118
  6. 2019Evaluating the State-of-the-Art of End-to-End Natural Language Generation: The E2E NLG Challengecited by 86
  7. 2020Improved Natural Language Generation via Loss Truncationcited by 75
  8. 2019Data Cleansing for Models Trained with SGDcited by 67
  9. 2019Semantic Noise Matters for Neural Natural Language Generationcited by 64
  10. 2021Improving Factual Consistency of Abstractive Summarization via Question Answeringcited by 55
  11. 2020RelatIF: Identifying Explanatory Training Examples via Relative Influencecited by 28
  12. 2020Explaining and Improving Model Behavior with k Nearest Neighbor Representationscited by 27
  13. 2021SynthBio: A Case Study in Human-AI Collaborative Curation of Text Datasetscited by 18
  14. 2020Mind The Facts: Knowledge-Boosted Coherent Abstractive Text Summarizationcited by 13

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 7; 2025: 4.

12 papers.