Table of Contents
Fetching ...

A Latent Variable Framework for Scaling Laws in Large Language Models

Peiyao Cai, Chengyu Cui, Felipe Maia Polo, Seamus Somerstep, Leshem Choshen, Mikhail Yurochkin, Moulinath Banerjee, Yuekai Sun, Kean Ming Tan, Gongjun Xu

TL;DR

The paper tackles the challenge that classical LLM scaling laws, which relate performance to model size and data, poorly capture the heterogeneous, multi-faceted capabilities across diverse model families and benchmarks. It introduces a latent-variable framework where family-specific latent abilities generate benchmark performance through a beta-based IRT-like model, enabling coherent cross-family evaluation, uncertainty quantification, and interpretable skill dimensions. The authors develop a likelihood-based estimator with identifiability constraints, prove consistency and asymptotic normality, and provide scalable computation via projected stochastic gradient ascent and posterior sampling. Empirically, they fit the model to 12 Open LLM Leaderboard benchmarks, uncover four interpretable latent skills, generate prediction intervals for unevaluated models, and derive compute-optimal scaling guidance for different skills. This framework offers principled tooling for planning compute, benchmarking, and understanding how design choices shape emergent capabilities in large language models.

Abstract

We propose a statistical framework built on latent variable modeling for scaling laws of large language models (LLMs). Our work is motivated by the rapid emergence of numerous new LLM families with distinct architectures and training strategies, evaluated on an increasing number of benchmarks. This heterogeneity makes a single global scaling curve inadequate for capturing how performance varies across families and benchmarks. To address this, we propose a latent variable modeling framework in which each LLM family is associated with a latent variable that captures the common underlying features in that family. An LLM's performance on different benchmarks is then driven by its latent skills, which are jointly determined by the latent variable and the model's own observable features. We develop an estimation procedure for this latent variable model and establish its statistical properties. We also design efficient numerical algorithms that support estimation and various downstream tasks. Empirically, we evaluate the approach on 12 widely used benchmarks from the Open LLM Leaderboard (v1/v2).

A Latent Variable Framework for Scaling Laws in Large Language Models

TL;DR

The paper tackles the challenge that classical LLM scaling laws, which relate performance to model size and data, poorly capture the heterogeneous, multi-faceted capabilities across diverse model families and benchmarks. It introduces a latent-variable framework where family-specific latent abilities generate benchmark performance through a beta-based IRT-like model, enabling coherent cross-family evaluation, uncertainty quantification, and interpretable skill dimensions. The authors develop a likelihood-based estimator with identifiability constraints, prove consistency and asymptotic normality, and provide scalable computation via projected stochastic gradient ascent and posterior sampling. Empirically, they fit the model to 12 Open LLM Leaderboard benchmarks, uncover four interpretable latent skills, generate prediction intervals for unevaluated models, and derive compute-optimal scaling guidance for different skills. This framework offers principled tooling for planning compute, benchmarking, and understanding how design choices shape emergent capabilities in large language models.

Abstract

We propose a statistical framework built on latent variable modeling for scaling laws of large language models (LLMs). Our work is motivated by the rapid emergence of numerous new LLM families with distinct architectures and training strategies, evaluated on an increasing number of benchmarks. This heterogeneity makes a single global scaling curve inadequate for capturing how performance varies across families and benchmarks. To address this, we propose a latent variable modeling framework in which each LLM family is associated with a latent variable that captures the common underlying features in that family. An LLM's performance on different benchmarks is then driven by its latent skills, which are jointly determined by the latent variable and the model's own observable features. We develop an estimation procedure for this latent variable model and establish its statistical properties. We also design efficient numerical algorithms that support estimation and various downstream tasks. Empirically, we evaluate the approach on 12 widely used benchmarks from the Open LLM Leaderboard (v1/v2).

Paper Structure

This paper contains 27 sections, 2 theorems, 63 equations, 6 figures, 2 tables, 3 algorithms.

Key Result

Theorem 1

Under Assumption A.1 in Appendix A.1 of the online supplementary material, the estimator $\widehat{\xi}$ obtained by eq_mmle is consistent: $\|\widehat{\xi} - \xi^*\| = o_p(1)$, where $\xi^*$ is the vector of true parameters for the scaling model defined in Section subsec_setup.

Figures (6)

  • Figure 1: Estimated loadings for the $K=4$ model. In the vertical axis, our $K$ skills correspond to mathematical skills (MATH), instruction following (IFEval), common-sense reasoning (HellaSwag), and logical/linguistic reasoning (BBH).
  • Figure 2: Correlation matrix of the latent random effects.
  • Figure 3: Joint density plot comparing the skills random intercepts ($\alpha_l$) of Yi-1.5 and Yi-1.5-chat models, highlighting the enhanced instruction following capability of the chat variants.
  • Figure 4: $95\%$ prediction intervals for six test LLMs.
  • Figure S1: Model selection and estimated correlation structure. Left: AIC curve. Right: correlation of $\alpha$ under $K = 6$.
  • ...and 1 more figures

Theorems & Definitions (4)

  • Remark 1
  • Theorem 1
  • Theorem 2
  • Remark 2