- Rating
- 3
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3(+1)
Read review
Paper summary
The paper studies gradient flow for asymmetric CP factorization of orthogonally diagonal tensors of order , starting from small Gaussian initialization. Its main result describes the limiting dynamics through greedy matching between model atoms and target sectors, with activation times determined by random clocks. For fixed dimensions, convergence is uniform on compact slow-time sets away from accepted activation times. For equal-amplitude sectors, taking the initialization limit before the large-system limit connects the loss to the known Random Edge matching law. The complex modular-addition application further gives explicit training-time asymptotics. The paper also establishes geometric results for real Fourier blocks, while leaving the corresponding gradient-flow cascades conjectural. The results are supported by proofs and numerical illustrations.
Critical strengths
-
The matching description identifies which atom learns which sector and when throughout the activation sequence. Two aspects make this result particularly interesting: surviving atom–sector pairs retain their original clocks after earlier captures, and cancellation of the target contribution suppresses further activation in claimed sectors. These mechanisms explain how ordinary asymmetric CP gradient flow produces the matching process. This explicit account of the full event sequence is the main reason I support acceptance.
-
The complex modular-addition analysis connects the matching description to quantitative training-time predictions. The Random Edge loss law is known, and its distribution-free form applies after transforming time by the clock CDF. The additional contribution is the derivation of the cubic activation-clock tail and the resulting conversion to physical time, including the location and width of the learning window.
Critical weaknesses
Lemma 7 needs a correction in its product-error estimates. Equation (414) bounds the forcing by , but the self-interaction expansion in equation (124) contains terms quadratic in the off-sector residuals. With the main coordinates bounded away from zero, these generally give nonzero contributions of order , which the stated bound does not cover for . Equation (420) also omits the decaying contribution of the initial transverse error; this issue remains for .
This matters because Lemma 7 supplies the accuracy used to restart the induction in Proposition 9. Retaining the quadratic forcing and its transient contribution appears compatible with the logarithmic locking time, so I regard this as a fixable proof issue. However, the corrected estimate should be given explicitly.
Questions for authors
Can you provide a corrected estimate for equations (414)–(420), accounting for the quadratic off-sector forcing and its transient contribution, and show that the same logarithmic locking interval yields product error under the stated hypotheses for every ?
2 comments
Thank you for addressing both points. I checked the revised proof of Lemma 7. Equation (419) now includes the quadratic off-sector forcing, and equation (424) retains the contribution of the initial transverse error. The subsequent choice of logarithmic locking time correctly brings these terms to the required scale, preserving the estimates used in Proposition 9.
This resolves my original soundness concern. I shall update my soundness assessment to 3, and maintain my positive recommendation.
We thank the reviewer for the positive feedback and for identifying two genuine errors in our proof of Lemma 7. We acknowledge both mistakes and have revised the proof accordingly, providing additional details to make the argument easier to verify.
First, the original proof incorrectly used the stronger bound E⊥,σν−1 instead of the correct E⊥,σ2. The weaker bound is nevertheless sufficient: the transverse error decays exponentially, and the equation governing the product error is itself exponentially contracting. Combining these two estimates shows that the resulting contribution to ∣πr,σ−λir∣ becomes O(σν) over our chosen logarithmic locking interval.
Second, we had omitted the contribution of the initial transverse error. We have restored this term explicitly and shown that it also decays to the required O(σν) scale during the locking interval.
Consequently, both corrections preserve the original conclusions of Lemma 7.