pith. sign in

arxiv: 2306.09479 · v2 · pith:C7MNKQ5Anew · submitted 2023-06-15 · 💻 cs.CL · cs.AI· cs.CY

Inverse Scaling: When Bigger Isn't Better

classification 💻 cs.CL cs.AIcs.CY
keywords scalinginversedatatasktrainingdatasetsincreasedmodels
0
0 comments X
read the original abstract

Work on scaling laws has found that large language models (LMs) show predictable improvements to overall loss with increased scale (model size, training data, and compute). Here, we present evidence for the claim that LMs may show inverse scaling, or worse task performance with increased scale, e.g., due to flaws in the training objective and data. We present empirical evidence of inverse scaling on 11 datasets collected by running a public contest, the Inverse Scaling Prize, with a substantial prize pool. Through analysis of the datasets, along with other examples found in the literature, we identify four potential causes of inverse scaling: (i) preference to repeat memorized sequences over following in-context instructions, (ii) imitation of undesirable patterns in the training data, (iii) tasks containing an easy distractor task which LMs could focus on, rather than the harder real task, and (iv) correct but misleading few-shot demonstrations of the task. We release the winning datasets at https://inversescaling.com/data to allow for further investigation of inverse scaling. Our tasks have helped drive the discovery of U-shaped and inverted-U scaling trends, where an initial trend reverses, suggesting that scaling trends are less reliable at predicting the behavior of larger-scale models than previously understood. Overall, our results suggest that there are tasks for which increased model scale alone may not lead to progress, and that more careful thought needs to go into the data and objectives for training language models.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 15 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. AgentDojo: A Dynamic Environment to Evaluate Prompt Injection Attacks and Defenses for LLM Agents

    cs.CR 2024-06 unverdicted novelty 8.0

    AgentDojo introduces an extensible evaluation framework populated with realistic agent tasks and security test cases to measure prompt injection robustness in tool-using LLM agents.

  2. LEVANTE-bench: Multi-Scale Comparison of VLMs to Children Using Cognitive Tasks (or, "Is Your VLM Smarter Than a 5th Grader?")

    cs.LG 2026-06 unverdicted novelty 7.0

    VLMs show partial alignment with children's performance on six cognitive tasks, with stronger models matching better at task and item levels but struggling on matrix reasoning and mental rotation.

  3. The Variance Brain Foundation Models Forgot: Third-Order Statistics Predict Cognition Where Billion-Parameter Models Fail

    q-bio.NC 2026-05 unverdicted novelty 7.0

    Third-order co-skewness in fMRI is destroyed by BFM pretraining, causing poor cognition prediction; a co-skewness-preserving linear FC exceeds BFMs and raw FC.

  4. GraphARC: A Comprehensive Benchmark for Graph-Based Abstract Reasoning

    cs.AI 2026-05 unverdicted novelty 7.0

    GraphARC is a scalable benchmark for few-shot graph transformation learning that exposes a comprehension-execution gap in language models on abstract reasoning tasks.

  5. Evaluating Code Reasoning Abilities of Large Language Models Under Real-World Settings

    cs.SE 2025-12 unverdicted novelty 7.0

    A new dataset and nine-metric majority-vote procedure show that existing code-reasoning benchmarks are dominated by lower-complexity problems that do not reflect real-world code.

  6. Monitoring Reasoning Models for Misbehavior and the Risks of Promoting Obfuscation

    cs.AI 2025-03 conditional novelty 7.0

    Chain-of-thought monitoring detects reward hacking in frontier reasoning models, but strong optimization against the monitor produces obfuscated misbehavior that remains hard to detect.

  7. Trivium: Temporal Regret as a First-Class Objective for Causal-Memory Controllers

    cs.AI 2026-06 unverdicted novelty 6.0

    Trivium frames temporal regret as a first-class objective for causal-memory controllers and derives O(log E) bounds on miscalibration persistence under causal-probing assumptions, with preliminary validation on Causal...

  8. Resonant Context Anchoring: Decoupling Attention Routing and Signal Gain at Inference Time

    cs.CL 2026-06 unverdicted novelty 6.0

    RCA is a training-free module that boosts input context signal strength in the residual stream of LLMs by orthogonal decoupling of attention routing from value magnitude.

  9. History Anchors: How Prior Behavior Steers LLM Decisions Toward Unsafe Actions

    cs.AI 2026-05 unverdicted novelty 6.0

    A single consistency instruction with harmful prior actions causes aligned frontier LLMs to select unsafe options at 91-98% rates in high-stakes domains, with escalation and inverse scaling by model size.

  10. The Granularity Gap: A Multi-Dimensional Longitudinal Audit of Sycophancy in Gemini Models

    cs.CL 2026-04 conditional novelty 6.0

    Continuous sycophancy scoring reveals that 27% of Gemini responses contain substantial social compliance missed by binary filters, with sycophancy correlating with hallucination and simple guardrails outperforming com...

  11. EntroRouter: Learning Efficient Model Routing via Entropy Regulation

    cs.CL 2026-06 unverdicted novelty 5.0

    EntroRouter applies entropy regulation in a single-round routing framework to decouple reasoning from routing, retaining 98.3% of top expert accuracy at 48.25% lower compute cost.

  12. From Verdict to Process: Agentic Reinforcement Learning for Multi-Stage Fact Verification

    cs.AI 2026-06 unverdicted novelty 5.0

    ProFact applies agentic RL with process-aware rewards to jointly optimize claim decomposition, evidence retrieval, and verdict prediction in multi-stage fact verification.

  13. Absurd World: A Simple Yet Powerful Method to Absurdify the Real-world for Probing LLM Reasoning Capabilities

    cs.AI 2026-05 unverdicted novelty 5.0

    Absurd World automatically converts real-world problems into absurd yet logically coherent scenarios to test whether LLMs can reason without depending on familiar patterns.

  14. Complexity Horizons of Compressed Models in Analog Circuit Analysis

    cs.AI 2026-05 unverdicted novelty 5.0

    Prerequisite graphs map compressed LLM performance boundaries in analog circuit analysis to allow selecting the smallest viable model for a given task complexity.

  15. A Red Teaming Framework for Large Language Models: A Case Study on Faithfulness Evaluation

    cs.CL 2026-06 unverdicted novelty 4.0

    Introduces a multi-role red teaming framework using attacker and jury models that increases attack success rates by up to 7.9% on LLM faithfulness in question-answering tasks.