Model Agnostic Answer Reranking System for Adversarial Question Answering
Not on the map. Why?
Abstract (arXiv)
While numerous methods have been proposed as defenses against adversarial examples in question answering (QA), these techniques are often model specific, require retraining of the model, and give only marginal improvements in performance over vanilla models. In this work, we present a simple model-agnostic approach to this problem that can be applied directly to any QA model without any retraining. Our method employs an explicit answer candidate reranking mechanism that scores candidate answers on the basis of their content overlap with the question before making the final prediction. Combined with a strong base QAmodel, our method outperforms state-of-the-art defense techniques, calling into question how well these techniques are actually doing and strong these adversarial testbeds are.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 31 of its 44 references that are in the map. First posted on arXiv 5 Feb 2021.
Builds on
31 of 44 references.
References · 31
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 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
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
- 2015Teaching Machines to Read and Comprehendcited by 1,039
- 2017Reading Wikipedia to Answer Open-Domain Questionscited by 777
- 2019Universal Adversarial Triggers for Attacking and Analyzing NLPcited by 709
- 2017Adversarial Examples for Evaluating Reading Comprehension Systemscited by 568
- 2020UnifiedQA: Crossing Format Boundaries With a Single QA Systemcited by 475
- 2018AllenNLP: A Deep Semantic Natural Language Processing Platformcited by 347
- 2015Towards AI-Complete Question Answering: A Set of Prerequisite Toy Taskscited by 309
19 more
- 2016Bidirectional Attention Flow for Machine Comprehensioncited by 278
- 2017Constructing Datasets for Multi-hop Reading Comprehension Across Documentscited by 190
- 2019End-to-End Open-Domain Question Answering with BERTserinicited by 152
- 2018How Much Reading Does Reading Comprehension Require? A Critical Investigation of Popular Benchmarkscited by 86
- 2016A Thorough Examination of the CNN/Daily Mail Reading Comprehension Taskcited by 71
- 2018Did the Model Understand the Question?cited by 60
- 2019MultiQA: An Empirical Investigation of Generalization and Transfer in Reading Comprehensioncited by 60
- 2018Question Answering by Reasoning Across Documents with Graph Convolutional Networkscited by 56
- 2019Understanding Dataset Design Choices for Multi-hop Reasoningcited by 50
- 2018Robust Machine Comprehension Models via Adversarial Trainingcited by 44
- 2017Evidence Aggregation for Answer Re-Ranking in Open-Domain Question Answeringcited by 24
- 2018Ranking Paragraphs for Improving Answer Recall in Open-Domain Question Answeringcited by 24
- 2020Evaluating Models' Local Decision Boundaries via Contrast Setscited by 24
- 2019Domain-agnostic Question-Answering with Adversarial Trainingcited by 22
- 2019RankQA: Neural Question Answering with Answer Re-Rankingcited by 15
- 2019QAInfomax: Learning Robust Question Answering System by Mutual Information Maximizationcited by 9
- 2020Undersensitivity in Neural Reading Comprehensioncited by 9
- 2019Robust Reading Comprehension with Linguistic Constraints via Posterior Regularizationcited by 8
- 2019Improving Machine Reading Comprehension via Adversarial Trainingcited by 7
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 1.
2 papers.
- 2024Human-inspired Episodic Memory for Infinite Context LLMs12 Jul 2024
- 2021Practical Benefits of Feature Feedback Under Distribution Shift14 Oct 2021