← All Posts
A Visual Walkthrough

Learning From the Bottom Up

Direction and depth of learning in the data-limited regime

learning climbs abstract surface

Jasper Gilley  ·  Independent researcher

Scroll

SECTION 01

Our motivations

Language is hierarchical, in two ways

Train a network on data with hierarchical structure, like language, and two hierarchies are in play:

  • Syntactic — an open parenthesis predicts a close; structure nests.
  • Semantic — abstract concepts decompose into concrete ones.

Both run from an abstract top to a surface bottom.

“courtroom trial” judge jury verdict semantic: concept → sub-concepts syntactic: nesting predicts closure ( [ {  …  } ] ) opener ⇒ closer

In which direction does the network learn it?

Two ways the network could climb the abstraction tree over training:

  • Top-down — grasp the abstract gist first, fill in details later.
  • Bottom-up — nail local surface regularities first, reach the abstract rules only later, if ever.
Why it matters
Every task recruits capabilities latent at some level. Typo-fixing needs the bottom; creative writing needs the top.
abstract surface top-down bottom-up ?
SECTION 02

A controllable hierarchy: the RHM

The Random Hierarchy Model

Language's hierarchy is implicit. The RHM is a synthetic one we fully control.

A tree: the root expands, level by level, each feature picking one of \(m\) rules into \(s\) children, down to \(s^{L}\) observed tokens.

Cagnetta, Petrini, Tomasini, Favero & Wyart, Phys. Rev. X, 2024.

root level 2 level 1 tokens R X Y P Q S T c a e b f c a d picks 1 of m rules each feature → s = 2 children sᴸ = 2³ = 8 tokens (shown); real runs use L = 6, i.e. 64 tokens

Features are a menu of synonyms

A feature = a menu of m rules Q e b a f c c d e used above all valid as Q

One latent feature, \(m\) interchangeable rules \(\Rightarrow\) many surface tuples that are synonyms: different strings, identical one level up.

Q e b Q a f
The dial
Higher \(m\) \(\Rightarrow\) more synonyms to unify \(\Rightarrow\) the wave stalls sooner.
SECTION 03

Reading learning level by level

Every prediction tests exactly one level

Because the process is known, each token is tagged by the level it tests.

Predicting position \(p\) crosses the deepest boundary to its left — the level is how many times \(s\) divides \(p\) (its trailing zeros).

Payoff
A single held-out sequence becomes a per-level report card: group losses by level, watch each get learned on its own.
c a e b f c a d root boundary start p=1p=2p=3p=4p=5p=6p=7 L0 L1 L0 L2 L0 L1 L0

At \(L{=}6\) (64 tokens), the same rule tiles into a self-similar ruler:

p=32: the root, once per sequence
SECTION 04

Learning climbs bottom-up — then stalls

The learning wave climbs the hierarchy bottom-up

hierarchy level L0 L1 L2 L3 L4 L5 root tokens step 200 learned: L0 step 1,000 L0–L1 step 5,400 L0–L2, then stuck training training ceiling L3–L5 stay at chance at chance learned frontier (top learned level)

Warmth = how far each level is learned (real per-level loss, \(m{=}2\) model). The order in which each level begins to fall is perfectly monotonic: leaves first, root last. Here that model is a 4-layer, 4-head transformer (\(d{=}128\), ~0.8M params) trained on 5M tokens of Random Hierarchy Model data at \(L{=}6,\ v{=}8,\ m{=}2\) (64-token sequences).

The same wave in the numbers — and a ceiling

Per-level cross-entropy (\(m{=}2\)). Uniform guessing \(=\ln 8 \approx 2.08\); the orange cell marks the frontier.

stepL0L1L2L3L4L5
start2.042.041.992.042.092.04
2000.671.661.641.971.911.92
1,0000.491.311.421.971.861.92
5,4000.371.121.171.771.751.87

L1 moves only once L0 is underway; L2 waits for L1. Levels 3–5 barely leave the floor.

The ceiling
The wave stops after 2–3 levels. What sets that ceiling?
Model capacity?
a deeper hierarchy needs a bigger network
Signal in the data?
the cue simply runs out

Intuition says capacity. Here, intuition is wrong — these models had capacity to spare.

SECTION 05

The ceiling is in the data

Hold one fixed, vary the other

Fix data (\(m{=}2\)), vary the model

Ten transformers spanning a 200× range of capacity:

= 30K params 6.3M params both stall at L2

All ten stall at L2. Depth buys almost nothing — 2 layers compose as many levels as 8.

Fix the model, vary \(m\)

One generous 8-layer network; \(v{=}8\), chance \(=0.125\):

\(m\)L0L1L2L3–5climbs to
20.830.440.44~0.27~L2
40.590.310.21~0.20~L1
60.480.190.18~0.16~L0
80.340.180.18~0.20barely L0

Every extra synonym shortens the climb.

Verdict
In this setup, the ceiling is set by the data — once the model is big enough, adding capacity doesn't raise it.

Clean the signal, and the wave reaches the root

hierarchy level L0 L1 L2 L3 L4 L5 root tokens v=16, m=2 climbs to the root m/v = 0.12 v=8, m=2 stalls at L2 m/v = 0.25 (essay’s setting) v=8, m=8 crushed to the leaves m/v = 1.0 ceiling no wall probe recovers root at 0.93 (Bayes-optimal) more ambiguous data →

Same 8-layer network, same 40k steps in every panel — only the data's ambiguity changes.

SECTION 06

Why the bottom comes first

Two compounding forces

1  The signal is loudest at the bottom

faint strong c a e b f c a d neighbours: strong (L0) across root: faint

The cue is diluted by every random layer above it — the data to hear it grows exponentially with depth.

2  You cannot skip a step

tokens level-1 features level-2 features root identifiesidentifiesidentifies

A feature is identifiable only through the features beneath it — until parents are read, grandparents are invisible. The order is logically forced.

Together they make a signal ceiling — the wave stalls where the cue sinks below what the data reveals. Across the model sizes tested here, capacity was the cheap variable.
SECTION 07

Implications

Implications for language modeling

Expect the same order in language:

  • First: syntax, local co-occurrences, the basic geometry of language.
  • Later, if ever: deep compositional rules and rich abstractions — only if the corpus carries a clean enough cue.

What buys the next level is signal — more data with a cleaner cue — against a threshold that rises exponentially with depth. In the data-limited regime, the reach is a property of language, not the model.

Consistent with Networks Learn Statistics of Increasing Complexity and Language Model Behavioral Phases.

surface semantics deep structure

Nothing accidental about a model that captures mostly surface semantics — it is where a data-limited model comes to rest.

← All Posts

Jasper Gilley — Twitter Github