- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper establishes a root-multiplicity principle for finite-width criticality: an correction to the quenched Lyapunov exponent displaces a mean-field root of multiplicity by . It derives an exact mean-field identity showing that smooth saturating odd activations at zero bias have a double root with a universal coefficient, explaining the rather than displacement. For MLPs and regular message-passing networks with uniform input, it obtains an exact two-state Markov reduction, the critical-window law, and an explicit boundary-layer diffusion limit. Registered experiments support the predicted zero- and nonzero-bias scaling, activation-dependent prefactor, bipartite branch, and the ReLU shift.
Critical strengths
- Theorem 2 gives a concise structural explanation for the double root and derives the constants and , rather than merely fitting a width-scaling exponent.
- The exact Markov reduction and the stationary alignment cost jointly explain both the scaling and its leading constant.
- The analysis treats ergodicity, the singular corner , stationary moments, the critical window, and the boundary-layer diffusion instead of relying only on a formal Taylor expansion.
- The paper distinguishes the linearized, mean-field, annealed, finite-depth empirical, and quenched Lyapunov boundaries, preventing several common conceptual confusions.
- The authors report falsified, void, inconclusive, and estimator-dependent results, including conclusions that changed after auditing the first-sign-change estimator.
- Linear controls, float64 checks, exact-chain comparisons, an independent reimplementation, fixed seeds, and explicit reproduction commands address important numerical failure modes.
Critical weaknesses
-
The abstract introduces , , , , , , , and without sufficient definition. Since these quantities encode different notions of gain, criticality, and finite-width scaling, the abstract is difficult to follow without consulting the main text. The authors should define and explicitly, describe and in words, and either define and or omit those subscripts from the abstract.
-
The Introduction provides some motivation--locating the finite-width order/chaos boundary before measuring its geometry--and cites foundational signal-propagation work, so the context is not entirely absent. However, the motivation remains narrow and the closest comparisons are compressed into a few sentences: the Introduction does not clearly explain how the proposed quenched Lyapunov crossing differs from existing finite-width criticality criteria, nor does it connect the result sufficiently to current work on deep-GNN signal propagation, initialization, oversmoothing, and random bifurcations. Much of this positioning appears only in the Discussion or Appendix B, after the principal claims have already been presented. The central research gap and closest distinctions should be moved into the Introduction, leaving the Discussion for implications, limitations, and open problems.
-
Theorem 3 gives a uniform critical-window expansion and locates every sign change that occurs, but the abstract and main text then refer to "the crossing" as an established zero. Turning opposite asymptotic signs into an actual zero requires continuity of the stationary Lyapunov exponent in , including parameter-continuity of the invariant law and suitable uniform integrability; local uniqueness needs additional control. The paper should prove or cite these properties, explicitly bracket a zero, and avoid uniqueness language unless uniqueness is established.
-
The sharp critical-window law requires an MLP or a connected regular graph with node-uniform input. For irregular graphs, the paper states a conjectural quenched bound and presents empirical transfer results that are partly inconclusive or depth-limited. The title and abstract can therefore be read as claiming a general message-passing-network theorem that is not currently proved. The framing should be narrowed to regular message-passing networks with node-uniform states, while irregular-graph findings should be labeled clearly as conjectural or empirical.
-
Proposition 10 conditions on at least one active unit at every layer. For fixed finite , each independent layer dies with probability , so infinite-horizon survival has probability zero. The proof instead appears to use a product process in which every layer is conditioned individually on survival. The authors should define this as a layerwise-conditioned or "immortal" process, derive it as an appropriate finite-horizon conditional limit, or restrict the claim to finite depth before extinction. This issue is localized to the ReLU extension and does not invalidate the central smooth-activation theorem.
-
The paper refers to anonymized code, stored fields, and preregistration files, but these materials were not part of the reviewed PDF. This matters because pooled-field reanalysis changed earlier first-sign-change conclusions, while bipartite fields can remain nearly flat over a broad interval. The supplement should include timestamped preregistrations and amendments, raw per-seed fields, exact pooling and interpolation rules, and scripts reproducing every headline interval. For flat fields, uncertainty should describe the full plausible zero region rather than only the bootstrap variability of a selected first sign change.
Questions for authors
- Can you prove continuity and existence of a zero of in the critical window, rather than only locate any sign change that exists? This is needed to connect the uniform expansion to the headline statement that the crossing lies at the predicted location.
- Is local uniqueness of the non-bipartite crossing established? Finite-depth empirical fields can change sign multiple times, so it is important to distinguish estimator noise from possible non-monotonicity of the stationary exponent.
- How should Proposition 10 be interpreted when infinite-horizon ReLU survival has probability zero? Please clarify whether the theorem concerns an immortal layerwise-conditioned process, a finite-horizon conditional limit, or an ordinary network before extinction.
- Which message-passing claims remain theoretically valid for irregular graphs without assuming the empirically observed cubic reduction? The answer determines whether the graph-level contribution is a theorem, conjecture, or empirical generalization.
- Will the supplementary material expose raw fields and timestamped preregistrations, including all amendments and estimator-audit decisions? These artifacts are necessary to verify the empirical claims whose reported values changed after pooling the fields.
Summary of revisions: what changed and where, and the corrections we made
We thank the three reviewers. The reviews found a real gap in the theory, an overclaim in the scope, and a paper that was hard to read. The revised PDF addresses each.
What to read. Pages 1–10 are self-contained. The new results are Lemma 10 and Corollary 2 (pp. 60–63), Theorem U1 on uniqueness (pp. 64–78) and Propositions G1 and G2 (pp. 89–90). The paper grew from 69 to 125 pages, all of it in the appendix: proofs were split into steps with headings, long formulas were set on their own lines, each main-text result is repeated before its proof, and records were added. None of it is needed to follow the main text.
Corrections not prompted by the reviews. We re-checked the paper with AI review tools and re-ran its commands. The location law, its constant and every registered verdict are unchanged. Appendix N (pp. 124–125) lists every change. In brief: