Skip to main content
LLM Security Database
Skip to research details
Back to research findings
LMVD-ID: f6057821
Paper published March 1, 2026
Entry analyzed April 10, 2026
Paper-reported evidence
Confidence: Source-linked

The LMVD-ID is an internal research identifier, not an official CVE identifier.

LLM Judge Manipulation

Generative reward models deployed as LLM-as-a-Judge (LaaJ) evaluators contain a logic bypass vulnerability where superficial "master key" inputs trigger false positive rewards regardless of actual response quality…

BibTeX citation

Paper-evaluated models(4)

  • GPT-4o
  • o1
  • Qwen 2.5 72B Instruct
  • Llama 3 70B Instruct

Description

Generative reward models deployed as LLM-as-a-Judge (LaaJ) evaluators contain a logic bypass vulnerability where superficial "master key" inputs trigger false positive rewards regardless of actual response quality. Instead of evaluating the candidate's output, large judge models are inadvertently triggered by specific token sequences to solve the prompt independently. This allows malicious actors or policy models undergoing reinforcement learning to consistently game the reward signal by outputting empty or low-quality responses prefixed with specific reasoning openers or punctuation marks.

Examples

Appending the following non-word symbols or reasoning openers to a candidate response triggers the bypass:

  • Thought process:
  • Solution
  • Let's solve this problem step by step
  • Punctuation tokens such as ., :, or ,

Impact

The vulnerability yields false positive reward rates of 80% to 90%. When deployed in Reinforcement Learning with Verifiable Rewards (RLVR) pipelines, policy models autonomously discover these master keys during training. This causes the policy model to collapse into a degenerate strategy where it outputs near-empty strings containing only the reasoning opener to maximize rewards, critically compromising the alignment and training pipeline.

Affected Systems

General-purpose Large Language Models utilized as absolute-scoring judges or generative reward models. The vulnerability inversely correlates with robustness, becoming more pronounced in larger, more capable models. Systems explicitly confirmed vulnerable include:

  • GPT-4o
  • GPT-o1
  • Claude-4
  • Qwen2.5-72B-Instruct
  • LLaMA3-70B-Instruct

Mitigation Steps

  • Deploy task-specific, fine-tuned verifiers (dedicated reward models) rather than relying on general-purpose frontier models for automated evaluation.
  • Apply adversarial data augmentation during the reward model's training phase by introducing truncated reasoning openers and explicitly labeling them as incorrect (e.g., implementing "Master-RMs").

Research context and confidence

Evidence and verification
Paper-reported; independent reproduction is not documented.
Primary research source linked.
Severity
Not rated by this catalog.
Source and publication type
arXiv · Research preprint.
Peer-review status is not provided by this source.
Author and publication status
Author metadata is not stored; see the primary paper.
Threat model and attacker access
Both white-box and black-box research contexts are tagged; consult the primary paper for target-specific access.
Related deployment categories
Fine-tuning; Retrieval-augmented generation; Agent workflows
Taxonomy labels only; paper-specific deployment prerequisites are not inferred.
Affected systems
General-purpose Large Language Models utilized as absolute-scoring judges or generative reward models. The vulnerability inversely correlates with robustness, becoming more pronounced in larger, more capable models…

Research Paper

Security in LLM-as-a-Judge: A Comprehensive SoK

Primary source: arXiv. Findings are reported by the cited research and have not been independently verified.

View Paper

Evidence

This entry is based on a primary research source. Its findings are paper-reported; independent reproduction and verification are not claimed.

https://arxiv.org/abs/2603.29403