On-policy mathematical distillation
GPT-5.6 Luna · Codex · high effort
Public case ID: codex__opd_math_1p5b__gpt-5.6-luna__high
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 and candidate share the same flow: fixed prompt - current student samples responses - fixed teacher provides online token targets - k1 reverse-KL advantage drives AdamW policy-gradient updates - full student model is exported. Only AdamW's constant learning rate changes to 2e-6; this is a hyperparameter change, not a new algorithm, training signal, dataset, sampling scheme, schedule, or checkpoint policy. The 399-byte patch matches the exploration best. Formal replay received no exploration weights, caches, synthetic data, pre-generated labels, or pre-existing chain of thought and retrained from the…
Exploration and replay evidence
Four-hour exploration
Every probe started from the fixed student, trained 40 steps, and used math500_pass_at_1 on 500 MATH-500 questions with four generations each (maximize, n=2,000, question-clustered standard error). The unchanged baseline scored 0.8465±0.014001 and 0.8365±0.013971 under generation seeds 42 and 1; these were two samplings of one trained checkpoint, not two training seeds. Supervised top-16 forward KL was stable but scored 0.8385±0.014177, so it was rejected. Adding exact math reward at distillation coefficient 0.5 often produced group-uniform rewards and zero task advantage; 0.8455±0.013961 was effectively baseline, so it was rejected. Replacing k1 with k3 increased clipping and fell to 0.8125±0.014573, a clear rejected counterexample. Doubling learning rate alone scored 0.8615±0.013257 and 0.8680±0.012922, while clipping fell from baseline 0.065/0.074 to 0.037/0.029, so the agent adopted it. A capacity error interrupted the first second-seed baseline evaluation, but the resumed session reran it successfully. The report assesses the learning-rate evidence as useful but limited to one training seed and no long-horizon paired control.
Formal replay
Formal training requested 2,200 steps and completed 2,021 with training seed 42 on one GPU in 41,664.769 seconds (11:34:24.8, 96.45% of the 12-hour budget), stopping through the harness wall-clock rule rather than numerical failure. Internal saves occurred every 20 steps with concurrent retention of three; exactly three final artifacts were published, and all loaded as 1,777,088,000-parameter models. Official aime24_25_at32 maximizes success on 60 hidden AIME 2024+2025 questions with 32 samples each (n=1,920): step 2,000 scored 0.420833 (808 correct, SE 0.052709, 61 clipped), step 2,020 scored 0.421354 (809, SE 0.052489, 48 clipped), and step 2,021 scored 0.424479 (815, SE 0.053177, 55 clipped) and was selected. Point scores rose, but uncertainty overlaps and year-level components are nonmonotonic. The best result is far above the fixed-start reference 0.252083 yet five answers below unmodified OPD; therefore the proxy advantage did not survive as a demonstrated final improvement. Proxy and final scores are not directly comparable because their datasets and protocols differ.
Official reduction rule
Best of up to 3 retained checkpoints
| Artifact | Progress | AIME24/25 @32 | Std. error | n | Role |
|---|---|---|---|---|---|
| artifact-2000 | 2000 | 0.4208 | 0.0527 | 1920 | Retained |
| artifact-2020 | 2020 | 0.4214 | 0.0525 | 1920 | Retained |
| artifact-2021 | 2021 | 0.4245 | 0.0532 | 1920 | Best · final |
Best retained
0.4245
artifact-2021
Final checkpoint
0.4245
artifact-2021
Checkpoint rule
Best is final
Win/loss versus the recipe is unchanged.
Reference comparison
Fixed start
0.2521
Best retained artifact beats it by 0.1724.
Shipped recipe
0.4271
Best retained artifact does not beat it (task-directed delta -0.0026).
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
- Unknown
- 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 - gpt-5.6-luna / Codex CLI 0.146.0 / high
Status. Exploration, source-patch submission, formal retraining, validation of three artifacts, and three official final evaluations all completed with closed lineage; the boundary audit found one confirmed early-submission violation. The only candidate change was constant learning rate 1e-6 to 2e-6; its best final score was 0.424479 (815/1,920), not above the task's same-protocol unmodified-OPD reference of 0.427083 (820/1,920).
What happened. The task fixes a DeepSeek-R1-Distill-Qwen-1.5B student, a teacher, and 15,285 math prompts. The baseline performs on-policy distillation (OPD): the student samples four solutions per prompt, the teacher supplies top-16 token probabilities on those student trajectories, and stopped-gradient k1 reverse-KL values become policy-gradient advantages that update all student weights; task-correctness reward is disabled, so ground-truth answers do not drive training. The agent did not claim one diagnosed root cause, but tested the loss form, sparse reward, KL estimator, and learning rate.
Four-hour exploration. Every probe started from the fixed student, trained 40 steps, and used math500_pass_at_1 on 500 MATH-500 questions with four generations each (maximize, n=2,000, question-clustered standard error). The unchanged baseline scored 0.8465±0.014001 and 0.8365±0.013971 under generation seeds 42 and 1; these were two samplings of one trained checkpoint, not two training seeds. Supervised top-16 forward KL was stable but scored 0.8385±0.014177, so it was rejected. Adding exact math reward at distillation coefficient 0.5 often produced group-uniform rewards and zero task advantage; 0.8455±0.013961 was effectively baseline, so it was rejected. Replacing k1 with k3 increased clipping and fell to 0.8125±0.014573, a clear rejected counterexample. Doubling learning rate alone scored 0.8615±0.013257 and 0.8680±0.012922, while clipping fell from baseline 0.065/0.074 to 0.037/0.029, so the agent adopted it. A capacity error interrupted the first second-seed baseline evaluation, but the resumed session reran it successfully. The report assesses the learning-rate evidence as useful but limited to one training seed and no long-horizon paired control.
How the submitted method works. Baseline and candidate share the same flow: fixed prompt -> current student samples responses -> fixed teacher provides online token targets -> k1 reverse-KL advantage drives AdamW policy-gradient updates -> full student model is exported. Only AdamW's constant learning rate changes to 2e-6; this is a hyperparameter change, not a new algorithm, training signal, dataset, sampling scheme, schedule, or checkpoint policy. The 399-byte patch matches the exploration best. Formal replay received no exploration weights, caches, synthetic data, pre-generated labels, or pre-existing chain of thought and retrained from the fixed start.
Formal and evaluation evidence. Formal training requested 2,200 steps and completed 2,021 with training seed 42 on one GPU in 41,664.769 seconds (11:34:24.8, 96.45% of the 12-hour budget), stopping through the harness wall-clock rule rather than numerical failure. Internal saves occurred every 20 steps with concurrent retention of three; exactly three final artifacts were published, and all loaded as 1,777,088,000-parameter models. Official aime24_25_at32 maximizes success on 60 hidden AIME 2024+2025 questions with 32 samples each (n=1,920): step 2,000 scored 0.420833 (808 correct, SE 0.052709, 61 clipped), step 2,020 scored 0.421354 (809, SE 0.052489, 48 clipped), and step 2,021 scored 0.424479 (815, SE 0.053177, 55 clipped) and was selected. Point scores rose, but uncertainty overlaps and year-level components are nonmonotonic. The best result is far above the fixed-start reference 0.252083 yet five answers below unmodified OPD; therefore the proxy advantage did not survive as a demonstrated final improvement. Proxy and final scores are not directly comparable because their datasets and protocols differ.
Audit and takeaway. Fixed data/models and evaluators were preserved; hidden AIME values were neither exposed to exploration nor reconstructed or used; no external input entered; only the source patch crossed into a fresh formal workspace; and one-GPU isolation, formal wall time, artifact limits, hashes, and receipts were compliant. Denied ChatGPT/GitHub/NVIDIA connections have no attributable agent fetch and returned no data; a stale control status="running" conflicts with terminal fields but completion markers and outcome establish success. Observable agent behavior is confirmed noncompliant because it explicitly submitted with 4,297 seconds left despite a written continue-by-default condition and enough measured time for another meaningful experiment; protocol/evaluation-boundary exposure is none found, and platform/scheduling/resource isolation is compliant. The case demonstrates controlled ablation and sampling replication, but early stopping and one training seed prevent any claim that 2e-6 is optimal or improves final AIME performance.
Full semantic audit
codex__opd_math_1p5b__gpt-5.6-luna__high - Full English Analysis
1. Run identity, attempt selection, and lineage
2. Reader-facing overview
The task was to improve a fixed DeepSeek-R1-Distill-Qwen-1.5B student using a fixed teacher and 15,285 math prompts. The shipped method performs on-policy distillation (OPD): the student samples solutions, the teacher supplies token-probability targets on those student trajectories, and a single-sample reverse-KL estimate becomes the advantage for a policy-gradient update. Task-correctness reward is disabled, so the training answers do not drive the baseline loss.
The agent established a 40-step baseline, then tested supervised forward KL, an added exact-math reward, the k3 distillation estimator, and a doubled learning rate. The first three alternatives did not beat the baseline. Raising the constant learning rate from 1e-6 to 2e-6 produced proxy scores of 0.8615 and 0.8680 under two generation seeds, versus corresponding baseline scores of 0.8465 and 0.8365, with less length clipping. The submitted patch changed only that hyperparameter; it did not change the training signal, data, sampling, or update rule.
Formal replay started fresh and completed 2,021 of 2,200 requested steps in 11 hours 34 minutes, publishing three loadable artifacts. Their official aime24_25_at32 scores were 0.420833, 0.421354, and 0.424479, with step 2,021 selected. The best candidate was far above the task's fixed-start reference of 0.252083 but five correct samples below the task's same-protocol, unmodified full-OPD reference of 0.427083. That difference is much smaller than the uncertainty, so the short-proxy learning-rate advantage did not become a demonstrated final improvement.
The trajectory shows useful controlled ablation and proxy replication, but it has a confirmed execution-protocol violation. The agent explicitly submitted with 4,297 seconds remaining even though the task required continued work whenever another meaningful, interpretable experiment could fit, and the measured probe timings showed that one could. This limits research completeness without invalidating the patch lineage, formal artifacts, or numerical final results.
3. Task, baseline, and evaluation contract
3.1 Task and fixed boundaries
``text Starting model or artifact: task-pinned deepseek-ai/DeepSeek-R1-Distill-Qwen-1.5B snapshot Available training data and assets: 15,285-row zero-overlap projection of DAPO-Math-17k; fixed hbx/JustRL-DeepSeek-1.5B teacher; MATH-500 visible during exploration Agent-modifiable content: the training launcher and implementation under solution/, plus diagnostic checkpoints during exploration Fixed or prohibited content: student and teacher snapshots, training data, evaluators, hidden final AIME data, one-GPU and wall-clock limits; formal replay accepts source patch only, not exploration weights or caches Proxy evaluator: math500_pass_at_1, maximize; 500 MATH-500 questions x 4 samples, n=2,000; question-clustered standard error Final evaluator: aime24_25_at32, maximize; 60 AIME 2024+2025 questions x 32 samples, n=1,920; question-clustered standard error Artifact contract: publish at most three valid formal artifacts and select the valid artifact with the highest official final score; an official score requires both summary.json and .complete ``
The proxy uses temperature 0.7, top_p=0.9, and at most 12,288 new tokens to measure per-sample solve rate on MATH-500. The final evaluator uses different hidden questions, 32 samples per question, and at most 31,744 new tokens; it applies a rule grader first and CompassVerifier as fallback. Both measure math-answer success, but the question sets, replication counts, and length limits differ, so their numerical scores are not directly comparable.
3.2 How the baseline works
On-policy distillation means that the teacher does not provide a fixed solution corpus; instead, it supplies probability targets on trajectories freshly sampled from the current student:
``text Math prompt from the fixed training set -> student samples 4 responses at temperature 1, each capped at 7,168 tokens -> teacher supplies top-16 token probabilities on the student-sampled tokens; task reward is disabled -> stopped-gradient k1 single-sample reverse-KL distillation values become advantages for vanilla policy gradient -> AdamW updates all student actor weights at constant learning rate 1e-6 and exports a Hugging Face model ``
Data are not shuffled. Each step processes two prompts and therefore eight sampled responses; AdamW uses weight decay 0.01 and no warmup. The launcher requests 2,200 steps and sets an effectively overlong epoch count so the formal wall clock controls termination. It saves every 20 steps and retains three actor checkpoints concurrently. Although each training row contains a ground-truth answer, USE_TASK_REWARDS=False prevents it from contributing to the update.
The agent did not state one definitive root-cause diagnosis at the outset. It observed high startup cost, a steady-state rate of roughly 20–23 seconds per step, finite losses, and noisy response-length clipping, then treated the loss form, sparse task reward, KL estimator, and learning rate as separate testable levers.
4. Four-hour exploration and decision process
The agent first inspected the task and training flow and established a 40-step baseline. It then ran three objective/estimator alternatives and one learning-rate alternative, followed by second-generation-seed evaluations of the baseline and leading candidate, patch checks, artifact checks, and process checks. A service-capacity error interrupted the first attempt at the second baseline evaluation; the same session resumed and reran it successfully. Exploration used about 2 hours 49 minutes before explicit submission.
All units below use one proxy contract: 500 MATH-500 questions with four generations each, math500_pass_at_1 maximized over n=2,000, with question-clustered standard error. Every training probe starts from the fixed student and runs for 40 steps.
U-01 - Establish the short-run baseline and measurable bottlenecks
Motivation and hypothesis. The agent needed a short-run capability, speed, and stability reference before judging method changes.
Concrete change and experimental setup. It made no change to the shipped recipe, trained for 40 steps with training seed 42, and evaluated the same checkpoint with proxy-generation seeds 42 and 1.
Observed result. Seed 42 scored 0.8465, or 1,693/2,000, with standard error 0.014001, clipping rate 0.065, and 606.8 seconds of evaluation time. Seed 1 scored 0.8365, or 1,673/2,000, with standard error 0.013971, clipping rate 0.074, and 603.4 seconds. The checkpoint loaded and training losses were finite. The task also supplies an independently generated, same-proxy step-40 reference of 0.8410±0.0138 with clipping 0.0645, consistent with this control. The first launch of the seed-1 evaluation failed on model-service capacity and produced no receipt; only the successful rerun is evidence.
Agent interpretation. It treated 0.8465 as the principal short-run control and noted that startup cost, generation clipping, and sampling noise could conceal small method effects. It did not claim a unique diagnosed cause.
Report assessment and confounders. These are two generation samplings of one trained checkpoint, not independent training seeds. They assess sampling robustness but not training variance. The capacity failure was recovered infrastructure interference, not a scientific negative result.
Decision and impact. The recipe became the control for every subsequent 40-step ablation, and the agent sought a candidate whose direction repeated under the second proxy-generation seed.