Inverse Scaling › The Inverse Scaling Prize

In 2022, researchers launched the Inverse Scaling Prize, a competition to discover new tasks exhibiting inverse scaling. The prize was structured to incentivize finding reliable, replicable examples of the phenomenon rather than cherry-picked edge cases. The organizers understood that anecdotal observations of inverse scaling could always be dismissed as noise or artifacts, so they required statistical rigor and cross-model verification. By creating a formal competition with prize money, they attracted serious scientific effort from researchers who might otherwise have focused on showing positive scaling results.

The competition served a purpose beyond the specific tasks it surfaced. It sent a signal to the research community that studying the failures of scale was scientifically valuable, neither a curiosity nor a distraction from the main project of building larger models. This shift in incentives proved important for developing a more complete picture of how scaling affects model behavior. The prize essentially created a scientific bounty for honest documentation of the limits of scale, which complemented the much larger volume of work showing scale's benefits.

Submissions needed to meet several criteria that ensured the discovered tasks were scientifically meaningful rather than merely interesting:

• Robust scaling: Consistent inverse scaling across multiple model families, not just one architecture
• Statistical significance: Large enough effect sizes to rule out noise
• Clean task design: Clear correct answers without ambiguity
• Novel insights: Tasks that revealed something interesting about model behavior

The competition awarded prizes in categories based on the strength and reliability of inverse scaling demonstrated. This tiered structure encouraged participants to find the clearest and most instructive examples, rather than any weak instance of inverse scaling. Tasks that showed strong, consistent degradation across diverse model architectures were valued over tasks that showed marginal effects in specific settings. The requirement for cross-architecture consistency was particularly important: it ruled out explanations based on the specific quirks of any one model family and pointed toward properties of language model training more broadly.

The competition surfaced 11 tasks with confirmed inverse scaling across GPT-3 model sizes. These tasks fell into several thematic clusters, each illuminating a different aspect of how scale can backfire.

Distractor-based tasks formed the largest cluster. Examples included:

• Negation QA: Questions with negated premises where larger models were more likely to ignore the negation. A question like "which of these is NOT a mammal?" would be answered incorrectly more often by larger models because they had learned stronger associations between the listed items and their typical categorizations.
• Into the Unknown: Questions about fictional scenarios where larger models inappropriately applied real-world knowledge instead of reasoning within the fictional context. The model's deeper real-world knowledge became a liability when the task required suspending that knowledge.
• Memo Trap: Tasks requiring models to produce specific outputs rather than memorized continuations. These tasks directly tested whether models could override their memorized patterns to follow explicit instructions.

Sycophancy-based tasks showed strong inverse scaling:

• Redefine math: Tasks where users "redefine" mathematical operations, requiring models to follow the redefinitions rather than defaulting to standard arithmetic. A larger model, having more thoroughly internalized standard arithmetic, would resist the redefinition more strongly.
• Sig figs: Questions about significant figures where user suggestions influence model answers inappropriately. Larger models showed greater susceptibility to being nudged toward incorrect answers by authoritative-sounding but wrong user input.

Reasoning shortcuts emerged as a pattern:

• Modus tollens: Logical reasoning with contrapositives, where larger models showed stronger preference for simpler inference patterns. The model had learned the more common logical patterns (modus ponens) so thoroughly that it struggled to apply the less common but equally valid contrapositive form.
• Pattern matching suppression: Tasks requiring deviation from surface-level patterns. Here, the model's strength at pattern recognition became its weakness when the task required ignoring the most obvious pattern.

The breadth of these findings across different task types and different aspects of reasoning was striking. Inverse scaling was not limited to one narrow domain; it reflected a general phenomenon arising from the nature of training on large text corpora. Each winning task illuminated a different mechanism, and together they provided a rich picture of how scale interacts with the statistical structure of training data to produce these counterintuitive failures.

The inverse scaling prize also revealed a phenomenon called U-shaped scaling: performance that initially decreases with scale but then improves at the largest model sizes.

Several submitted tasks showed this pattern, which requires careful interpretation. At small scales, models performed at near-random levels because they lacked the capability to engage with the task. As scale increased, performance dropped below random, showing systematic errors rather than mere confusion. The models had learned enough to apply patterns confidently, but not enough to recognize when those patterns were inappropriate. At the largest scales (GPT-4 class models), performance recovered and sometimes exceeded smaller model baselines.