Bridging the Gap between Language Model and Reading Comprehension: Unsupervised MRC via Self-Supervision
Not on the map. Why?
Abstract (arXiv)
Despite recent success in machine reading comprehension (MRC), learning high-quality MRC models still requires large-scale labeled training data, even using strong pre-trained language models (PLMs). The pre-training tasks for PLMs are not question-answering or MRC-based tasks, making existing PLMs unable to be directly used for unsupervised MRC. Specifically, MRC aims to spot an accurate answer span from the given document, but PLMs focus on token filling in sentences. In this paper, we propose a new framework for unsupervised MRC. Firstly, we propose to learn to spot answer spans in documents via self-supervised learning, by designing a self-supervision pretext task for MRC - Spotting-MLM. Solving this task requires capturing deep interactions between sentences in documents. Secondly, we apply a simple sentence rewriting strategy in the inference stage to alleviate the expression mismatch between questions and documents. Experiments show that our method achieves a new state-of-the-art performance for unsupervised MRC.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 32 of its 43 references that are in the map. First posted on arXiv 19 Jul 2021.
Builds on
32 of 43 references.
References · 32
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,895
- 2020REALM: Retrieval-Augmented Language Model Pre-Trainingcited by 2,126
- 2015Teaching Machines to Read and Comprehendcited by 1,039
- 2017Reading Wikipedia to Answer Open-Domain Questionscited by 777
- 2020It's Not Just Size That Matters: Small Language Models Are Also Few-Shot Learnerscited by 668
- 2017Adversarial Examples for Evaluating Reading Comprehension Systemscited by 568
- 2016NewsQA: A Machine Comprehension Datasetcited by 330
- 2016Bidirectional Attention Flow for Machine Comprehensioncited by 278
20 more
- 2017Unsupervised Machine Translation Using Monolingual Corpora Onlycited by 272
- 2019MRQA 2019 Shared Task: Evaluating Generalization in Reading Comprehensioncited by 183
- 2016A Thorough Examination of the CNN/Daily Mail Reading Comprehension Taskcited by 71
- 2019Unsupervised Question Answering by Cloze Translationcited by 59
- 2016Machine Comprehension Using Match-LSTM and Answer Pointercited by 47
- 2020What do Models Learn from Question Answering Datasets?cited by 45
- 2020Template-Based Question Generation from Retrieved Sentences for Improved Unsupervised Question Answeringcited by 39
- 2020Unsupervised Multi-hop Question Answering by Question Generationcited by 38
- 2019Leveraging Knowledge Bases in LSTMs for Improving Machine Readingcited by 37
- 2019Span Selection Pre-training for Question Answeringcited by 36
- 2020Learning an Effective Context-Response Matching Model with Self-Supervised Tasks for Retrieval-based Dialoguescited by 34
- 2020Self-supervised Knowledge Triplet Learning for Zero-shot Question Answeringcited by 29
- 2018Simple and Effective Semi-Supervised Question Answeringcited by 22
- 2020Harvesting and Refining Question-Answer Pairs for Unsupervised QAcited by 20
- 2020MultiCQA: Zero-Shot Transfer of Self-Supervised Text Matching Models on a Massive Scalecited by 20
- 2019Self-Supervised Dialogue Learningcited by 16
- 2020Improving Limited Labeled Dialogue State Tracking with Self-Supervisioncited by 16
- 2019Unsupervised Domain Adaptation on Reading Comprehensioncited by 14
- 2020A Simple and Effective Self-Supervised Contrastive Learning Framework for Aspect Detectioncited by 13
- 2019Self-Supervised Learning for Contextualized Extractive Summarizationcited by 12
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1.
3 papers.