pith. sign in

arxiv: 2602.05970 · v2 · pith:OE3TS6XAnew · submitted 2026-02-05 · 💻 cs.LG · cs.AI· math.DS· stat.ML

Inverse Depth Scaling From Most Layers Being Similar

classification 💻 cs.LG cs.AImath.DSstat.ML
keywords depthllmslossarchitecturalcompositionaldynamicslayersnetworks
0
0 comments X
read the original abstract

Neural scaling laws relate loss to model size in large language models (LLMs), yet depth and width may contribute to performance differently, requiring more detailed studies. Here, we quantify how depth affects loss via analysis of LLMs and toy residual networks. We find loss scales inversely proportional to depth in LLMs, probably due to functionally similar layers reducing error through ensemble averaging rather than compositional learning or discretizing smooth dynamics. This regime is inefficient yet robust and may arise from the architectural bias of residual networks and target functions incompatible with smooth dynamics. The findings suggest that improving LLM efficiency may require architectural innovations to encourage compositional use of depth.

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 1 Pith paper

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

  1. Neural Scaling Universality: If Exponents Are Fixed, Time to Understand Coefficients

    cs.LG 2026-06 unverdicted novelty 4.0

    Position paper claims fixed exponents in scaling laws arise from generic mechanisms while coefficients vary with data and architecture, making the latter the focus for improvements.