Skip to content
nano-gpt-data-curation

claude-opus-4-8

nano-gpt-data-curation — graded by the task's verifier against a measured baseline.

backend
modal
variant
claude claude-opus-4-8
metric
held-out multi-domain perplexity
actions
40
duration
40m
recorded
2026-08-04

run iddclm-nano-curation__PTUx94M

Score

reward
348.060
compare against every run on this task →

Summary

All deliverables are in place. Here's the summary.

Result

I curated the 182k-doc raw web pool down to a prioritized selection that trains a measurably better small LM than random selection.

Best dev held-out perplexity: 403.6 vs. random baseline 466.5 (~13% lower).

What worked — and what didn't

I tested two competing hypotheses on the frozen trainer:

  1. *Aggressive domain matching (DSIR importance ranking) → 549 ppl, worse than random.* Ranking docs by target-likeness and filling the budget from the top collapses onto a narrow, homogeneous register that generalizes poorly.
  2. Trim the junk tail, keep diversity → 404 ppl. Gate out low-quality docs, then train on survivors in shuffled order.

The keep-fraction sweep revealed a clear interior optimum:

keep-frac0.250.350.550.700.85random
dev ppl477480446404443466

0.70 beat every other fraction across three shuffle seeds (404 / 441 / 421), confirming the fraction — not a lucky slice — is what's good.

Deliverables

  • `submission/selection.json` — 124,215 ids (validated: unique, in-range, ~12M tokens in the first ~12k ids alone), produced by keep-frac=0.70 + shuffle.
  • `submission/curate.py` — reproducible: unigram importance weighting (log p_target − log p_pool, target decoded from the dev tokens) + a domain-neutral prose-quality gate (function-word density, line-fragmentation, length), drop worst 30%, shuffle survivors.
  • `claim.md` — hypothesis, a falsifiable non-monotonicity mechanism, falsification criteria, and transfer.

The core finding: for a broad multi-domain target under a tight budget, removing the low-quality tail while preserving register diversity beats maximizing target similarity.

Transcript