- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The goal is to study the learning dynamics of heterosynaptic plasticity, specifically in terms of the stability properties of the associated dynamics. Test case is a form of feedback alignment, with strong emphasis on spatial and temporal locality of synaptic operations as important for the solution, motivated by biological plausibility. The key mathematical insight is the fact that synaptic changes have downstream consequences onto neural activity which, due to the nature of the feedback loops considered in their example, comes back to affect local neural responses and associated further plasticity. Saturating nonlinearities in the neural responses help keep this instability inducing circuit loop in check.
Critical strengths
Analysis of the modes evolution is pretty clear in mathematical terms and somewhat akin to weight stability analyses in other systems, like Oja (but see point 1 in weaknesses)
Figures are clear
The explanation of the instability coming from a degeneracy of scale is intuitive and helpful
The explanations of separation of timescales for the continuous KP was very clear
Critical weaknesses
Although the math is generally clear and relatively easy to follow, the mapping of the operation into a circuit level implementation is not always apparent, for instance it is not clear why it is sensible to assume da ~= A dW etc. it is hard to judge the generality of the results if the dependence on the architecture is obscured in this way. The core assumptions of the perturbative approach need to be spelled out more explicitly
Writing clarity and self-containment: a precise definition of stability materializes very late in the process, the explanation on the properties of KP in the introduction come with too little context to be easily followable on their own. Several papers that this paper builds upon need to be read first for a lot of the details to become understandable.
Although the big picture motivations emphasize the biological plausibility, etc the numerics focus largely on traditional ML considerations. Yet, from a ML algorithmic improvement perspective it is not clear how helpful the insight is in practice since alternative nonbiological approaches for enforcing stability exist already.
The solution being a clipped version of a ReLu instead of using a saturating nonlinearity in the first place seems like a way of creating problems to then fix.
Narrow view of the literature from the perspective of very closely related works like Ziyin 2025, Bancvanski 2025 Limited or incremental new knowledge relative to https://openreview.net/forum?id=kmJuMuHe4j
Questions for authors
Can you please explain the exact neural implementation of the 'local signals' a and b in Eq 1 in an example architecture from the beginning? It would really help with understanding the causal path for perturbation in weights to manifest at the level of a,b By the time the concrete KP architecture is described the main causal paths are lost among the details
Thank you for a careful review. The revision addresses each of your points.
Thank you; the revision opens Section 3 with exactly this. Eq. 1 is the general motif: a synapse changes with the product of two signals present at it, a and b, minus a decay. One can think of them as a forward activity and a backward activity, an error. The motif does not say how the error reaches the synapse; that is set by the topology of the circuit. KP is one example, with a highly structured backward pathway; there are many others, including randomly wired circuits that still learn (Ziyin et al. 2025). In KP, the forward synapse from unit j of layer l to unit i of layer l+1 pairs b = y_{l,j}, the presynaptic activity, with a = z_{l+1,i}, the error carried by the postsynaptic cell (Eq. 10); for the reciprocal feedback synapse the roles swap.
The causal path you ask about: a change in a forward weight changes the activities of the later layers and so the output error, which travels back through the feedback weights and changes the errors that reach this synapse and all others. δa = A[δW] is the first-order part of this change: A is the derivative of the map from weights to settled signals, and B likewise. So the architecture enters only through A and B, which must cover every weight on the loop. The approximation rests on two assumptions, which the revision states at the start of Section 3: the signals have settled, and this map is differentiable. Your question points at the assumption that matters most: with settled signals none of our networks diverged, so the divergence needs signals that take time to travel (Section 5.2, Appendix G.1).
We agree. The revision defines stability at the start of Section 3, gives the introduction's account of KP more context (Section 1), writes out the KP rule and its continuous-time form (Section 4), and adds a worked example on a small circuit (Section 3, Appendix E), so that the paper can be read on its own.
These approaches work well in machine learning, and we make no claim to improve on them; the revision says so in the introduction (Section 1). Our question is what a circuit can do without them: no batch statistics, no optimiser state, and signals that take time to travel, as in the brain or in analog hardware. The new experiments therefore vary circuit quantities: signal speed and the plasticity and decay time constants (Appendices G.1, G.3). These experiments also show why the setting matters: the failure is absent when signals settle instantly, as discrete-time training assumes, and appears as soon as the signals take time to travel.
This is a fair point. Our remedy is to bound the units, and a saturating nonlinearity used from the start is exactly such a bound; the revision makes this clear (Section 5.3). We clipped the ReLU-type units of the continuous-time KP model we build on, so that the bounded network differs from the original in one thing only. Following your comment we tested saturating units: tanh, hard-tanh and the logistic unit all prevent the divergence, and tanh and hard-tanh train better at depth 10 than the clipped unit (MNIST accuracy 0.85 and 0.87, against 0.34). The revision adds these results (Appendix G.4, Table 2).
As you suggest, the revision broadens the related work (Section 2) to network-level analyses of plasticity and stability (Zenke et al. 2013; Toyoizumi et al. 2014; Kozachkov et al. 2020), the analysis of weight mirrors (Kunin et al. 2020) and earlier uses of bounded units (Nøkland 2016; Akrout et al. 2019; Galtier et al. 2012). It also states more clearly what is new. Ziyin et al. (2025) assume that the weights reach a stationary state and state that "a simple decay term is sufficient to ensure stability"; we show that in a circuit the loop gain decides stability, not the decay alone. Bacvanski et al. (2025) study the timing constraints of the continuous-time model but do not analyse its stability. Relative to the linked workshop page, the experiments and analysis of this response are new.