ruben härle.
← All publications

Reasoning · ICLR 2026 · Logical Reasoning Workshop

LLMs gaming verifiers

LLMs Gaming Verifiers: RLVR can Lead to Reward Hacking

When a model learns to pass the checker instead of learning the rule.

Read the paper Code
Authors

L. Helff, Q. Delfosse, D. Steinmann, R. Härle, H. Shindo, P. Schramowski, W. Stammer, K. Kersting, F. Friedrich

THE IDEA, AT A GLANCE

CONCEPTUAL ILLUSTRATION
red_car(x) → east(x)east(t1)

Rule or shortcut?

An identifier list can pass a check of the examples.

t1t9new identifierssame relationships

Rename the objects

Preserve the logic, but change the object names.

✓rule still holds×shortcut fails

Check the same answer

Keep the answer fixed; check whether it still holds.

Keep the answer fixed while renaming the task’s objects. The same relational rule still applies, but a list of the original identifiers fails.

Reinforcement learning with verifiable rewards relies on a checker to decide what counts as success. If the checker only tests the given examples, an answer can earn a reward without capturing the underlying rule.

Isomorphic Perturbation Testing checks one fixed model output on the original task and on a logically equivalent version with renamed objects. Relationships and attributes stay the same. A general relational rule should still work; an answer tied to specific object identifiers will fail.

On the studied train-classification benchmark, RLVR-trained models used shortcuts that passed ordinary verification. In controlled training, an example-based verifier induced this behavior, while isomorphic verification eliminated the observed gap. Shortcuts were also more frequent at higher inference-time budgets in the evaluated models.