From e8e2d6684437f1f0e5ce092ed6140be684e1424d Mon Sep 17 00:00:00 2001
From: richard defazio
Date: Sun, 20 Sep 2026 18:44:02 -0400
Subject: [PATCH] Kosson et al. is adjacent, not the same failure, so the
novelty sentence comes down
Role 2 of #674's blind round flagged arXiv:2410.23922 as uncited prior art under
the page's closing claim, "That it prevents this collapse is this page's result".
Both candidate papers were read, not searched.
Kosson et al. 2024 walks the same chain - too large an early step, damage
training does not undo, warm-up prevents it - but in the other direction and in a
different activation. His dead-unit result is an appendix on a small image
network where large updates kill units that were alive, counted at the end of
training, and his remedy is a leaky rectified-linear unit, which works because a
ReLU has an exact zero region to be stuck in. A GELU has none, so that repair is
unavailable here and no layer of this head is dead in his sense, only silent.
This page's head is already silent before the first step, in every replayed fit,
working and collapsed alike.
Lu et al. 2020 turned out to be the closer neighbour and was not on the list.
Born dead means dead before training, their theorem sends a gradient method (Adam
among those they name) to a constant function, and their depth-up / width-down
ordering matches Table 1 in all four comparisons at lr 0.03 - recomputed here as
69 to 90 percent and 46 to 81 percent with depth, 69 to 46 percent and 90 to 81
percent with width. But their theory is ReLU-only and forbids the recovery this
page demonstrates: these fits do train at a lower rate or behind a 200-step ramp.
So the page now cites both, states the difference, and says what is left, which
is narrower than the sentence it replaced. It also names what was searched and
what was not, because this repo has already paid once for a novelty claim that
four web searches failed to check.
Scope held: Related work and two references only. Nothing else on that page - the
ranked list from #674 is Tony's and the census re-run needs his GPU decision. The
data are untouched; only prose moved. The page rebuilds byte-identically on
Python 3.11, 3.13 and 3.14, and the darkroom copy was moved with it.
Co-Authored-By: Claude Opus 5 (1M context)
---
docs/SESSIONS.md | 18 ++++++++
docs/learned/chorus_collapse/index.html | 42 +++++++++++++++----
.../chorus-collapse-verify_2026-09-20.md | 15 +++++++
tools/diagnose_chorus_collapse.py | 42 +++++++++++++++----
4 files changed, 103 insertions(+), 14 deletions(-)
diff --git a/docs/SESSIONS.md b/docs/SESSIONS.md
index ce001488..84c09fc0 100644
--- a/docs/SESSIONS.md
+++ b/docs/SESSIONS.md
@@ -10,6 +10,24 @@ cannot travel (live process ids, that box's free disk, local scratch paths).
---
+### 065/kosson-prior-art — DARKROOM claim RELEASED 2026-09-20: `bugarach/2026-09-19-chorus-collapse/`
+- **Status:** **RELEASED 2026-09-20** with this PR. The write was made and verified: the folder's
+ `index.html` moved from `0dfdc1e5…` to `9083d574…`, matching the repo copy byte for byte. Was:
+ ACTIVE (WSMIP065), claimed before writing. The one literature question left open by the
+ blind round: is Kosson et al. 2024 the failure this page claims as its own? Ruled **adjacent, not
+ the same**; the novelty sentence is withdrawn and both Kosson and Lu et al. 2020 are now cited with
+ the difference stated. The page is therefore **rebuilt**, so the darkroom copy has to move with it.
+- **Writes:** `index.html` in the folder below, replacing the copy the page's own §8 points at.
+ Nothing else in the darkroom, and no JSON changes — the data are untouched, only the prose.
+- **Touches:** this block, `tools/diagnose_chorus_collapse.py` (Related work + two references only),
+ the rebuilt `docs/learned/chorus_collapse/index.html`, and one residual in
+ `docs/reviews/chorus-collapse-verify_2026-09-20.md`. **Nothing else on that page** — the ranked
+ list from #674 is Tony's to rule on and the census re-run needs his GPU decision.
+- **Holds:** the folder below, until this lands.
+- **Simulation only.**
+- **Goal:** learned-model-family (goal 2).
+- **Released when:** the rebuilt page and its verdict are on `main`.
+
### 065/chorus-verify — DARKROOM claim RELEASED 2026-09-20: `bugarach/2026-09-19-chorus-collapse/`
- **Status:** **RELEASED 2026-09-20.** The blind verify round ran, 11 of 11 roles, and escalated
without repairing (blocking 3 → 4 → 6), so **the page and its JSON were never rewritten** — the
diff --git a/docs/learned/chorus_collapse/index.html b/docs/learned/chorus_collapse/index.html
index 0aa79699..14d6fe4e 100644
--- a/docs/learned/chorus_collapse/index.html
+++ b/docs/learned/chorus_collapse/index.html
@@ -243,16 +243,40 @@
5. When it happens, and what prevents it
train each as often as its configuration's fits train, 1.4 of 7. These runs were
judged by training loss, not by calls on held-out recordings.
Scroll sideways to see the whole figure.
Figure 7.A 200-step linear warm-up at lr 0.03 lets most of the collapsed fits tried train. Training loss, the mean of 5 logged steps, for each collapsed fit in Table 3, replayed with the warm-up. Dashed: loss 0.5, the line this page uses between training and not. The highest single logged loss, 4.0, is in an early spike the smoothing shortens.
Table 3. The 200-step linear warm-up at lr 0.03, fit by fit.
Scroll sideways to see the whole table.
fit
encoder
top m
steps
collapsed fits in its configuration (both draws)
final loss
outcome
2736f584, seed 1 (Figure 1's configuration)
4 × 6
4
1,800
33 of 36
0.07
trains
33622c24, seed 0
4 × 6
2
3,600
33 of 36
0.11
trains
4a12a8bb, seed 1
4 × 4
2
900
24 of 36
0.18
trains
5d2026d1, seed 0
8 × 6
8
3,600
28 of 36
0.09
trains
9ad792aa, seed 1
4 × 6
4
900
31 of 36
0.14
trains (the same run as a longer twin's, stopped earlier)
a039a6a7, seed 0
4 × 4
4
1,800
26 of 36
0.11
trains
e86433df, seed 2
8 × 6
2
3,600
31 of 36
1.70
does not train
e87e294e, seed 1
4 × 4
8
900
25 of 36
0.09
trains
Final loss: the mean of the last 5 logged steps, on training batches. A fit trains when that is below 0.5; the collapsed fits sit near 1.5, about what a constant output scores on these batches.
-
Related work. Dead ReLU units, which output zero for every input, have been measured to grow
-with the learning rate (Gulcehre et al. 2022, in offline reinforcement learning), and Sokar et al.
-(2023) call a unit dormant when its mean absolute activation, relative to its layer's, falls below a
-threshold. This page thresholds variation instead, and here every head starts mostly silent, working or not:
-what fails is training's waking it, so these are related observations, not this mechanism. A
+
Related work. The share of dead rectified-linear units (ReLU units, which output zero for
+every input) has been measured to grow with the learning rate (Gulcehre et al. 2022, in offline
+reinforcement learning), and Sokar et al. (2023) call a unit dormant when its mean absolute activation,
+relative to its layer's, falls below a threshold. This page thresholds variation instead, and here every
+head starts mostly silent, working or not: what fails is training's waking it, so these are related
+observations, not this mechanism. A
learning-rate
warm-up is the standard remedy for unstable early training at a large step size (He et al. 2016;
Goyal et al. 2017); why it helps Adam is disputed (Liu et al. 2020; Ma & Yarats 2021), and Ma &
-Yarats's rule of thumb, 2/(1 − 0.999) = 2,000 steps, is ten times the ramp tried here. That it
-prevents this collapse is this page's result.
+Yarats's rule of thumb, 2/(1 − 0.999) = 2,000 steps, is ten times the ramp tried here.
+
+
Two papers describe something close enough that the difference is worth stating.
+Kosson et al. (2024) argue a warm-up works by holding down the size of the early update, and report
+that large initial updates leave a small image network with a high share of permanently dead ReLU
+units and a lasting loss of accuracy — the same chain this page walks, from too large an early step to
+damage training does not undo. It differs in direction and in the activation. There the units are alive
+and the update kills them, counted at the end of training; here 5 to 8 of the head's 8 layers already
+pass nothing that varies at the starting weights, before the first step, in every replayed fit, and
+what separates a collapsed fit from a working one is only whether training wakes them. Their remedy is
+a leaky ReLU, which works because a ReLU has an exact zero region to be stuck in. A GELU has none, so
+that repair is not available here and a layer of this head is never dead in their sense, only silent.
+Lu et al. (2020) come closer: they call a network born dead when it is dead before training,
+prove that a gradient method — Adam among those they name — then optimizes it to a constant function,
+and show the probability rises with depth and falls with width — the order in Table 1, collapse by
+shape, where at lr 0.03 the narrow deep 4 × 6 encoder collapses most and the wide shallow 8 × 4 least,
+and each of the four comparisons runs that way. Their
+theory is ReLU-only, and their result forbids what this page measures: a born-dead network cannot be
+recovered, while these fits do train at a lower rate or behind a 200-step ramp.
+So what is left here is narrower than "a warm-up prevents a collapse", which is published. It is
+that a head can start almost silent in a network with no zero region to be stuck in, that whether
+training wakes it is what decides the fit, and that the failure is recoverable — shown by replaying one
+fit bit for bit and changing one thing at a time. The warm-up, dying-ReLU and dormant-unit literatures
+were searched for this. Whether a learned event detector has been reported collapsing to one call
+covering a whole recording was not.
6. The choice it leaves
@@ -317,8 +341,12 @@
8. Where everything is
Hendrycks D., Gimpel K. (2016). Gaussian error linear units (GELUs). arXiv:1606.08415.
Kingma D. P., Ba J. (2015). Adam: a method for stochastic optimization. ICLR;
arXiv:1412.6980.
+
Kosson A., Messmer B., Jaggi M. (2024). Analyzing & reducing the need for learning rate warmup
+in GPT training. NeurIPS; arXiv:2410.23922.
Liu L. et al. (2020). On the variance of the adaptive learning rate and beyond. ICLR;
arXiv:1908.03265.
+
Lu L., Shin Y., Su Y., Karniadakis G. E. (2020). Dying ReLU and initialization: theory and
+numerical examples. Communications in Computational Physics 28(5); arXiv:1903.06733.
Ma J., Yarats D. (2021). On the adequacy of untuned warmup for adaptive optimization. AAAI;
arXiv:1910.04209.
Sokar G., Agarwal R., Castro P. S., Evci U. (2023). The dormant neuron phenomenon in deep
diff --git a/docs/reviews/chorus-collapse-verify_2026-09-20.md b/docs/reviews/chorus-collapse-verify_2026-09-20.md
index 436edf88..aabff60b 100644
--- a/docs/reviews/chorus-collapse-verify_2026-09-20.md
+++ b/docs/reviews/chorus-collapse-verify_2026-09-20.md
@@ -126,12 +126,27 @@ Two more, outside this claim's scope and named rather than touched:
- **`docs/goals/learned-model-family.md` states 112.6 and 40.4** where this page and the todo state
111.5 and 39.6 (role 3). The page's numbers are the ones the tested builder computes. `docs/goals/`
belongs to #664, so it is flagged here, not edited.
+ **CLOSED 2026-09-20 by #678**, which moved the goal page to 111.5 / 39.6. The estimator the goal
+ page had used pooled each configuration's rate across the two draws and squared it; the product of
+ each draw's own rate is the unbiased one. The reading did not change.
- **Prior art sits under the page's novelty claim** (role 2, verified against the arXiv API here):
Kosson et al. 2024 (arXiv:2410.23922) already reports that large initial updates permanently
deactivate units and that warm-up prevents it. The delta is real — the *form* of the failure here
is a head silent at initialisation that is never woken — but *"That it prevents this collapse is
this page's result"* overstates it as written. Lu et al. (arXiv:1903.06733) predicts the
encoder-shape direction in Table 1.
+ **CLOSED 2026-09-20 — ruled ADJACENT, NOT THE SAME, and the novelty sentence is withdrawn.** Both
+ papers were read, not searched. Kosson's dead-unit result is an appendix on a small image network
+ where large updates **kill units that were alive**, counted at the end of training, and his remedy
+ is a leaky rectified-linear unit — which works because a ReLU has an exact zero region to be stuck
+ in. A GELU has none, so that repair is unavailable here and no layer of this head is dead in his
+ sense, only silent. This page's head is already silent **before the first step**, in every replayed
+ fit, working and collapsed alike. Lu et al. turned out to be the **closer** neighbour: *born dead*
+ is dead-before-training, their theorem sends a gradient method (Adam named) to a constant function,
+ and their depth-up / width-down ordering matches Table 1 in all four comparisons at lr 0.03
+ (recomputed: 69→90% and 46→81% with depth, 69→46% and 90→81% with width). But their theory is
+ ReLU-only and forbids the recovery this page demonstrates. The page now cites both, states the
+ difference, and says what is left — which is narrower than the sentence it replaced.
## What generalises beyond this page
diff --git a/tools/diagnose_chorus_collapse.py b/tools/diagnose_chorus_collapse.py
index 6b017b97..09afe49b 100644
--- a/tools/diagnose_chorus_collapse.py
+++ b/tools/diagnose_chorus_collapse.py
@@ -1347,16 +1347,40 @@ def shape_cell(n, lr, s):
"the warm-up. Dashed: loss 0.5, the line this page uses between training and not. "
f"The highest single logged loss, {spike:.1f}, is in an early spike the smoothing shortens.")
body += t_wu + f"""
-
Related work. Dead ReLU units, which output zero for every input, have been measured to grow
-with the learning rate (Gulcehre et al. 2022, in offline reinforcement learning), and Sokar et al.
-(2023) call a unit dormant when its mean absolute activation, relative to its layer's, falls below a
-threshold. This page thresholds variation instead, and here every head starts mostly silent, working or not:
-what fails is training's waking it, so these are related observations, not this mechanism. A
+
Related work. The share of dead rectified-linear units (ReLU units, which output zero for
+every input) has been measured to grow with the learning rate (Gulcehre et al. 2022, in offline
+reinforcement learning), and Sokar et al. (2023) call a unit dormant when its mean absolute activation,
+relative to its layer's, falls below a threshold. This page thresholds variation instead, and here every
+head starts mostly silent, working or not: what fails is training's waking it, so these are related
+observations, not this mechanism. A
learning-rate
warm-up is the standard remedy for unstable early training at a large step size (He et al. 2016;
Goyal et al. 2017); why it helps Adam is disputed (Liu et al. 2020; Ma & Yarats 2021), and Ma &
-Yarats's rule of thumb, 2/(1 − 0.999) = 2,000 steps, is ten times the ramp tried here. That it
-prevents this collapse is this page's result.
+Yarats's rule of thumb, 2/(1 − 0.999) = 2,000 steps, is ten times the ramp tried here.
+
+
Two papers describe something close enough that the difference is worth stating.
+Kosson et al. (2024) argue a warm-up works by holding down the size of the early update, and report
+that large initial updates leave a small image network with a high share of permanently dead ReLU
+units and a lasting loss of accuracy — the same chain this page walks, from too large an early step to
+damage training does not undo. It differs in direction and in the activation. There the units are alive
+and the update kills them, counted at the end of training; here 5 to 8 of the head's 8 layers already
+pass nothing that varies at the starting weights, before the first step, in every replayed fit, and
+what separates a collapsed fit from a working one is only whether training wakes them. Their remedy is
+a leaky ReLU, which works because a ReLU has an exact zero region to be stuck in. A GELU has none, so
+that repair is not available here and a layer of this head is never dead in their sense, only silent.
+Lu et al. (2020) come closer: they call a network born dead when it is dead before training,
+prove that a gradient method — Adam among those they name — then optimizes it to a constant function,
+and show the probability rises with depth and falls with width — the order in Table 1, collapse by
+shape, where at lr 0.03 the narrow deep 4 × 6 encoder collapses most and the wide shallow 8 × 4 least,
+and each of the four comparisons runs that way. Their
+theory is ReLU-only, and their result forbids what this page measures: a born-dead network cannot be
+recovered, while these fits do train at a lower rate or behind a 200-step ramp.
+So what is left here is narrower than "a warm-up prevents a collapse", which is published. It is
+that a head can start almost silent in a network with no zero region to be stuck in, that whether
+training wakes it is what decides the fit, and that the failure is recoverable — shown by replaying one
+fit bit for bit and changing one thing at a time. The warm-up, dying-ReLU and dormant-unit literatures
+were searched for this. Whether a learned event detector has been reported collapsing to one call
+covering a whole recording was not.
6. The choice it leaves
@@ -1421,8 +1445,12 @@ def shape_cell(n, lr, s):
Hendrycks D., Gimpel K. (2016). Gaussian error linear units (GELUs). arXiv:1606.08415.
Kingma D. P., Ba J. (2015). Adam: a method for stochastic optimization. ICLR;
arXiv:1412.6980.
+
Kosson A., Messmer B., Jaggi M. (2024). Analyzing & reducing the need for learning rate warmup
+in GPT training. NeurIPS; arXiv:2410.23922.
Liu L. et al. (2020). On the variance of the adaptive learning rate and beyond. ICLR;
arXiv:1908.03265.
+
Lu L., Shin Y., Su Y., Karniadakis G. E. (2020). Dying ReLU and initialization: theory and
+numerical examples. Communications in Computational Physics 28(5); arXiv:1903.06733.
Ma J., Yarats D. (2021). On the adequacy of untuned warmup for adaptive optimization. AAAI;
arXiv:1910.04209.
Sokar G., Agarwal R., Castro P. S., Evci U. (2023). The dormant neuron phenomenon in deep