Which Shortcut Solution Do Question Answering Models Prefer to Learn?

Kazutoshi Shinoda, Saku Sugawara, Akiko Aizawa

Abstract

Question answering (QA) models often rely on "shortcuts"—spurious correlations—rather than true comprehension. This paper investigates whether models exhibit preferences when multiple shortcuts are available. Through behavioral testing, loss landscape visualization, and information-theoretic analysis, the authors demonstrate that models favor shortcuts with flatter, deeper loss landscapes and lower Minimum Description Length (MDL). These findings provide a quantitative framework for understanding and mitigating dataset bias.

Introduction

Deep learning models are often "lazy learners," exploiting shortcuts like answer position or word matching instead of mastering complex reading comprehension. While the existence of these shortcuts is well-documented, real-world datasets typically contain multiple competing shortcuts. This research addresses the hierarchy of "learnability": which shortcuts do models prefer to learn, and why? Understanding this is critical for developing effective debiasing strategies, as current methods often treat all biases as equal, which might leave the most "tempting" shortcuts untouched.

Methodology

The researchers employed three primary strategies to analyze BERT and RoBERTa models:

  1. Behavioral Tests: Specialized "biased training sets" were constructed where every example was solvable by three distinct shortcuts simultaneously. Models were then evaluated on "unbiased" test sets where only one specific shortcut was applicable to determine which one the model actually prioritized.
  2. Loss Landscape Visualization: The loss surface in the model's parameter space was mapped to identify geometric features, such as flatness and depth, associated with preferred shortcuts.
  3. Rissanen Shortcut Analysis (RSA): Using the concept of Minimum Description Length (MDL), the authors quantified the "effort" (in bits) required to learn a shortcut. Lower MDL indicates a shortcut is easier for the model to internalize.
Experimental setup for determining shortcut preference using biased training and unbiased test sets.

Key Insights

  • The Hierarchy of Laziness: In extractive QA, models overwhelmingly prefer the Answer-Position shortcut (e.g., looking at the first sentence) over word-matching or entity-type matching. In multiple-choice QA, Word-label Correlations eventually become the preferred shortcut over simple lexical overlap.
  • Geometric Preference: Preferred shortcuts inhabit flatter and deeper regions of the loss landscape. In deep learning, flatter minima are generally easier for optimizers to locate and maintain, explaining the model's gravitation toward them.
  • Information-Theoretic Predictability: There is a strong correlation between a shortcut’s MDL and its preference. Shortcuts that allow for a "shorter description" of the data are learned first.
  • Non-Uniform Mitigation: The amount of "anti-shortcut" data (examples where the shortcut fails) required to debias a model depends on the shortcut's learnability. Highly learnable shortcuts require significantly more counter-examples to "unlearn."

Results

On SQuAD 1.1, the Answer-Position shortcut remained dominant throughout the entire training process, with F1 scores significantly higher than those for word or type matching. Quantitative analysis via MDL confirmed this: the Position shortcut scored 4.65 kbits for BERT, compared to 5.75 kbits for Type matching. This gap demonstrates that the Position shortcut is computationally "cheaper" to learn. Furthermore, the study found that simply adding a small number of hard examples is insufficient for highly learnable shortcuts; they require a much higher proportion of clean data to achieve balanced performance.

Limitations and Future Work

The study is limited to shortcuts already identified in existing literature; latent shortcuts may exist that are even more preferred. Additionally, while BERT and RoBERTa were tested, newer architectures like T5 or GPT-4 might exhibit different inductive biases. Future research could leverage the MDL-based learnability metric to automatically identify prone areas in datasets, streamlining the creation of robust training sets without manual trial-and-error.

Summary updated

Abstract

Question answering (QA) models for reading comprehension tend to learn shortcut solutions rather than the solutions intended by QA datasets. QA models that have learned shortcut solutions can achieve human-level performance in shortcut examples where shortcuts are valid, but these same behaviors degrade generalization potential on anti-shortcut examples where shortcuts are invalid. Various methods have been proposed to mitigate this problem, but they do not fully take the characteristics of shortcuts themselves into account. We assume that the learnability of shortcuts, i.e., how easy it is to learn a shortcut, is useful to mitigate the problem. Thus, we first examine the learnability of the representative shortcuts on extractive and multiple-choice QA datasets. Behavioral tests using biased training sets reveal that shortcuts that exploit answer positions and word-label correlations are preferentially learned for extractive and multiple-choice QA, respectively. We find that the more learnable a shortcut is, the flatter and deeper the loss landscape is around the shortcut solution in the parameter space. We also find that the availability of the preferred shortcuts tends to make the task easier to perform from an information-theoretic viewpoint. Lastly, we experimentally show that the learnability of shortcuts can be utilized to construct an effective QA training set; the more learnable a shortcut is, the smaller the proportion of anti-shortcut examples required to achieve comparable performance on shortcut and anti-shortcut examples. We claim that the learnability of shortcuts should be considered when designing mitigation methods.
BibTeX
@inproceedings{shinoda2023which,
  author = {Kazutoshi Shinoda and Saku Sugawara and Akiko Aizawa},
  title = {{Which Shortcut Solution Do Question Answering Models Prefer to Learn?}},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year = {2023},
  doi = {10.1609/aaai.v37i11.26590},
}
Figure