mlsanityData to 7 Oct 2026

Summarize-then-Answer: Generating Concise Explanations for Multi-hop Reading Comprehension

arXiv 2109.06853 ↗First posted 14 Sep 2021cs.CLcited by 10

Not on the map. Why?

Abstract (arXiv)

How can we generate concise explanations for multi-hop Reading Comprehension (RC)? The current strategies of identifying supporting sentences can be seen as an extractive question-focused summarization of the input text. However, these extractive explanations are not necessarily concise i.e. not minimally sufficient for answering a question. Instead, we advocate for an abstractive approach, where we propose to generate a question-focused, abstractive summary of input paragraphs and then feed it to an RC system. Given a limited amount of human-annotated abstractive explanations, we train the abstractive explainer in a semi-supervised manner, where we start from the supervised model and then train it further through trial and error maximizing a conciseness-promoted reward function. Our experiments demonstrate that the proposed abstractive explainer can generate more compact explanations than an extractive explainer with limited supervision (only 2k instances) while maintaining sufficiency.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 29 of its 38 references that are in the map. First posted on arXiv 14 Sep 2021.

Builds on

29 of 38 references.

References · 29

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  2. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  3. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
  4. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
  5. 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,686
  6. 2020REALM: Retrieval-Augmented Language Model Pre-Trainingcited by 2,126
  7. 2018Neural Network Acceptability Judgmentscited by 952
  8. 2020Towards Faithfully Interpretable NLP Systems: How should we define and evaluate faithfulness?cited by 590
  9. 2016Self-critical Sequence Training for Image Captioningcited by 544
  10. 2019ERASER: A Benchmark to Evaluate Rationalized NLP Modelscited by 523
  11. 2020UnifiedQA: Crossing Format Boundaries With a Single QA Systemcited by 475
  12. 2018e-SNLI: Natural Language Inference with Natural Language Explanationscited by 468
17 more
  1. 2019Explain Yourself! Leveraging Language Models for Commonsense Reasoningcited by 367
  2. 2020Re-evaluating Evaluation in Text Summarizationcited by 144
  3. 2021Teach Me to Explain: A Review of Datasets for Explainable Natural Language Processingcited by 126
  4. 2020NILE : Natural Language Inference with Faithful Natural Language Explanationscited by 96
  5. 2020Pre-trained Summarization Distillationcited by 70
  6. 2020An Information Bottleneck Approach for Controlling Conciseness in Rationale Extractioncited by 69
  7. 2018WorldTree: A Corpus of Explanation Graphs for Elementary Science Questions supporting Multi-Hop Inferencecited by 60
  8. 2019Select, Answer and Explain: Interpretable Multi-hop Reading Comprehension over Multiple Documentscited by 57
  9. 2017Diversity driven Attention Model for Query-based Abstractive Summarizationcited by 42
  10. 2019R4C: A Benchmark for Evaluating RC Systems to Get the Right Answer for the Right Reasoncited by 36
  11. 2020Explaining Question Answering Models through Text Generationcited by 33
  12. 2020A Survey on Explainability in Machine Reading Comprehensioncited by 33
  13. 2020A Simple Yet Strong Pipeline for HotpotQAcited by 24
  14. 2020Unsupervised Alignment-based Iterative Evidence Retrieval for Multi-hop Question Answeringcited by 24
  15. 2021Data Augmentation for Abstractive Query-Focused Multi-Document Summarizationcited by 18
  16. 2020Why do you think that? Exploring Faithful Sentence-Level Rationales Without Supervisioncited by 15
  17. 2020Dense-Caption Matching and Frame-Selection Gating for Temporal Localization in VideoQAcited by 13

Built on by

Cited by year

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

10 papers.