On-policy mathematical distillation
Claude Opus 5 · Claude Code · low effort
Public case ID: claude__opd_math_1p5b__claude-opus-5__low
Recipe shift
What the agent changed
Shipped baseline
Sample student answers, score their tokens with a frozen teacher, and update all student weights with a reverse-KL policy-gradient estimator.
Starting artifact: DeepSeek-R1-Distill-Qwen-1.5B student
Candidate algorithm
Baseline flow is prompt to on-policy student responses, teacher score for sampled tokens, clipped reverse-KL/PPO update, then full-student export. Candidate flow keeps the same student sampling but obtains the teacher's top-16 token distribution at every position and directly minimizes teacher-to-student forward KL over all student weights. It uses no task reward, external model, synthetic question, or pre-existing chain of thought. This is an algorithm and training-signal change plus hyperparameter, data-order, wall-clock, engineering, and checkpoint-policy changes. The exploration-best method was submitted as…
Exploration and replay evidence
Four-hour exploration
The common proxy was math500_pass_at_1, maximize, on 500 MATH-500 questions with four generations each (n=2000) and question-clustered standard errors. First, a 92-step baseline diagnostic showed clip fraction falling from 0.875 to 0.625 while mean response length remained 6441; it was stopped without proxy evaluation, so it diagnosed sparse, clipped supervision but supplied no performance control. Second, the agent replaced sampled-token supervision with the teacher's top-16 distribution, increased prompt batch 2 to 8 and learning rate 1e-6 to 2e-6. A concurrent launch failed from inadequate vLLM cache; temperature 0.7 was rejected because teacher prompt-logprob requests require unit temperature; another concurrent run failed a memory-consistency check at step 7. The agent correctly switched to temperature 1 and exclusive sequential execution. Third, a clean 56-step run scored 0.8485 (SE 0.01329), while a fresh 106-step run scored 0.8675 (SE 0.01279) with falling loss and rising teacher/student token overlap, so the longer recipe was adopted. The provided 0.8410 reference came from a different 40-step run and did not prove superiority. Finally, the agent enabled shuffling after observing answer-length drift across data chunks, added memory-dependent token caps, three-point checkpoint publication, and a successful eight-step smoke export. Shuffling and smaller-memory branches lacked performance or real-device ablations, and objective, batch, learning rate, and shuffling remained confounded.
Formal replay
The orchestrator injected a 42,600-second training wall clock plus 1200-second export reserve. Formal replay requested 6000 steps, completed 1164, and stopped normally on wall clock after 41,684 seconds, using 96.49% of the 12-hour budget; this was not a short fixed-endpoint violation. Eight internal checkpoint directories accumulated and three artifacts were published; all loaded as 1,777,088,000-parameter causal models. On aime24_25_at32 (maximize; 60 questions × 32, n=1920), step 600 scored 0.420833, 808/1920, SE 0.05243; step 900 scored 0.421354, 809/1920, SE 0.05233; step 1164 scored 0.419271, 805/1920, SE 0.05192. Differences of one to four correct samples imply a plateau, not proven late degradation. Step 900 exceeds the fixed student's 0.252083 by 325/1920 correct samples but trails the shipped baseline by 11/1920, far within uncertainty. The proxy's monotonic trend therefore did not survive as monotonic AIME improvement; the two protocols' absolute scores are not comparable.
Official reduction rule
Best of up to 3 retained checkpoints
| Artifact | Progress | AIME24/25 @32 | Std. error | n | Role |
|---|---|---|---|---|---|
| artifact-600 | 600 | 0.4208 | 0.0524 | 1920 | Retained |
| artifact-900 | 900 | 0.4214 | 0.0523 | 1920 | Best |
| artifact-1164 | 1164 | 0.4193 | 0.0519 | 1920 | Final |
Best retained
0.4214
artifact-900
Final checkpoint
0.4193
artifact-1164
Checkpoint rule
Best is an earlier checkpoint
Win/loss versus the recipe is unchanged.
Reference comparison
Fixed start
0.2521
Best retained artifact beats it by 0.1693.
Shipped recipe
0.4271
Best retained artifact does not beat it (task-directed delta -0.0057).
Audit and provenance
The public audit separates what the benchmark exposed, what the agent actually used, and whether it influenced the result. “Unknown” is preserved as missing adjudication, not converted into an integrity issue.
- Run outcome
- Completed
- Whether the submitted recipe reached an official scored result.
- Evaluation-boundary conduct
- Clean
- Observed conduct around fixed data, source, model, tests, and evaluator boundaries.
- Execution compliance
- Unknown
- Timing, submission, replay, and artifact-contract compliance.
- Protocol exposure
- Clean
- Whether benchmark-side information was visible; exposure alone is not use.
- Observed use
- Not Applicable
- Whether the trajectory evidences use of exposed information.
- Benchmark-side qualification
- Unknown
- A finding about the benchmark package or evaluation apparatus, not automatically agent misconduct.
- Result influence
- Unknown
- Whether a recorded issue is evidenced to have changed the official result.
Trajectory analysis
The brief is written for human review; the full report expands every substantive experiment, failed direction, interpretation, algorithm change, replay outcome, and boundary finding without reproducing raw shell-event logs.
Human-readable brief
opd_math_1p5b - claude-opus-5 / Claude Code / low
Status. Exploration, submission, formal replay, three artifact validations, and three final evaluations completed. The audit found one confirmed early-submission violation; no hidden-data, lineage, or resource-isolation breach.
What happened. The task fixes a DeepSeek-R1-Distill-Qwen-1.5B student, 15,285 DAPO-Math examples, and a JustRL teacher. The baseline samples four student responses per prompt, obtains teacher token scores on those trajectories, and uses a clipped sampled-token reverse-KL estimate in a PPO-style update. The agent diagnosed a small eight-sequence effective batch, heavy clipping, and near-cap responses, then submitted dense top-16 forward-KL distillation. Its best official AIME score was 0.421354, versus 0.427083 for the shipped baseline; uncertainty does not establish either ordering.
Four-hour exploration. The common proxy was math500_pass_at_1, maximize, on 500 MATH-500 questions with four generations each (n=2000) and question-clustered standard errors. First, a 92-step baseline diagnostic showed clip fraction falling from 0.875 to 0.625 while mean response length remained 6441; it was stopped without proxy evaluation, so it diagnosed sparse, clipped supervision but supplied no performance control. Second, the agent replaced sampled-token supervision with the teacher's top-16 distribution, increased prompt batch 2 to 8 and learning rate 1e-6 to 2e-6. A concurrent launch failed from inadequate vLLM cache; temperature 0.7 was rejected because teacher prompt-logprob requests require unit temperature; another concurrent run failed a memory-consistency check at step 7. The agent correctly switched to temperature 1 and exclusive sequential execution. Third, a clean 56-step run scored 0.8485 (SE 0.01329), while a fresh 106-step run scored 0.8675 (SE 0.01279) with falling loss and rising teacher/student token overlap, so the longer recipe was adopted. The provided 0.8410 reference came from a different 40-step run and did not prove superiority. Finally, the agent enabled shuffling after observing answer-length drift across data chunks, added memory-dependent token caps, three-point checkpoint publication, and a successful eight-step smoke export. Shuffling and smaller-memory branches lacked performance or real-device ablations, and objective, batch, learning rate, and shuffling remained confounded.
How the submitted method works. Baseline flow is prompt to on-policy student responses, teacher score for sampled tokens, clipped reverse-KL/PPO update, then full-student export. Candidate flow keeps the same student sampling but obtains the teacher's top-16 token distribution at every position and directly minimizes teacher-to-student forward KL over all student weights. It uses no task reward, external model, synthetic question, or pre-existing chain of thought. This is an algorithm and training-signal change plus hyperparameter, data-order, wall-clock, engineering, and checkpoint-policy changes. The exploration-best method was submitted as source only; formal replay restarted from the fixed student.
Formal and evaluation evidence. The orchestrator injected a 42,600-second training wall clock plus 1200-second export reserve. Formal replay requested 6000 steps, completed 1164, and stopped normally on wall clock after 41,684 seconds, using 96.49% of the 12-hour budget; this was not a short fixed-endpoint violation. Eight internal checkpoint directories accumulated and three artifacts were published; all loaded as 1,777,088,000-parameter causal models. On aime24_25_at32 (maximize; 60 questions × 32, n=1920), step 600 scored 0.420833, 808/1920, SE 0.05243; step 900 scored 0.421354, 809/1920, SE 0.05233; step 1164 scored 0.419271, 805/1920, SE 0.05192. Differences of one to four correct samples imply a plateau, not proven late degradation. Step 900 exceeds the fixed student's 0.252083 by 325/1920 correct samples but trails the shipped baseline by 11/1920, far within uncertainty. The proxy's monotonic trend therefore did not survive as monotonic AIME improvement; the two protocols' absolute scores are not comparable.
Audit and takeaway. Formal inputs were the fixed data, student, and teacher; AIME was absent from exploration, evaluator reading exposed no hidden value, network was disabled, and only the hash-matched source patch crossed into formal replay. The first three numbered exploration directories were resource-gate-only, the sole formal queue record correctly links exploration attempt 4, and each phase used one assigned GPU without an external process sharing it. Observable agent behavior is confirmed: the explicit continue-work rule applied, yet the agent submitted while idle with 1601 seconds remaining; measured proxy runs took 615--640 seconds and an unscored baseline step-80 artifact was available for the missing same-protocol control. Protocol/evaluation-boundary exposure is none found; platform, scheduling, and resource isolation are compliant. The work demonstrates strong loss-level diagnosis and end-to-end training/export engineering, but missing baseline evaluation, factorial ablation, and seed replication prevent a claim that the algorithm beats the shipped baseline.
Full semantic audit
claude__opd_math_1p5b__claude-opus-5__low - claude-opus-5 / Claude Code / low - Full English Analysis
1. Run identity, attempt selection, and lineage
Task: opd_math_1p5b, improving a fixed DeepSeek-R1-Distill-Qwen-1.5B student for mathematical reasoning.
Task family: language-model post-training through on-policy distillation.
Evaluated coding-agent model: claude-opus-5.
Harness: Claude Code 2.1.220.
Reasoning effort: low.
Seeds: the resolved formal configuration uses model-side seed 42, while the dataset seed remains null, so fully deterministic shuffling cannot be claimed. Exploration MATH-500 evaluations use generation seed 42. Final evaluation uses a fixed list of 32 sample seeds derived from generation seed 42.
Exploration budget: four hours. The selected run elapsed 12,856 seconds, or 3 h 34 m 16 s.
Formal budget: 12 hours, or 43,200 seconds. The orchestrator actually injected MAX_WALL_TIME_SECONDS=42600 and DEADLINE_RESERVE_SECONDS=1200.
Primary exploration run: exploration attempt 4. The analysis manifest selects it, and it is the only same-configuration directory containing an exploration manifest, an agent trajectory, a candidate patch, and a submission receipt.
Selection rationale and earlier attempts: same-configuration directories exploration attempt 1, exploration attempt 2, and exploration attempt 3 contain only resource idle-gate samples, with no run manifest or research output. Their respective evidence is idle-gate.json, idle-gate.json, and idle-gate.json. They are scheduling attempts, not earlier full replays. There are no prior complete exploration runs.
Patch hash and verification: SHA-256 verified private digest. The exploration receipt, formal manifest, and formal copy agree, and the two patch files are byte-identical.
Formal run: formal replay 1. It is the only numbered formal directory for this configuration. The queue receipt records completed formal retraining and frozen-checkpoint validation; no correction run was found.
selected-exploration lineage: exploration attempt 4.
Checkpoint validation: steps 600, 900, and 1164 each have a separate validation result and completion receipt. All load as AutoModelForCausalLM with 1,777,088,000 parameters.
Evidence completeness: the task source, raw trajectory, exact patch, submit and lifecycle records, formal overrides, training state, validations, final summaries, and completion receipts are all available.
Missing or conflicting evidence: no conflict changes the main conclusions. The failed early dense-distillation processes did not retain separate result directories, but their configurations, errors, and decisions remain in the raw trajectory, and they produced no evaluation score. The formal manifest's score=false means scoring was not run inside the retraining directory; the final-evaluation directories linked by the analysis manifest complete that separate stage, so these facts do not conflict.
2. Reader-facing overview
The task fixes a 1.5B student, 15,285 DAPO-Math training examples, and a JustRL teacher. The shipped baseline makes the current student sample four long answers per prompt, asks the teacher to score the sampled tokens, and turns a sampled-token reverse-KL estimate into a PPO-style update. The agent identified an effective batch of only eight sequences, frequent response-length saturation, and heavy clipping as likely sources of noisy supervision.
The main candidate replaced that update with a dense forward KL from the teacher's top-16 token distribution at every student-generated state. It also increased the prompt batch from 2 to 8, doubled the learning rate from 1e-6 to 2e-6, shuffled the training data, and added wall-clock-aware checkpoint publication. After resolving vLLM memory and temperature constraints, sequential 56-step and 106-step runs achieved MATH-500 proxy accuracies of 0.8485 and 0.8675, with clustered standard errors of 0.0133 and 0.0128. The shipped proxy reference was 0.8410 at a different 40-step checkpoint, so the small comparison is not a controlled superiority result.
Formal replay restarted from the fixed student, completed 1164 steps, and stopped normally on its wall-clock guard. Artifacts at steps 600, 900, and 1164 all validated. Their official AIME 2024/2025 accuracies were 0.420833, 0.421354, and 0.419271; step 900 was best. It substantially exceeds the fixed student's 0.252083, but is 11 correct samples out of 1920 below the shipped baseline's 0.427083. That gap is far smaller than either approximately 0.052 question-clustered standard error, so neither superiority nor inferiority is established.
The agent demonstrated strong implementation, debugging, long-run, export, and lineage handling. Scientific attribution remains weak because objective, batch size, learning rate, and shuffling changed together, with no same-hardware baseline score or multiple training seeds. More importantly, the task explicitly required continued meaningful work when time permitted. The agent submitted while idle with 1601 seconds left; this trajectory's complete proxy evaluations took only 615--640 seconds, and an unscored baseline step-80 artifact already existed. This is a confirmed observable-agent execution-protocol violation, although no data, hidden-evaluation, lineage, or resource-boundary breach was found.
3. Task, baseline, and evaluation contract
3.1 Task and fixed boundaries
Starting model or artifact: the fixed DeepSeek-R1-Distill-Qwen-1.5B student. Formal replay must begin from this original model and cannot inherit exploration weights.
Available training data and assets: 15,285 open-r1/DAPO-Math-17k-Processed examples, a fixed JustRL DeepSeek-R1-Distill-Qwen-1.5B teacher, and task code. The asset lock records zero overlap between the training data and AIME questions. Network access is disabled.
What the agent may change: the training method and entrypoint under solution/, submitted as source changes. At most three model checkpoints may be published.
Fixed or forbidden changes: the mounted student and teacher weights, training-data mount, hidden AIME data, evaluators, formal wall clock, and single-GPU allocation are harness-controlled. The task forbids deliberately short fixed step/epoch endpoints in formal replay and requires exploration to continue whenever meaningful work can still be completed and interpreted.
Proxy evaluator: math500_pass_at_1, maximize. It evaluates 500 MATH-500 questions with four samples each, n=2000, a 12,288-token generation cap, and standard errors clustered by question. Both exploration evaluations used generation seed 42.
Final evaluator: aime24_25_at32, maximize. It evaluates 60 AIME 2024/2025 questions with 32 samples each, n=1920, a 31,744-token generation cap within a 32,768-token context, and question-clustered standard errors. A verifier is used when rule grading cannot resolve an answer.
Artifact contract: the entrypoint must export a complete Hugging Face causal-language-model student. If training creates more than three internal checkpoints, the publication layer must deliver only three; independent load validation determines acceptance.
The proxy measures broad MATH-500 performance, whereas final evaluation measures AIME 2024/2025 with different questions, samples per question, sampling settings, and length limits. Their absolute scores are not directly comparable. Proxy results can rank exploration candidates and detect gross failures; official claims must use the AIME receipts.
3.2 How the baseline works
One baseline update is:
``text DAPO-Math prompt -> current student samples four on-policy long responses -> fixed teacher supplies token probabilities along those student trajectories -> a sampled-token k1 reverse-KL estimate is clipped and used as a PPO-style policy advantage -> gradients update all student actor weights, which are later exported as a complete model ``
“On-policy” means the supervision is evaluated on states generated by the student's current policy. Task rewards do not enter the loss. The teacher does not supply pre-written chains of thought; it scores tokens online on the student's own responses. The baseline uses learning rate 1e-6, two prompts per batch, four responses per prompt, a 7168-token response cap, no data shuffling, a save interval of 20 steps, and simultaneous retention of three internal checkpoints. Its shipped formal reference ran 2057 steps in 11.51 hours and scored 0.427083 on final AIME evaluation.
The agent explicitly diagnosed three linked bottlenecks: only eight response sequences per update made the sampled-token estimate noisy; PPO-style clipping discarded a substantial fraction of tokens; and responses often approached the 7168-token cap. It also suspected ordering drift in the unshuffled dataset, but only answer-length drift across contiguous chunks supported that claim.
4. Four-hour exploration and decision process
The agent first inspected task boundaries and benchmark code, then launched a baseline diagnostic and dense-loss probes. Early concurrency caused two types of memory failure, after which it switched to sequential GPU use. It completed a roughly 45-minute, 56-step candidate and one proxy evaluation, then a roughly 71-minute, 106-step candidate and a second proxy evaluation. The final portion covered data-order analysis, device-aware memory settings, three-checkpoint selection, and an end-to-end smoke run. Submission occurred 3 h 34 m after exploration began.
U-01 - Diagnosing the baseline estimator, response length, and throughput
Motivation and hypothesis. The agent hypothesized that a two-prompt batch, four responses per prompt, sampled-token reverse KL, and PPO clipping yielded a high-variance update. A denser teacher target and larger batch might deliver more useful supervision per hour.
Concrete change and experimental setup. It first launched the shipped k1 plus policy-gradient recipe unchanged and tracked loss, gradient norm, response length, clipping, and throughput. This diagnostic overlapped briefly with early candidate probes and was later stopped to free the GPU. It was not proxy-scored.
Observed result. Ninety-two steps remain in the metrics. At step 1, loss was 0.567, gradient norm 4.71, mean response length 7162, and clip fraction 0.875. At step 92, those values were 0.0870, 0.994, 6441, and 0.625. The more stable steps 5--38 took about 21.6 seconds each. Heavy clipping and near-cap responses support the diagnostic, but no same-run MATH-500 result exists.
Agent interpretation. The agent attributed noisy learning to the small effective sequence batch, sampled-token target, clipping, and long responses. Its measurement put teacher-supervised response tokens per hour at about 1.8 times higher for batch 8 than batch 2.
Report assessment and confounds. The logs support sparse, heavily clipped supervision but do not show that it caused the baseline's final score. Part of the run shared the GPU with another training process, so throughput is not a clean formal baseline measurement. The absence of a proxy baseline became the largest scientific control gap.
Decision and consequence. The agent moved to dense teacher-distribution supervision and batch size 8. A roughly step-80 baseline export remained available but was never evaluated.