item 32 scored: latent paper net-harmful — TF 20.3 (exposure catastrophe), ST 27.0 (quantization noise), analog 39.1 wins; loop=plan-machine / tokens=executor division final; architecture tree closed

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
This commit is contained in:
Nils
2026-07-18 02:10:02 +02:00
co-authored by Claude Fable 5
parent f0b7942c7a
commit 21b605c13a
7 changed files with 4174 additions and 0 deletions
+24
View File
@@ -1073,3 +1073,27 @@ confound flagged as the one loose thread.
stands as final. Smokes: TF/ST train (loss arithmetic exact,
warm-start vals intact), eval generates with hard snaps.
Job: scripts/jobs/zzz_y_symchain.sh.
--- Outcome, item 32 (scored 2026-07-18 ~06:10). k=0 sanity clean both
arms. BOTH ARMS BELOW REFERENCE — latent paper is net-harmful at this
scale, with both failure modes mapped: (a) sctf (teacher-forced
symbols): lens-CE concentrated to 1.6-2.0 (below item 25's endpoint,
through the zero-init projector alone against a frozen merge) yet
free-running eval = 20.3 (easy .345!) — EXPOSURE CATASTROPHE: a wrong
snap is a hard corruption; a projector trained to trust symbols
propagates it and poisons the analog rail (-18.8 vs ablation). (b)
scst (straight-through self-exposure): lce plateaus 2.8-4.4 (never
fully concentrates under its own snap noise), eval = 27.0 — recovers
7 of TF's 19 lost points exactly as scheduled-sampling theory
predicts, but still -12.1 vs the pure analog 39.1. Conclusion: the
snap's error-correction is real but its error-INJECTION dominates at
2B/10-tick scale — discreteness in the loop costs more than it
corrects; visible tokens win not just by discreteness but by
discreteness + a VERIFIED sampling distribution (the LM head was
trained for token commitment; the lens readout was not). Per the
pre-registered decision rule: the division stands as FINAL —
the loop is a plan machine; tokens are the executor. The latent-paper
widenings (top-k, depth rails, tape) are closed unless a soft-snap
variant (mixture feedback, no hard argmax) is ever pre-registered.
Item 32 closes the architecture tree: pauses, bursts, KV memory,
analog TF chains, and discrete chains all have controlled answers.