Pith. sign in

REVIEW 9 cited by

Observational Scaling Laws and the Predictability of Language Model Performance

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.10938 v3 pith:YTTGGQ5D submitted 2024-05-17 cs.LG cs.AIcs.CLstat.ML

classification cs.LGcs.AIcs.CLstat.ML
keywords modelscalinglanguagemodelsperformancetrainingapproachcapabilities
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Understanding how language model performance varies with scale is critical to benchmark and algorithm development. Scaling laws are one approach to building this understanding, but the requirement of training models across many different scales has limited their use. We propose an alternative, observational approach that bypasses model training and instead builds scaling laws from ~100 publically available models. Building a single scaling law from multiple model families is challenging due to large variations in their training compute efficiencies and capabilities. However, we show that these variations are consistent with a simple, generalized scaling law where language model performance is a function of a low-dimensional capability space, and model families only vary in their efficiency in converting training compute to capabilities. Using this approach, we show the surprising predictability of complex scaling phenomena: we show that several emergent phenomena follow a smooth, sigmoidal behavior and are predictable from small models; we show that the agent performance of models such as GPT-4 can be precisely predicted from simpler non-agentic benchmarks; and we show how to predict the impact of post-training interventions like Chain-of-Thought and Self-Consistency as language model capabilities continue to improve.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 9 Pith papers

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

  1. EdgeBench: Unveiling Scaling Laws of Learning from Real-World Environments

    cs.CL 2026-07 conditional novelty 7.5 of 10

    Across ~38,000 hours on 134 ultra-long real-world tasks, aggregate agent performance follows a log-sigmoid of interaction time, and measured learning speed doubles about every three months.

  2. Predictable Scale: Part II, Farseer: A Refined Scaling Law in Large Language Models

    cs.LG 2025-06 conditional novelty 6.0 of 10

    A newly fitted scaling law with model-size-dependent data exponents predicts LLM loss more accurately than Chinchilla, including at a held-out 25.1B model.

  3. A Theory of Inference Compute Scaling: Reasoning through Directed Stochastic Skill Search

    cs.LG 2025-06 conditional novelty 6.0 of 10

    A skill-graph random-walk model gives closed-form accuracy-versus-compute formulas for four reasoning strategies and connects them to training scaling.

  4. How Benchmark Prediction from Fewer Data Misses the Mark

    cs.LG 2025-06 conditional novelty 6.0 of 10

    Benchmark prediction methods mostly work by interpolation among similar models and fail on better, unfamiliar models, where random sampling with an AIPW-style correction is the only consistent improvement.

  5. NegVQA: Can Vision Language Models Understand Negation?

    cs.CL 2025-05 conditional novelty 6.0 of 10

    NegVQA shows that current vision language models, including the best available open models, lose about 20 to 30 percentage points in accuracy when a visual question is negated.

  6. Capability Salience Vector: Fine-grained Alignment of Loss and Capabilities for Downstream Task Scaling Law

    cs.CL 2025-06 conditional novelty 5.0 of 10

    A fitted token-level loss weighting, optimized against known model accuracies, predicts held-out downstream task performance more accurately than mean validation loss on five of six benchmarks.

  7. Cross-Task Experiential Learning on LLM-based Multi-Agent Collaboration

    cs.CL 2025-05 conditional novelty 5.0 of 10

    MAEL gives each agent in a multi-agent LLM system an experience pool and retrieves high-reward past steps to guide new task solving.

  8. MixLLM: Dynamic Routing in Mixed Large Language Models

    cs.CL 2025-02 conditional novelty 5.0 of 10

    MixLLM routes each query to a cost-effective LLM by combining tag-enhanced embeddings, per-model quality and cost predictors, a latency penalty, and online bandit feedback.

  9. A Frontier AI Risk Management Framework: Bridging the Gap Between Current AI Practices and Established Risk Management

    cs.AI 2025-02 conditional novelty 4.0 of 10

    A synthesis of established risk management practices into a structured framework for frontier AI developers, centered on explicit risk tolerance, KRI/KCI thresholds, and governance.

Pith tools