- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes a model of feedback alignment (FA) in continuous time. It is a coupled ODE framework where neural activities and synaptic weights evolve simultaneously, without separating inference and learning into different phases. The authors derive a temporal-overlap law to describe how delays between input activity and feedback error signals affect synaptic updates. Experiments on downsampled MNIST and synthetic classification tasks show that the proposed method can learn with millisecond neural dynamics, while longer delays and slower neural propagation generally reduce learning performance.
Critical strengths
The motivation for studying FA in continuous time is understandable. The proposed framework provides a way to study these timescales within the same dynamical system.
Critical weaknesses
- Although the motivation for introducing a continuous-time formulation is reasonable, I am not fully convinced about its novelty and necessity. What is the main difference between the proposed continuous-time FA and conventional discrete-time FA with explicitly modeled delays? What new insights or properties can be obtained from the continuous-time formulation that cannot be studied using discrete-time models? These questions are not clearly presented in the paper.
- The temporal-overlap law is presented as a main theoretical contribution. Does this law provide any specific insights into the learning dynamics or performance of FA? The experimental results qualitatively agree with the overlap principle, but I do not see a clear quantitative connection between the theoretical results and the actual learning performance.
- The authors compare their method with discrete-time SGD, but a direct comparison with discrete-time FA under similar delay conditions would be more relevant.
- The paper emphasizes biological plausibility, but I think it is important to distinguish temporal realism from biological plausibility more carefully. Introducing continuous neural dynamics and biologically relevant time constants makes the model more realistic in terms of timing, but this does not establish that the learning mechanism is biologically plausible. I think the authors should be more careful in framing and supporting their claims about biological plausibility.
Questions for authors
The proposed method learns the feedback weights through an additional plasticity rule, this is different from discrete FA. Is it necessary to learn the feedback weights? Does this improve learning performance or robustness to delays?
4 comments
CW3. "a direct comparison with discrete-time FA under similar delay conditions would be more relevant."
We agree, and the revised Fig. 8 (Appendix D) makes this comparison, matched sample by sample: the circles networks trained discretely with the same seeds, data order and initial weights, each update mixing the correct and the neighbouring label in the proportion g(Δ) that our analysis derives from the timing. With this mixing, discrete back-propagation loses accuracy with delay just as our continuous-time networks do (it sits slightly above them, by 0.015–0.034), and so does the same rule run discretely (within 0.012 on average). This is what the comparison shows: delay tolerance is set by the pairing fraction g(Δ), not by the learning rule, and a discrete model reproduces it only once it is given g, which comes from the continuous-time analysis. The continuous-time comparison with fixed random feedback is in our answer to Q1.
CW4. "it is important to distinguish temporal realism from biological plausibility more carefully."
We agree and adopt your distinction: the paper tests the temporal realism of an existing rule, not whether FA is how the brain learns. The revised Introduction says so (Section 1).
Q1. "Is it necessary to learn the feedback weights? Does this improve learning performance or robustness to delays?"
Learning the feedback weights is not necessary for learning, and our timing results hold either way. We ran the paper's networks with the feedback weights held fixed at a random start, as in standard FA and DFA (Appendix E.2, Table 3). Both versions learn similarly well (at zero delay 0.93–0.98 on the circles with fixed feedback against 0.91–0.97 with learned feedback, and 0.88 against 0.86 on MNIST) and fall half-way to chance at similar delays; learned feedback started from a random matrix does about as well as or better than fixed feedback on the circles. We study the learned form because it includes the Kolen–Pollack and weight-mirror variants, whose learned feedback aligns with the forward weights and comes close to back-propagation at scale in discrete time (Akrout et al. 2019).
I thank the authors for these answers.
I have a further question about what the authors think about the real role of feedback weights: right now the learned and random feedback weights exhibit same performance, which is non-intuitive to understand.
Thank you for the follow-up. For the question our paper asks, the choice does not matter, and our analysis predicts this: a delay corrupts which label is paired with each input before the feedback weights come into play, so delay tolerance is the same for learned and fixed feedback. Their equal accuracy is also expected. With learned feedback the feedback weights align with the forward weights; with fixed random feedback the forward weights align with the feedback instead, the original feedback-alignment effect. On 7×7 MNIST, the alignment rises from about 0 to 0.84 with learned feedback and to 0.71 with fixed feedback, so the hidden layers receive a useful error either way. Learned feedback also aligns layers further from the output, which matters more for deep networks and large tasks (Akrout et al. 2019) than for ours.
Thank you for the review. We do not propose a better model: we investigate an existing one, feedback alignment, in a regime where inference and plasticity run at the same time and the teaching signal can be late.
A discrete-time model does not capture the finite speed at which information travels: each update pairs an input with its own error at the same instant. The continuous-time formulation includes it, and it shows three things a discrete model cannot:
The law says when FA can learn under timing mismatch, and it predicts how well (new Appendix E.1, Fig. 9):