REVIEW 2 cited by
Compute Optimal Scaling of Skills: Knowledge vs Reasoning
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
Signed reviews
read the original abstract
Scaling laws are a critical component of the LLM development pipeline, most famously as a way to forecast training decisions such as 'compute-optimally' trading-off parameter count and dataset size, alongside a more recent growing list of other crucial decisions. In this work, we ask whether compute-optimal scaling behaviour can be skill-dependent. In particular, we examine knowledge and reasoning-based skills such as knowledge-based QA and code generation, and we answer this question in the affirmative: scaling laws are skill-dependent. Next, to understand whether skill-dependent scaling is an artefact of the pretraining datamix, we conduct an extensive ablation of different datamixes and find that, also when correcting for datamix differences, knowledge and code exhibit fundamental differences in scaling behaviour. We conclude with an analysis of how our findings relate to standard compute-optimal scaling using a validation set, and find that a misspecified validation set can impact compute-optimal parameter count by nearly 50%, depending on its skill composition.
Forward citations
Cited by 2 Pith papers
-
Signal and Noise: A Framework for Reducing Uncertainty in Language Model Evaluation
Benchmark signal-to-noise ratio, measured as score spread across models divided by checkpoint-to-checkpoint variability, predicts small-to-large model decision accuracy and can be improved by subtask filtering, checkp...
-
R&B: Domain Regrouping and Data Mixture Balancing for Efficient Foundation Model Training
R&B repartitions training data into embedding-based semantic clusters and reweights them online via a gradient Gram matrix, matching or exceeding prior data-mixing methods at under 0.1% extra compute.
Discussion (0). Continue with ORCID to comment.