HackerPapers

arXiv:2404.10102cs.AI

Chinchilla Scaling: A replication attempt

Tamay Besiroglu, Ege Erdil, Matthew Barnett, Josh You

Abstract

Hoffmann et al. (2022) propose three methods for estimating a compute-optimal scaling law. We attempt to replicate their third estimation procedure, which involves fitting a parametric loss function to a reconstruction of data from their plots. We find that the reported estimates are inconsistent with their first two estimation methods, fail at fitting the extracted data, and report implausibly narrow confidence intervals--intervals this narrow would require over 600,000 experiments, while they likely only ran fewer than 500. In contrast, our rederivation of the scaling law using the third approach yields results that are compatible with the findings from the first two estimation procedures described by Hoffmann et al.

arXiv comments
Journal reference
DOI
Subjects
cs.AIArtificial Intelligence cs.CLComputation and Language

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 2 threads, from Apr 2024 to Aug 2025. Found in 3 HN submissions from Apr 2024 to Apr 2024. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments2 threads

    • Earlier... Training Compute-Optimal Large Language Models (2022) https://arxiv.org/abs/2203.15556 Chinchilla Scaling: A replication attempt (2024) https://arxiv.org/abs/2404.10102

      adityaathalyeView on HNParent context

    • You can find the preprint, which the Twitter thread summarizes, here (https://arxiv.org/abs/2404.10102)

      aportView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.