Papers
arxiv:2602.15327

Prescriptive Scaling Reveals the Evolution of Language Model Capabilities

Published on Feb 17
· Submitted by
hlzhang109
on Feb 18
Authors:
,

Abstract

Large-scale observational analysis estimates capability boundaries and performance predictions for foundation models using quantile regression and evaluates temporal stability across tasks.

AI-generated summary

For deploying foundation models, practitioners increasingly need prescriptive scaling laws: given a pre training compute budget, what downstream accuracy is attainable with contemporary post training practice, and how stable is that mapping as the field evolves? Using large scale observational evaluations with 5k observational and 2k newly sampled data on model performance, we estimate capability boundaries, high conditional quantiles of benchmark scores as a function of log pre training FLOPs, via smoothed quantile regression with a monotone, saturating sigmoid parameterization. We validate the temporal reliability by fitting on earlier model generations and evaluating on later releases. Across various tasks, the estimated boundaries are mostly stable, with the exception of math reasoning that exhibits a consistently advancing boundary over time. We then extend our approach to analyze task dependent saturation and to probe contamination related shifts on math reasoning tasks. Finally, we introduce an efficient algorithm that recovers near full data frontiers using roughly 20% of evaluation budget. Together, our work releases the Proteus 2k, the latest model performance evaluation dataset, and introduces a practical methodology for translating compute budgets into reliable performance expectations and for monitoring when capability boundaries shift across time.

Community

Paper author Paper submitter

We introduce prescriptive scaling, a framework for predicting the attainable downstream performance of language models given a fixed pre-training compute budget. Rather than modeling average trends, we estimate high-quantile capability boundaries using monotone sigmoid quantile regression and show that post-training performance is largely predictable and stable over time for most tasks. We find that math reasoning is a notable exception, with a boundary that continues to advance across model generations. We also release the PROTEUS-2K dataset and propose an efficient sampling method that recovers near-full performance frontiers with a fraction of the evaluation cost.

Sign up or log in to comment

Models citing this paper 0

No model linking this paper

Cite arxiv.org/abs/2602.15327 in a model README.md to link it from this page.

Datasets citing this paper 0

No dataset linking this paper

Cite arxiv.org/abs/2602.15327 in a dataset README.md to link it from this page.

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/2602.15327 in a Space README.md to link it from this page.

Collections including this paper 0

No Collection including this paper

Add this paper to a collection to link it from this page.