Gaming the Answer Matcher: Examining the Impact of Text Manipulation on Automated Judgment
Manas Khatore, Sumana Sridharan, Kevork Sulahian, Benjamin J. Smith, Shi Feng
TL;DR
This study assesses the robustness of automated answer matching as a scalable evaluation method against inexpensive text-manipulation attacks. Using four matcher models and two examinee models across MMLU-Pro and GPQA Diamond datasets, it compares binary and continuous scoring under three manipulation strategies (verbosity, forward embedding, strategic multi-answer). The results show that these attacks rarely inflate scores; baseline prompts often outperform adversarial prompts, and binary judgments tend to be more robust than continuous scoring, though certain model-specific anomalies occur. The work supports answer matching as a viable pre-deployment validation tool when reference answers are available, and points to future work on stronger adversaries and defense mechanisms to further improve robustness across architectures and languages.
Abstract
Automated answer matching, which leverages LLMs to evaluate free-text responses by comparing them to a reference answer, shows substantial promise as a scalable and aligned alternative to human evaluation. However, its reliability requires robustness against strategic attacks such as guesswork or verbosity that may artificially inflate scores without improving actual correctness. In this work, we systematically investigate whether such tactics deceive answer matching models by prompting examinee models to: (1) generate verbose responses, (2) provide multiple answers when unconfident, and (3) embed conflicting answers with the correct answer near the start of their response. Our results show that these manipulations do not increase scores and often reduce them. Additionally, binary scoring (which requires a matcher to answer with a definitive "correct" or "incorrect") is more robust to attacks than continuous scoring (which requires a matcher to determine partial correctness). These findings show that answer matching is generally robust to inexpensive text manipulation and is a viable alternative to traditional LLM-as-a-judge or human evaluation when reference answers are available.
