A Mutual Information Maximization Approach for the Spurious Solution Problem in Weakly Supervised Question Answering
Not on the map. Why?
Abstract (arXiv)
Weakly supervised question answering usually has only the final answers as supervision signals while the correct solutions to derive the answers are not provided. This setting gives rise to the spurious solution problem: there may exist many spurious solutions that coincidentally derive the correct answer, but training on such solutions can hurt model performance (e.g., producing wrong solutions or answers). For example, for discrete reasoning tasks as on DROP, there may exist many equations to derive a numeric answer, and typically only one of them is correct. Previous learning methods mostly filter out spurious solutions with heuristics or using model confidence, but do not explicitly exploit the semantic correlations between a question and its solution. In this paper, to alleviate the spurious solution problem, we propose to explicitly exploit such semantic correlations by maximizing the mutual information between question-answer pairs and predicted solutions. Extensive experiments on four question answering datasets show that our method significantly outperforms previous learning methods in terms of task performance and is more effective in training models to produce correct solutions.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 30 of its 39 references that are in the map. First posted on arXiv 14 Jun 2021.
Builds on
30 of 39 references.
References · 30
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,893
- 2013Auto-Encoding Variational Bayescited by 4,053
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
- 2018Spider: A Large-Scale Human-Labeled Dataset for Complex and Cross-Domain Semantic Parsing and Text-to-SQL Taskcited by 1,139
- 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 903
- 2019Latent Retrieval for Weakly Supervised Open Domain Question Answeringcited by 695
- 2017Seq2SQL: Generating Structured Queries from Natural Language using Reinforcement Learningcited by 687
- 2017The NarrativeQA Reading Comprehension Challengecited by 597
18 more
- 2015Compositional Semantic Parsing on Semi-Structured Tablescited by 515
- 2020GraPPa: Grammar-Augmented Pre-Training for Table Semantic Parsingcited by 171
- 2017Simple and Effective Multi-Paragraph Reading Comprehensioncited by 120
- 2016Neural Symbolic Machines: Learning Semantic Parsers on Freebase with Weak Supervisioncited by 103
- 2019A Comprehensive Exploration on WikiSQL with Table-Aware Word Contextualizationcited by 88
- 2019A Discrete Hard EM Approach for Weakly Supervised Question Answeringcited by 78
- 2019MultiQA: An Empirical Investigation of Generalization and Transfer in Reading Comprehensioncited by 60
- 2018Memory Augmented Policy Optimization for Program Synthesis and Semantic Parsingcited by 57
- 2017Quasar: Datasets for Question Answering by Search and Readingcited by 50
- 2019Learning to Generalize from Sparse and Underspecified Rewardscited by 39
- 2017Question Answering and Question Generation as Dual Taskscited by 37
- 2020Hybrid Ranking Network for Text-to-SQLcited by 33
- 2019Semantic Parsing with Dual Learningcited by 28
- 2019Learning Semantic Parsers from Denotations with Latent Structured Alignments and Abstract Programscited by 26
- 2018Densely Connected Attention Propagation for Reading Comprehensioncited by 7
- 2019Jointly Learning Semantic Parser and Natural Language Generator via Dual Information Maximizationcited by 6
- 2018Weakly-supervised Neural Semantic Parsing with a Generative Rankercited by 5
- 2017Multi-Mention Learning for Reading Comprehension with Neural Cascadescited by 4
Built on by
Citing papers per year: 2022: 2.
2 papers.