CLDec 17, 2021

Reasoning Chain Based Adversarial Attack for Multi-hop Question Answering

arXiv:2112.09658v14 citations
Originality Incremental advance
AI Analysis

This work addresses the robustness and interpretability issues in multi-hop QA models, which is an incremental improvement over previous adversarial attack methods.

The authors tackled the vulnerability of multi-hop question answering models to adversarial attacks by proposing a reasoning chain-based method that targets specific hops in the inference process, resulting in significant performance reductions on the HotpotQA dataset and improved robustness through adversarial re-training.

Recent years have witnessed impressive advances in challenging multi-hop QA tasks. However, these QA models may fail when faced with some disturbance in the input text and their interpretability for conducting multi-hop reasoning remains uncertain. Previous adversarial attack works usually edit the whole question sentence, which has limited effect on testing the entity-based multi-hop inference ability. In this paper, we propose a multi-hop reasoning chain based adversarial attack method. We formulate the multi-hop reasoning chains starting from the query entity to the answer entity in the constructed graph, which allows us to align the question to each reasoning hop and thus attack any hop. We categorize the questions into different reasoning types and adversarially modify part of the question corresponding to the selected reasoning hop to generate the distracting sentence. We test our adversarial scheme on three QA models on HotpotQA dataset. The results demonstrate significant performance reduction on both answer and supporting facts prediction, verifying the effectiveness of our reasoning chain based attack method for multi-hop reasoning models and the vulnerability of them. Our adversarial re-training further improves the performance and robustness of these models.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes