Inference Scaling › Trade-offs and Practical Considerations

Michael BrenndoerferOctober 27, 20255 min read
Language AI HandbookAll chapters
Part 23 of 67Scaling Laws
Chapter 167Inference Scaling › Trade-offs and Practical Considerations
Reading section 7 of 11 · Trade-offs and Practical Considerations · 5 minSection 7 of 11 · 5 min

Book contents

Section 7 of 11 · 5 min read

Inference Scaling › Trade-offs and Practical ConsiderationsOne section · Sections in this chapter7 / 11 ↓

Inference scaling decisions involve more than raw compute costs. Several practical factors influence the optimal model size.

Quality Degradation Limits

Over-training has diminishing returns. As you train a smaller model on more data, it eventually hits capacity limits, and additional training gives minimal benefit. The loss curve for a fixed model size approaches an asymptote:

L(N,D)→ANα+Eas D→∞L(N, D) \to \frac{A}{N^\alpha} + E \quad \text{as } D \to \infty

This equation shows the basic capacity limit of any fixed-size model: no amount of additional training data can push the loss below the floor set by model size and the irreducible entropy of language.

where:

  • L(N,D)L(N, D): the model's loss as a function of parameters NN and training data DD
  • AA: empirically fitted scaling coefficient for model capacity
  • NαN^\alpha: model size raised to the scaling exponent (typically α≈0.34\alpha \approx 0.34)
  • EE: irreducible error floor (entropy of natural language)
  • D→∞D \to \infty: the limit as training data approaches infinity

This limit shows what happens when a fixed-size model is trained on infinite data: the data-dependent term B/DβB/D^\beta vanishes, leaving only the model capacity term A/NαA/N^\alpha and the irreducible error floor EE. The model capacity term is limitations inherent to the architecture. A 7B model simply cannot stand for certain complex patterns that a 70B model can capture. These architectural constraints set hard limits on how much over-training can compensate for fewer parameters.

Research suggests that models can be productively over-trained by roughly 10-50× before returns diminish materially. Beyond that, you're paying for training compute that yields minimal quality improvement.

Out[17]:
Visualization
Log-scale line chart showing loss curves for 7B, 13B, 34B, and 70B models as training tokens increase from 0.1 to 100 trillion, with each curve flattening toward a model-specific loss floor and a shaded region between 1.4 and 7 trillion tokens marking the practical over-training range.
Diminishing returns from over-training. Each curve shows loss for a fixed model size as training tokens increase. Smaller models reach their capacity limits faster and at higher loss floors. The shaded region indicates the practical over-training range (10-50×).

Task-Specific Considerations

Different tasks have different sensitivity to model size. Smaller models may:

  • Struggle with complex reasoning chains
  • Have weaker few-shot learning compared to larger models
  • Show degraded performance on rare or specialized domains
  • Handle adversarial or unusual inputs less reliably

For applications requiring these capabilities, accepting higher inference costs may be necessary. The next chapter on predicting model performance will give frameworks for estimating these task-specific capabilities.

Memory Constraints

Larger models require proportionally more GPU memory. A 70B FP16 model needs 140GB just for weights, exceeding single-GPU capacity and requiring model parallelism. This introduces:

  • Higher latency from cross-GPU communication
  • Reduced batch efficiency
  • More complex deployment infrastructure

Smaller models that fit on a single GPU often reach better effective throughput despite needing to load parameters for every token.

Batching Efficiency

Production inference servers batch multiple requests together, amortizing the cost of loading model weights across many tokens. Batching efficiency improves with model size to a point, but larger models have smaller maximum batch sizes due to memory constraints.

The optimal batch size trades off:

  • Throughput (higher batches = better GPU utilization)
  • Latency (larger batches = longer queue times)
  • Memory (each request consumes activation memory)