mlsanityData to 7 Oct 2026

Robust Domain Adaptation for Machine Reading Comprehension

arXiv 2209.11615 ↗First posted 23 Sep 2022cs.LG cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

Most domain adaptation methods for machine reading comprehension (MRC) use a pre-trained question-answer (QA) construction model to generate pseudo QA pairs for MRC transfer. Such a process will inevitably introduce mismatched pairs (i.e., noisy correspondence) due to i) the unavailable QA pairs in target documents, and ii) the domain shift during applying the QA construction model to the target domain. Undoubtedly, the noisy correspondence will degenerate the performance of MRC, which however is neglected by existing works. To solve such an untouched problem, we propose to construct QA pairs by additionally using the dialogue related to the documents, as well as a new domain adaptation method for MRC. Specifically, we propose Robust Domain Adaptation for Machine Reading Comprehension (RMRC) method which consists of an answer extractor (AE), a question selector (QS), and an MRC model. Specifically, RMRC filters out the irrelevant answers by estimating the correlation to the document via the AE, and extracts the questions by fusing the candidate questions in multiple rounds of dialogue chats via the QS. With the extracted QA pairs, MRC is fine-tuned and provides the feedback to optimize the QS through a novel reinforced self-training method. Thanks to the optimization of the QS, our method will greatly alleviate the noisy correspondence problem caused by the domain shift. To the best of our knowledge, this could be the first study to reveal the influence of noisy correspondence in domain adaptation MRC models and show a feasible way to achieve robustness to mismatched pairs. Extensive experiments on three datasets demonstrate the effectiveness of our method.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 36 references that are in the map. First posted on arXiv 23 Sep 2022.

Builds on

22 of 36 references.

References · 22

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  3. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
  4. 2018CoQA: A Conversational Question Answering Challengecited by 674
  5. 2020Learning from Noisy Labels with Deep Neural Networks: A Surveycited by 580
  6. 2019How does Disagreement Help Generalization against Label Corruption?cited by 390
  7. 2018QuAC : Question Answering in Contextcited by 379
  8. 2019Unsupervised Label Noise Modeling and Loss Correctioncited by 327
  9. 2016Bidirectional Attention Flow for Machine Comprehensioncited by 278
  10. 2017Learning to Ask: Neural Question Generation for Reading Comprehensioncited by 186
  11. 2018QANet: Combining Local Convolution with Global Self-Attention for Reading Comprehensioncited by 164
  12. 2021Understanding and Improving Early Stopping for Learning with Noisy Labelscited by 112
10 more
  1. 2017DuReader: a Chinese Machine Reading Comprehension Dataset from Real-world Applicationscited by 110
  2. 2020Retrospective Reader for Machine Reading Comprehensioncited by 86
  3. 2018A Span-Extraction Dataset for Chinese Machine Reading Comprehensioncited by 84
  4. 2019Unsupervised Question Answering by Cloze Translationcited by 59
  5. 2018DRCD: a Chinese Machine Reading Comprehension Datasetcited by 57
  6. 2019Product-Aware Answer Generation in E-Commerce Question-Answeringcited by 27
  7. 2019Adversarial Domain Adaptation for Machine Reading Comprehensioncited by 21
  8. 2021Meta Navigator: Search for a Good Adaptation Policy for Few-shot Learningcited by 19
  9. 2019Unsupervised Domain Adaptation on Reading Comprehensioncited by 14
  10. 2021Ensemble Learning-Based Approach for Improving Generalization Capability of Machine Reading Comprehension Systemscited by 2

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.