- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposed a geometric analysis of model growth and its persistence under continual learning, measured through functional-Jacobian rank.
Critical strengths
- The paper is clearly written, carefully scoped.
- It reports per-seed values, a stress test on the old-span sampling budget, and a cautionary note about a coarse proxy that produced a spurious collapse.
- The matrix-free JVP pipeline is sound engineering, and the reproducibility and LLM-use statements are thorough.
Critical weaknesses
- The central empirical result is close to guaranteed by construction, and the paper’s own theory predicts it. The measured object is the matrix of K = 36 vectors ∂f/∂α_i \in R^{12.9M}, each equal to the downstream-propagated output of block i. In such a high-dimensional space, 36 nonzero vectors produced by distinct, non-identical blocks are almost surely linearly independent at a relative tolerance of 1e-3. Hard rank drops below K only if a block’s output is exactly zero or two block outputs are almost exactly collinear. Neither is expected from training on any objective, including a “conflicting” one. Theorem 2 already establishes that rank and function are independent, so observing 36 -> 36 while perplexity changes confirms a near-tautology rather than revealing an empirical decoupling. The paper should either identify a training regime in which this rank could plausibly fall, and show it does not, or reframe the result accordingly. E2 (zeroing output projections makes columns exactly zero, so rank drops by exactly that count) is also tautological. It validates the code but gives “transversality has bite” no real support.
- The transversality test is very weak relative to what Theorem 1 requires. Theorem 1 concerns col(J_old), the column space of the full Jacobian over roughly 253M old parameters, whose rank on the probe is likely in the millions. The test projects onto the span of only 64–1024 random old directions. In a 12.9M-dimensional output space, 36 vectors are trivially independent of a ≤1024-dimensional random subspace. Table 4 actually shows the minimum principal angle falling steadily with m (64° → 42.5° at seq = 16), which is consistent with the gate columns being substantially or entirely inside the full old span. The claim that residual = 36 is “invariant to how much of it we sample” extrapolates from m ≤ 1024 to m ~ rank(J_old) ~ 10^6–10^7. As it stands, the evidence for transversality, and so for “genuinely added capacity rather than a re-spanning,” is not convincing. Short probes (e.g., seq = 4–8, small output dimension) where m can approach rank(J_old) would make this test meaningful.
- Statements such as “catastrophic forgetting need not reflect a loss of functional capacity” and “forgetting is capacity reuse rather than loss” do not follow from the measurements. The work this paper contrasts with, the plasticity literature [1], measures representation rank, dormant units, and the ability to learn new tasks, so the paper never directly contests it. A real test would measure plasticity (e.g., the learning speed on a new domain) alongside rank and show where the two diverge.
- The hard rank is reported as “probe-independent,” but this is presumably an empirical statement at τ = 1e-3. Sensitivity to τ (e.g., 1e-2, 1e-4) and the singular-value spectra should be shown, particularly the smallest σ_i/σ_max for the 36 columns.
[1] Shibhansh Dohare, J. Fernando Hernandez-Garcia, Qingfeng Lan, Parash Rahman, A. Rupam Mahmood, and Richard S. Sutton. Loss of plasticity in deep continual learning. Nature, 632, 2024.
Questions for authors
- Do the results change with interleaved rather than appended insertion of new blocks?
2 comments
I sincerely thank the authors for their response, but my main concerns remain. I accept that linear dependence can arise beyond zero or pairwise-collinear columns. However, the rebuttal offer no evidence that the gate-column rank could plausibly fall in any tested regime: no singular-value spectra, no threshold sensitivity, and no control where degradation is possible. On transversality, the authors concede that finite sampling cannot establish independence from the full old-parameter span, and that the minimum principal angle shrinks as more of it is sampled. This undermines the rank-additivity and “genuinely added capacity” claim that frame the paper. With only clarifications promised and no new results, the contribution narrows to the observation that a specific K-column subspace keeps its dimension while the function changes. Overall, I maintain my score.
We thank the reviewer for this interesting question. Our experiments focus on appended insertion, and we have not systematically compared it with interleaved insertion.
Under zero-gate initialization, both strategies preserve the original model function. However, insertion location affects intermediate representations and downstream Jacobian propagation, potentially changing the rank, orientation, and evolution of the gate-Jacobian subspace. Our theoretical framework applies to either strategy, subject to its independence assumptions, but does not guarantee identical empirical behavior. Investigating insertion placement is a valuable direction for future work.
We also address the concerns raised in the weakness section:
We agree that full column rank is often expected for generic vectors in high-dimensional spaces. However, high dimensionality does not guarantee independence, as Jacobian columns are structured derivatives of a shared network, not independently sampled random vectors. Rank deficiency is not restricted to zero or pairwise-collinear columns; linear dependence can arise among multiple nonzero, pairwise non-collinear directions. The number of gates provides an upper bound, not a guarantee of full rank. Theorem 2 establishes the possibility of decoupling between Jacobian rank and retained function value; it does not predict their evolution under particular training trajectories. Our experiments examine this behavior under continual learning, forgetting, and deliberate function degradation.
Theorem 1 explicitly conditions rank additivity on independence from the complete old-parameter Jacobian. Appendix B (Table 4) extends the sampled-direction diagnostic from 64 to 1,024 old-parameter directions. We acknowledge that finite sampling does not establish full transversality, particularly as the minimum principal angle decreases with increasing sampling budget. Our empirical focus is the rank and evolution of a controlled gate-Jacobian subspace, not exhaustive full-model rank expansion. Even if the old Jacobian spans the finite probe-output space, this does not preclude greater global expressivity after growth. We will clarify these distinctions.
We agree that forgetting and loss of plasticity are distinct. However, our three-domain continual-learning experiment (A → B → C) provides behavioral evidence of continued adaptation alongside the Jacobian measurements. Our results show that retained functionality can deteriorate while the measured gate-Jacobian rank remains unchanged, providing empirical evidence that these quantities need not vary together. We do not claim that this establishes preserved learning efficiency or that gate rank predicts plasticity. Systematic adaptation-speed comparisons would be needed to investigate that stronger relationship.
We agree that numerical rank depends on the relative threshold and singular-value conditioning. Our conclusions use the stated tolerance of 1e-3 and the evaluated probe configurations. We will clarify that probe independence is an empirical observation within these settings, not a universal guarantee. Additional threshold sensitivity and normalized singular-value spectra would strengthen this assessment.
Our contribution is to distinguish parameter count, local functional dimensionality, and retained function value, supported by scalable matrix-free JVP/QR diagnostics and empirical analysis of their evolution during continual learning. We believe these results provide a useful framework for distinguishing changes in local functional geometry from changes in retained model behavior.