Robust Domain Adaptation for Machine Reading Comprehension
Liang Jiang, Zhenyu Huang, Jia Liu, Zujie Wen, Xi Peng
Abstract
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 solution to achieve the robustness against the mismatched pairs. Extensive experiments on three datasets demonstrate the effectiveness of our method.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers2
- Unlearning the Noisy Correspondence Makes CLIP More RobustHaochen Han, Alex Jinpeng Wang, Peijun Ye, Fangming LiuICCV 2025 · 3 citations
- Bootstrapping Multi-view Learning for Test-time Noisy CorrespondenceChanghao He, Di Xue, Shuxian Li, Yanji Hao et al.CVPR 2026
Builds on7
- Robust early-learning: Hindering the memorization of noisy labelsXiaobo Xia, Tongliang Liu, Bo Han, Chen Gong et al.ICLR 2021 · 322 citations
- Understanding and Improving Early Stopping for Learning with Noisy LabelsYingbin Bai, Erkun Yang, Bo Han, Yanhua Yang et al.NeurIPS 2021 · 307 citations
- Retrospective Reader for Machine Reading ComprehensionZhuosheng Zhang, Junjie Yang, Hai ZhaoAAAI 2021 · 237 citations
- Learning with Noisy Correspondence for Cross-modal MatchingZhenyu Huang, Guocheng Niu, Xiao Liu, Wenbiao Ding et al.NeurIPS 2021 · 215 citations
- Meta Navigator: Search for a Good Adaptation Policy for Few-shot LearningChi Zhang, Henghui Ding, Guosheng Lin, Ruibo Li et al.ICCV 2021 · 51 citations
Related papers
- Multi-Task Learning with Generative Adversarial Training for Multi-Passage Machine Reading ComprehensionQiyu Ren, Xiang Cheng, Sen SuAAAI 2020 · 15 citations
- A Self-Training Method for Machine Reading Comprehension with Soft Evidence ExtractionYilin Niu, Fangkai Jiao, Mantong Zhou, Ting Yao et al.ACL 2020 · 33 citations
- Recurrent Chunking Mechanisms for Long-Text Machine Reading ComprehensionHongyu Gong, Yelong Shen, Dian Yu, Jianshu Chen et al.ACL 2020 · 39 citations
- A Robust Adversarial Training Approach to Machine Reading ComprehensionKai Liu, Xin Liu, An Yang, Jing Liu et al.AAAI 2020 · 54 citations
- Multi-source Meta Transfer for Low Resource Multiple-Choice Question AnsweringMing Yan, Hao Zhang, Di Jin, Joey Tianyi ZhouACL 2020 · 21 citations
