Summary
The authors argue that networks trained with feedback alignment can be pre-trained with random input-output pairs. They demonstrate that this allows for faster learning (after the input-output pairs). They also show that the effective dimensionality of the network activity decreases if the pretraining is used, which could explain an improved generalization.
Strengths
The paper provides a simple way to accelerate training with feedback alignment. The results are convincing in terms of faster learning, and I haven't seen a paper using random pre-activations. I think it's a good insight, and it is well presented.
Weaknesses
There is a critical missing point in my opinion.
One is that the authors do not train until convergence, neither for the random pre-training nor for the task related data. I could think that there could be some limitations if the networks are trained for a long time:
- For example, it could be that having a too-low rank during pre-training is bad for learning later on; since the rank is related to the expresiveness of the network this would be plausible (although it might not be the case).
- It could also be that at the end of training a network trained only on data performs better at the cost of more computation (I personally don't think so, but it should be verified). Although I think I can see a performance plateau in Fig. 2 b, it should be put in logscale to see if the performance really saturated or if it can keep increasing. If it is the second, then the authors should see when does it stop increasing and whether random+data really achieves better end-of-training results.
- A related point: I haven't seen the performances in numbers. While I would not care too much for them on the main text, they should be added somewhere just to clarify that the training is done to a reasonable level; if the performance is only up to 90% or something that can be achieved with a logistic regression on MNIST then there would be a problem.
Note that this is not a critical flaw; it's still a good idea to pre-train for faster learning, even if that could potentially lead to slightly lower performances later on (at least where biology is concerned, 92% accuracy or 93% is not really a big deal).
There are also minor issues to correct or comment:
- Line 141: The loss decreased noticeably during random training. Should clarify that they mean the training loss (sorry if it is a bit pedantic)
- Definition 1has a wording problem: the claim is that Wl and Bl are aligned if the expected angle decreases asymptotically during learning. Lets say that we have W^* after learning. If I just happen to have initialized the weights as W* by chance from the beginning, the statement in lines 148 and 149 would tell me that those weights are not aligned (even though they are the same).
A few related works:
- Error backpropagation without weight transport: While it is true that the weight transport is thought to be impossible exaclty it could be achieved by some form of hebbian-like learning, see for example Amit, Y. "Deep learning with asymmetric connections and Hebbian updates." Frontiers in computational neuroscience 13 (2019).
- STDP and backpropagation: Although it is true that STDP is not enough to explain learning, there are simple architectures that can implement learning very similar to Backprop using a rate-based version of STDP (Aceituno et al. "Learning cortical hierarchies with temporal Hebbian updates"). Importantly, that not all the architectures require weight symmetry for training (the paper menitoned has a table listing them)
Finally, I wanted to add a suggestion that I think would improve the paper. But it involves math and I don't know if the authors are up for that, so feel free to ignore it.
I think it should be possible to show that the pretraining would reduce the effective rank. In a "batch" of pre-training with S samples and C classes, backprop would push the activity to become aligned with one of the C output directions. More analytically,:
- the weight updates are Dw = x_pre delta_post, and delta_post is always one of S random vectors.
- But there are only C classes, and thus the deltas within a class should be of a low rank statistically. More specifically
+ Compute the expectation and variance over the Jacobian,
+ for ReLus is the product of feed-forward weights from the current layer onwards, with a probability of 0.5 that a given neuron in the path will drop out of the derivative ).
+ The variance will decrease with increasing S, while the expectation will remain constant.
- Once you have c delta_post, you can be reasonably sure that the result of learning will map the activity of the previous layer into something covering only the span of delta_post.
+ This can be done by taking approximating the averaged BP rule as a delta rule.
I hope is not too unclear
Questions
I don't get what is the task agnostic section supposed to show. If the point is that the network with pre-training is better than the network without pre-training in general, then why introduce concepts such as meta-loss or task-agnostic. It seems to me that is equally valid (and maybe better) to say simply that the random pre-training is great in all tasks (and exemplify by a few).
Limitations
Yes. But
- 314-315: I don't get what the fact that the architecture that they mention does not use weight transport implies that more experimental studies are needed. to confirm their results. What does the lack of weight transport (which is probably true) have to do with more experiments? If they want to "prove" that weight transport is not present in cortex don't worry, no one thinks it's present. Anatomically the apical projections (top-down) are different than the basal ones anyway (bottom-up)