Pointing out the Shortcomings of Relation Extraction Models with Semantically Motivated Adversarials
Not on the map. Why?
Abstract (arXiv)
In recent years, large language models have achieved state-of-the-art performance across various NLP tasks. However, investigations have shown that these models tend to rely on shortcut features, leading to inaccurate predictions and causing the models to be unreliable at generalization to out-of-distribution (OOD) samples. For instance, in the context of relation extraction (RE), we would expect a model to identify the same relation independently of the entities involved in it. For example, consider the sentence "Leonardo da Vinci painted the Mona Lisa" expressing the created(Leonardo_da_Vinci, Mona_Lisa) relation. If we substiute "Leonardo da Vinci" with "Barack Obama", then the sentence still expresses the created relation. A robust model is supposed to detect the same relation in both cases. In this work, we describe several semantically-motivated strategies to generate adversarial examples by replacing entity mentions and investigate how state-of-the-art RE models perform under pressure. Our analyses show that the performance of these models significantly deteriorates on the modified datasets (avg. of -48.5% in F1), which indicates that these models rely to a great extent on shortcuts, such as surface forms (or patterns therein) of entities, without making full use of the information present in the sentences.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 33 of its 44 references that are in the map. First posted on arXiv 29 Feb 2024.
Builds on
33 of 44 references.
References · 33
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2013Intriguing properties of neural networkscited by 5,114
- 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,222
- 2019Language Models as Knowledge Bases?cited by 1,922
- 2019Right for the Wrong Reasons: Diagnosing Syntactic Heuristics in Natural Language Inferencecited by 864
- 2019SpanBERT: Improving Pre-training by Representing and Predicting Spanscited by 832
- 2019Universal Adversarial Triggers for Attacking and Analyzing NLPcited by 709
- 2020A Survey on Knowledge Graphs: Representation, Acquisition and Applicationscited by 643
- 2017Adversarial Examples for Evaluating Reading Comprehension Systemscited by 568
- 2020How Can We Know When Language Models Know? On the Calibration of Language Models for Question Answeringcited by 439
- 2020LUKE: Deep Contextualized Entity Representations with Entity-aware Self-attentioncited by 326
- 2017Synthetic and Natural Noise Both Break Neural Machine Translationcited by 304
21 more
- 2019Matching the Blanks: Distributional Similarity for Relation Learningcited by 271
- 2016Understanding Neural Networks through Representation Erasurecited by 223
- 2021Masked Language Modeling and the Distributional Hypothesis: Order Word Matters Pre-training for Littlecited by 176
- 2019Towards Debiasing Fact Verification Modelscited by 143
- 2020The Language Interpretability Tool: Extensible, Interactive Visualizations and Analysis for NLP Modelscited by 125
- 2019Robust Neural Machine Translation with Doubly Adversarial Inputscited by 105
- 2016Crafting Adversarial Input Sequences for Recurrent Neural Networkscited by 102
- 2017Deceiving Google's Perspective API Built for Detecting Toxic Commentscited by 99
- 2018How Much Reading Does Reading Comprehension Require? A Critical Investigation of Popular Benchmarkscited by 86
- 2019Enriching Pre-trained Language Model with Entity Information for Relation Classificationcited by 82
- 2021An Improved Baseline for Sentence-level Relation Extractioncited by 80
- 2021Towards Interpreting and Mitigating Shortcut Learning Behavior of NLU Modelscited by 78
- 2022Summarization as Indirect Supervision for Relation Extractioncited by 31
- 2021Bridge the Gap Between CV and NLP! A Gradient-based Textual Adversarial Attack Frameworkcited by 27
- 2020Searching for a Search Method: Benchmarking Search Algorithms for Generating NLP Adversarial Examplescited by 23
- 2022A Survey of Adversarial Defences and Robustness in NLPcited by 22
- 2020Exposing Shallow Heuristics of Relation Extraction Models with Challenge Datacited by 20
- 2022Unified Semantic Typing with Meaningful Label Inferencecited by 18
- 2021Ask2Transformers: Zero-Shot Domain labelling with Pre-trained Language Modelscited by 13
- 2020On Robustness and Bias Analysis of BERT-based Relation Extractioncited by 10
- 2023Step by Step Loss Goes Very Far: Multi-Step Quantization for Adversarial Text Attackscited by 3
Built on by
Citing papers per year: 2025: 1.
1 paper.