Counter-Current Learning: A Biologically Plausible Dual Network Approach for Deep Learning

Despite its widespread use in neural networks, error backpropagation has faced criticism for its lack of biological plausibility, suffering from issues such as the backward locking problem and the weight transport problem. These limitations have motivated researchers to explore more biologically plausible learning algorithms that could potentially shed light on how biological neural systems adapt and learn. Inspired by the counter-current exchange mechanisms observed in biological systems, we propose counter-current learning (CCL), a biologically plausible framework for credit assignment in neural networks. This framework employs a feedforward network to process input data and a feedback network to process targets, with each network enhancing the other through anti-parallel signal propagation. By leveraging the more informative signals from the bottom layer of the feedback network to guide the updates of the top layer of the feedforward network and vice versa, CCL enables the simultaneous transformation of source inputs to target outputs and the dynamic mutual influence of these transformations. Experimental results on MNIST, FashionMNIST, CIFAR10, and CIFAR100 datasets using multi-layer perceptrons and convolutional neural networks demonstrate that CCL achieves comparable performance to other biologically plausible algorithms while offering a more biologically realistic learning mechanism. Furthermore, we showcase the applicability of our approach to an autoencoder task, underscoring its potential for unsupervised representation learning. Our work presents a direction for biologically inspired and plausible learning algorithms, offering an alternative mechanism of learning and adaptation in neural networks.

Paper

References (36)

Scroll for more · 24 remaining

Similar papers

Peer review

Reviewer myCb6/10 · confidence 4/52024-07-03

Summary

Inspired by the counter-current phenomenon observed in nature, the authors propose a counter-current learning (CCL) framework that decouples the input and backpropagation information in different circuits, overcoming many biological implausibility issues of backpropagation learning (BP).

Strengths

I am not an expert in target propagation, but the general idea presented in this work sounds novel and interesting to me. I believe it also offers some insights into nature-inspired learning. I appreciate the constructive figures that help me quickly grasp the core idea of this work.

Weaknesses

- In Table 1, the authors should compare their results with other biologically plausible methods, like forward-forward and deep softhebb, or justify their criteria in model selection. - A minor drawback is the lack of validation in complicated dataset like Imagenet.

Questions

- I am surprised that the performance of BP is worse than the proposed local learning method. Can the authors explain more about this gap? - In forward-forward [1], Hinton proposes a recurrent network architecture that inputs the label at the top layer. This architecture seems similar to what is used in this work. Can the authors elaborate on the differences? reference [1]. Hinton G. The forward-forward algorithm: Some preliminary investigations[J]. arXiv preprint arXiv:2212.13345, 2022.

Rating

6

Confidence

4

Soundness

3

Presentation

3

Contribution

3

Limitations

I think the authors have discussed it well.

Reviewer kHhR4/10 · confidence 4/52024-07-13

Summary

In this paper, the authors propose counter-current learning (CCL), a biologically plausible framework for credit assignment in neural networks.

Strengths

The research direction of having new learning algorithms inspired biologically seems relevant and interesting.

Weaknesses

- The authors discuss biological plausibility as a motivation, but do not discuss thoroughly how the proposed approach is biological plausibility. For instance, update-locking and non-frozen activities should be discussed in detail. - The comparison with the state of the art in the domain is missing: [1] Hinton, G. (2022). The Forward-Forward Algorithm: Some Preliminary Investigations. Technical report. [2] Dellaferrera, G., Kreiman, G., and Kreiman, G. (2022). Error-driven Input Modulation: Solving the Credit Assignment Problem without a Backward Pass. In Chaudhuri, K., Jegelka, S., Song, L., Szepesvari, C., Niu, G., and Sabato, S., editors, Proceedings of the 39th International Conference on Machine Learning, pages 4937–4955. PMLR. [3] Andreas Papachristodoulou, Christos Kyrkou, Stelios Timotheou, and Theocharis Theocharides. Convolutional channel-wise competitive learning for the forward-forward algorithm. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 38, pages 14536–14544, 2024. - The results are sometimes counter intuitive. For example, the results of CCL vs BP for CIFAR100 in Table 3. Why is CCL working considerably better than BP? - The presentation and organization of the paper can be improved. For instance, Figure 2 can be presented at a higher abstraction level as pseudo-code

Questions

1. Could the author discuss the biological plausibility of their approach from weight transport, locality, freezing of neural activity, and update locking points of view? 2. Could the author provide some insight how their approach compares against or relates to the state of the art in the domain: FF, PEPITA, and CFSE? [1] Hinton, G. (2022). The Forward-Forward Algorithm: Some Preliminary Investigations. Technical report. [2] Dellaferrera, G., Kreiman, G., and Kreiman, G. (2022). Error-driven Input Modulation: Solving the Credit Assignment Problem without a Backward Pass. In Chaudhuri, K., Jegelka, S., Song, L., Szepesvari, C., Niu, G., and Sabato, S., editors, Proceedings of the 39th International Conference on Machine Learning, pages 4937–4955. PMLR. [3] Andreas Papachristodoulou, Christos Kyrkou, Stelios Timotheou, and Theocharis Theocharides. Convolutional channel-wise competitive learning for the forward-forward algorithm. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 38, pages 14536–14544, 2024. 3. Why is CCL working considerably better than BP in Table 3 for CIFAR100?

Rating

4

Confidence

4

Soundness

2

Presentation

2

Contribution

2

Limitations

The limitation of the work has been briefly discussed.

Reviewer kHhR2024-08-10

I thank the authors for their response! I have gone through the manuscript and reviews multiple times. About the biological plausibility, I think there are still several very unclear areas. In particular, it is not clear how exactly the training is performed. I have also read the answer to other reviewers' questions, still I have trouble understanding the details and the details are where things become clear (e.g., is the definition of L_feature accurate?). 1. Weight-transport: The authors mention that "The weights for feedback and forward networks are updated independently, mitigating the problem of weight transport by construction." However, from the loss function you define (in Equation 2), is it possible that you end up with W^T (as in BP) for the backward pass? That is, you don't introduce the weight-transport explicitly, but implicitly the optimization is formulated in such a way that it ends up with the solution of BP. (The definition of the L_feature makes me wonder even more.) Also, what does this objective (minimize ||$\hat{a}_l-\hat{b}_l$||) mean really? Why should this optimization happen in the cortex or any biological system? 2. Locality: how do you optimize the loss function (in Equation 2)? It seems the loss function depends on all layers. From Figure 2, it seems that the optimization problem in Equation 2 is solved all together, isn't it? 3. Update locking: the update locking problem is defined in the literature (e.g., PEPITA): "Input signals cannot be processed in an online fashion, but each sample needs to wait for both the forward and backward computations to be completed for the previous sample." Isn't this also the case in CCL? In Figure 1/2 of CCL, it seems that although the forward and feedback passes can be simultaneously run, the first layer's update need to wait for the completion of the backward pass; the last layer's update need to wait for the complete of the forward pass. 4. Freezing of neural activity: I see that the authors acknowledge that CCL requires freezing the neural activity. One might argue that the whole motivation of this work is biological plausibility. If we want to sacrifice biological plausibility in any way, then we use BP, because it has generally the best performance. About the comparison with the state of the art, I remembered a new paper, how does your approach relate to this work: Ororbia, A.G. and Mali, A., 2019, July. Biologically motivated algorithms for propagating local target representations. In Proceedings of the aaai conference on artificial intelligence (Vol. 33, No. 01, pp. 4651-4658). About [GR3], could the author show that this is indeed due to overfitting of the BP or use common techniques to avoid overfitting? I'd appreciate it if the authors could clarify these point in their next response.

Authorsrebuttal2024-08-11

**[Q1] Clarification on biological plausibility** We sincerely thank the reviewer for the valuable time, insightful comments, and the opportunity to address ambiguities. We appreciate the chance to provide more detailed clarifications. **[Q1.1] On weight transport and locality** - **Weight Transport**: We acknowledge the reviewer's concern about implicit weight alignment. In Figure 1.b (in rebuttal material), cosine similarity between the forward layer weights and the corresponding feedback layer weights are computed for the model trained on MNIST using a five-layered MLP architecture. Our analysis reveals a weak alignment between forward and feedback weights, with a maximum cosine similarity of 0.25 after training. This low similarity suggests that our method does not enforce weight transport; instead, even with weak alignment, the models attain good performance. - **Loss Function**: The loss function (minimize ||$\hat{a}_l-\hat{b}_l$||) aims to align neural activities between corresponding layers in the feedforward and feedback pathways. This approach is inspired by local learning principles in neuroscience. It is related to Hebbian learning [1], where synaptic connections are strengthened when neurons on either side of the synapse have correlated activity such that the activity correlation would increase. - **Locality**: Using Figure 1 (Counter-Current Learning subplot) as an example, one local loss function is ||$a_1$-$b_1$||. This means: (i) Function g1 is updated to make $a_1$ closer to $b_1$, and (ii) Function $h_2$ is updated to map $b_2$ closer to $a_1$, (iii) The stop gradient operation ensures locality by preventing ||$a_1$-$b_1$|| from influencing $h_3$, ||$a_2$-$b_2$|| from influencing $g_1$, and ||$Output$-$Target$|| from influencing $g_2$. This gradient detachment mechanism enforces the local nature of the updates. **[Q1.2] Update Locking and Activity Freezing** Our approach halves the time for activity freezing and partially mitigates the update locking problem. To clarify our terminology: - Backward locking problem: This is the term we use in our manuscript. It refers to the issue where the backward process must wait for the forward pass to complete [3, 4]. CCL allows simultaneous forward and backward passes, reducing this waiting time. - Update locking problem: We acknowledge that while our method partially mitigates this issue, complete elimination remains a challenge for algorithms in Feedback Alignment Family, Target Propagation Family, and CCL. We will add more detailed discussions on weight transport, locality, update locking, backward locking, and activity freezing in the next version. **[Q2] Whole motivation of this work is biological plausibility** We appreciate that the reviewer points out the trade-off between biological plausibility and performance. Indeed, biological plausibility is a primary motivation for our work, as it is for a growing body of research in the field, and the pursuit of biologically plausible learning algorithms can serve crucial purposes. Our work, along with other approaches like Feedback Alignment, Target Propagation, PEPITA, and Forward-Forward Algorithm, aims to optimize neural network learning while addressing BP's biological implausibility. While we may not yet match BP's performance in all tasks, the insights gained from this line of research can advance our understanding of both artificial and biological neural networks. **[Q3] More literature review** The key differences between Local Representation Alignment (LRA) work by Ororbia and Mali (2019) and our approach are: - Target generation: The lawyer-wise ideal targets in LRA require using global error signals (see Algorithm 1 in [2]), whereas CCL uses layer-wise comparisons between forward and backward activations. - Backward locking: LRA doesn't resolve this issue; it still requires global error signals, meaning that the LRA backward process only begins after the forward process. CCL addresses it by allowing simultaneous forward and backward passes. We will review Local Representation Alignment (LRA) in our revised manuscript. [1] Hebb, D. O. (1949). The organization of behavior: A neuropsychological theory. Wiley. [2] Ororbia, A.G. and Mali, A. (2019). Biologically motivated algorithms for propagating local target representation, AAAI. [3] Nøkland, A., & Eidnes, L. H. (2019). Training neural networks with local error signals. ICML. [4] Huo, Z., Gu, B., & Huang, H. (2018). Decoupled parallel backpropagation with convergence guarantee. ICML.

Authorsrebuttal2024-08-11

**[Q4] Evidence of BP overfitting** As we cannot add additional plots in this discussion phase, we provide descriptive evidence of overfitting based on our experiments. Validation loss trend: For the BP model trained on CIFAR100 (Figure 1.a in rebuttal material), the validation loss reaches its minimum (cross-entropy loss of 2.23) at epoch 47. It then steadily increases to 2.99 by epoch 94, and settles around 3.01 at the end of training. We observe a growing gap between training and validation loss as training progresses, which is an indicator of overfitting. In our revised manuscript, we will include both training and validation loss plots. Thank you.

Reviewer kHhR2024-08-12

I thank the authors for their response! > Weight Transport: We acknowledge the reviewer's concern about implicit weight alignment. In Figure 1.b (in rebuttal material), cosine similarity between the forward layer weights and the corresponding feedback layer weights are computed for the model trained on MNIST using a five-layered MLP architecture. Our analysis reveals a weak alignment between forward and feedback weights, with a maximum cosine similarity of 0.25 after training. This low similarity suggests that our method does not enforce weight transport; instead, even with weak alignment, the models attain good performance. I think the original issue was the extra biologically implausible assumption/constraint that the weights in the backward pass were the same as the forward pass. Now, while this is not the case here (at least not explicitly), with the objective function, it seems that the extra biologically implausible assumption/constraint is still introduced. One way to go around this issue is to say that this is actually the optimization problem that takes place in the cortex, which we discuss in the following. > Loss Function: The loss function (minimize $||\hat{a}_l -\hat{b}_l ||$) aims to align neural activities between corresponding layers in the feedforward and feedback pathways. This approach is inspired by local learning principles in neuroscience. It is related to Hebbian learning [1], where synaptic connections are strengthened when neurons on either side of the synapse have correlated activity such that the activity correlation would increase. I am familiar with the principle of "fire together, wire together." However, I don't see what is the reason for this cost function to be optimized by the cortex at one single-layer level locally. One could say, why should they fire together at all at one single-layer level? The objective to minimize $||\hat{a}_1 -\hat{b}_1 ||$ does not seem to be relevant at a higher level (e.g., for ultimately reducing the classification loss) for the cortex. > Locality: Using Figure 1 (Counter-Current Learning subplot) as an example, one local loss function is $||\hat{a}_l -\hat{b}_l ||$. This means: (i) ..., and (ii) ..., (iii) ... Do (i), (iii), (iii) happen in order in time? That is, first you do (i), then you do (ii), and finally (iii)? Or they are formulated as one joint optimization problem solved in python? > Update Locking and Activity Freezing: Our approach halves the time for activity freezing and partially mitigates the update locking problem. It seems there is some confusion about weight updates and passes. According to Nøkland2019: "The hidden layer weights cannot be updated before the forward and backward pass has completed. This backward locking prevents parallelization of the weight updates'', and Huo2018 ''Backwards Locking – no module can be updated before all dependent modules have executed in both forwards mode and backwards mode''. In CCL, again, the first layer's update needs to wait for the completion of the backward pass; the last layer's update needs to wait for the completion of the forward pass. On the other hand, the authors mention that "Our approach halves the time for activity freezing". My question is: is that important? and, if so, why? Nøkland, A., & Eidnes, L. H. (2019). Training neural networks with local error signals. ICML. Huo, Z., Gu, B., & Huang, H. (2018). Decoupled parallel backpropagation with convergence guarantee. ICML I'd appreciate it if the authors could clarify these points in their next response.

Authorsrebuttal2024-08-12

We greatly thank your thoughtful review and the opportunity to clarify our work. While we believe CCL is at least as biologically plausible as other algorithms in the Target Propagation family (e.g., DTP, DRL, L-DRL, FW-DTP, LRA) compared to backpropagation, we appreciate this deeper discussion and stricter examination of biological plausibility. **[Q1]  Relevance of local objectives to higher-level cortical functions.** Thank you for this insightful question. We believe that a key contribution of other biologically plausible algorithms (e.g., Target Propagation Family) and CCL is demonstrating that solving local problems can lead to global loss reduction. These algorithms explore how such local computations might collectively contribute to higher-level functions, even without explicit global optimization. We'd welcome further discussion on this point if you have additional insights or concerns. **[Q2] Are local loss functions formulated as one joint optimization problem solved in Python** Yes, the local loss functions are formulated as a joint optimization problem solved simultaneously in our implementation.  **[Q3] Confusion about weight updates and passes.** We appreciate the opportunity to clarify this point. We acknowledge that CCL does not fully mitigate the backward locking problem, as each module still needs to await both forward and feedback passes for updates. However, CCL partially addresses this issue by decoupling the feedback (backward) passes from the forward passes, distinguishing it from backpropagation and algorithms in the feedback alignment and target propagation families. While full mitigation might require layer-wise training methods, CCL represents an intermediate solution between no mitigation and full mitigation of the backward locking problem. We will revise our paper to more accurately state that CCL disrupts the dependency of the feedback/backward pass on the forward pass, rather than fully mitigating the backward locking problem. **[Q4] Importance of halving activity freezing time** By reducing activity freezing time, which is a byproduct of decoupling the feedback from the forward passes, CCL improves upon previous algorithms in feedback alignment and target propagation family and steps closer to how biological neural networks might operate by halving the latency. Moreover, CCL potentially offers computational advantages, particularly in resource-constrained scenarios. For instance, the reduced dependency between forward and feedback passes could open up possibilities for parallelization. We appreciate your critical analysis, which has helped us refine our presentation and clarify the contributions of CCL in the context of biologically plausible learning algorithms. We look forward to incorporating these insights into our revised paper.

Reviewer kHhR2024-08-12

I thank the authors for their response and for bearing with my many questions! I try to summarize what we discussed below about biological plausibility: 1. Weight transport: As the authors mention, "We acknowledge the reviewer's concern about implicit weight alignment." They also provide nice insight that "CCL is demonstrating that solving local problems can lead to global loss reduction." 2. Locality: As the authors mention, "the local loss functions are formulated as a joint optimization problem solved simultaneously in our implementation." Therefore, I am not sure if the locality principle holds. Even if they stop gradient propagation the problem, in my understanding the problem is still not solved (entirely) locally. 3. Update locking: As the authors mention, they address this issue partially: "We acknowledge that while our method partially mitigates this issue..." and "We acknowledge that CCL does not fully mitigate the backward locking problem, as each module still needs to await both forward and feedback passes for updates." 4. Freezing activity: As the authors mention, they address this issue partially: "Our approach halves the time for activity freezing". Biological plausibility is one of the main motivations and in the title of the paper. As such, there is still several unclear areas around the biological plausibility of CCL. Therefore, as much as I think the paper has interesting contributions, my confidence in the biological plausibility of the approach is still low. Therefore, I slightly raise my score, since the discussion with the authors clarified a few points about the results and comparison with the state of the art, while the biological plausibility part remains largely unclear, at least to this reviewer. Once again, I thank the authors for their response and patience.

Authorsrebuttal2024-08-13

We appreciate the reviewer's thoughtful discussion on biological plausibility and concise summary of our exchange. We will incorporate these insights into the next version of the manuscript.

Reviewer ijwx6/10 · confidence 2/52024-07-13

Summary

In this work, the authors proposed the counter-current learning algorithm, a novel algorithm for biologically plausible training of feedforward neural networks. The learning rule is built upon the target-propagation algorithm and its variants. In these algorithms, the backward pathway is typically trained in a way that the target information propagated to each hidden layer provides a layer-wise target that nudges the forward pathway's output toward the true label. Instead, the authors jointly trained both feedforward and feedback weights projected to each layer, in a way that forward and backward pathways exhibit roughly the same activity at each layer. The authors applied this algorithm to various image recognition tasks (MNIST/Fashion-MNIST/CIFAR10/CIFAR100) and an autoencoder task and demonstrated that the proposed algorithm outperforms other variants of target-prop algorithms. The authors empirically analyzed the learning process of the algorithm by examining the development of hidden layer representations and through an ablation study.

Strengths

The proposed learning algorithm is simple yet novel. The key novelty is the training algorithm for the backward pathway, where, unlike previous target-prop algorithms, activity matching between the forward and feedback pathway at each layer is used as the objective. I was positively surprised by the algorithm's strong performance because this learning algorithm clearly deviates from the backprop of the global loss. This training approach also makes the algorithm distinct from previous related approaches where the backward weights were fixed instead (Frenkel et al., Frontiers 2021; Shibuya et al., AAAI 2023).

Weaknesses

The learning rules for hidden weights have trivial solutions, hence susceptible to representation collapse. The authors discussed their techniques for avoiding the collapse briefly in the supplement, but the implementation is not discussed in detail. Biological plausibility of the regularization mechanisms should also be discussed.

Questions

Considering that the algorithm is minimizing the difference between $a_l$ and $b_l$, I expect to see large diagonal components in Figure 6 after learning. However, there is no diagonal trace in the figure. Why is that the case? In addition, at t = 0, $b_1$ to target are already weakly aligned with the input, but $b_0$ is not aligned with the input. What is the origin of initial alignment and the absence of it in $b_0$? On a related point, I wonder if the authors checked whether the stop gradient is implemented correctly, for instance, by calculating the gradients by hand and implementing them manually into the network.

Rating

6

Confidence

2

Soundness

3

Presentation

3

Contribution

3

Limitations

The authors addressed the limitations, especially the lack of theoretical justification, nicely.

Authorsrebuttal2024-08-12

**Response to Reviewer Comments on Theoretical Derivation** We appreciate the reviewer's insightful comments, which have led us to refine our theoretical derivation. Based on their feedback and further consideration, we have revised our approach to better align with the CCL algorithm. **Problem with Previous Derivation** In our previous derivation, we incorrectly represented the relationship between variables. For example, in the term $E_{q(z_1, z_2 | y)} \left[ \log \frac{q(z_2 |y)}{p(z_2 | z_1)} \right]$, the $z_1$ in $p(z_2 | z_1)$ depends on $x$, not $y$. **Key Changes** 1. We now explicitly account for the relationship between $x$ and $y$ in the dataset $D$. 2. We have revised the ELBO derivation to more accurately represent the CCL process. 3. We have introduced an important approximation in the derivation that maintains consistency with the CCL algorithm's implementation. **Updated Derivation** The revised ELBO derivation is as follows: $$E_{(x,y) \sim D} \log p(y|x) \geq E_{(x,y)\sim D, q(z1,z2|y)}[\log (p(y,z_1,z_2|x) / q(z1,z2|y))]$$ $$= E_{(x,y) \sim D, q(z_1,z_2|y)}[\log p(y|z_2,z_1,x)] - E_{(x,y)\sim D, q(z_1, z_2 | y)}[\log \frac{q(z_2 |y)}{p(z_2 | z_1,x)}] - E_{(x,y)\sim D, q(z_1,z_2 | y)}[\log \frac{q(z_1 | z_2, y)}{p(z_1 | x)}] $$ **Term-by-Term Analysis** - The first term can be understood as $E_{(x,y) \sim D, z_1\sim p(\cdot|x), z_2\sim p(\cdot|z_1)} [\log p(y|z_2)]$. This term represents the reconstruction of $y$ given the latent variables $z_1$ and $z_2$ sampled from the forward model, not the inference model. - The first latent alignment term can be rewritten as $E_{(x,y)\sim D, z_1\sim p(\cdot|x)} [KL(q(z_2 |y) | p(z_2 | z_1))]$. This term encourages alignment between the distribution of $z_2$ inferred from $y$ and predicted from $z_1$ (which is sampled from $p(\cdot|x)$, not from $q(z_1|y)$). - Likewise, the second latent alignment term can be rewritten as $E_{(x,y)\sim D, q(z_2 | y)}[KL(q(z_1 | z_2) | p(z_1|x))]$. This term encourages alignment between the distribution of $z_1$ inferred from $z_2$ and predicted from $x$. Consequently, the ELBO is $$E_{(x,y) \sim D, z_1\sim p(\cdot|x), z_2\sim p(\cdot|z_1)} \log p(y|z_2)] - E_{(x,y)\sim D, z_1\sim p(\cdot|x)} [KL(q(z_2 |y)||p(z_2 | z_1))] - E_{(x,y)\sim D, q(z_2 | y)}[KL(q(z_1 | z_2) || p(z_1|x))]$$ **Connection to CCL Implementation** In our practical implementation of CCL, we approximate the last two KL divergence terms using L2 losses between latent features from forward and feedback networks. This approximation captures the essence of aligning the forward and backward pathways while providing a computationally tractable solution. [1] Luo, C. (2022). Understanding diffusion models: A unified perspective. arXiv preprint arXiv:2208.11970. [2] Ho, J., Jain, A., & Abbeel, P. (2020). Denoising diffusion probabilistic models. NeurIPS.

Reviewer ijwx2024-08-13

Thank you for your response. However, I still find the derivation of both the first and second terms of the ELBO to be unclear and problematic. In the term-by-term analysis, the expression $\int dz_1 dz_2 q(z_1, z_2 | y) \log p (y | z_2)$ is replaced with $\int dz_1 dz_2 p(z_1, z_2 | x) \log p (y | z_2)$. These two equations are not equivalent unless $q(z_1, z_2 | y) = p(z_1, z_2 | x)$. Similarly, in the second term, it seems that $q(z_1, z_2 | y)$ has been substituted with $q(z_2 | y) p(z_1 | x)$. If additional approximations or assumptions were made in the derivation, they should be explicitly stated. The explanation in the term-by-term analysis paragraph may aim to clarify the approximation, but it lacks clarity. Additionally, if significant approximations were introduced, I would recommend avoiding the use of the term ELBO to prevent confusion. Although I believe that theoretical justification is not essential for this type of work, my overall confidence in the evaluation has decreased, and I have adjusted my rating accordingly.

Authorsrebuttal2024-08-13

We sincerely appreciate the reviewer's thorough examination of our derivation. We acknowledge that our presentation introduced several approximations that were not explicitly stated. To improve the manuscript, we will: 1. Explicitly state all assumptions and approximations made in the derivation. 2. Remove the term 'ELBO' given the approximations involved, to avoid any misunderstanding. We understand that these issues have affected confidence in our evaluation, and we take these concerns seriously. We thank the reviewer for bringing these important points to our attention.

Reviewer EBaT6/10 · confidence 3/52024-07-15

Summary

In their paper ‘Counter-Current Learning: A Biologically Plausible Dual Network Approach for Deep Learning’ the authors introduce their new ‘counter-current learning (CCL) framework’ which they use to train neural networks of multiple network classes (MLPs, CNNs, Autoencoders) using a learning mechanism which solely relies on local calculation of learning signals, without the need to fully propagate gradients through the network. Through this, authors establish a link the brain’s counter-current exchange mechanism. The authors also show an analysis how feature representations are shaped over the course of learning in their learning framework. Whereas many biologically-plausible learning mechanisms have been proposed throughout the last couple of year, the author’s work particularly stands out due to its generality / easy of being applied to various different network classes used in machine learning.

Strengths

As mentioned in the summary, I think many biologically-plausible learning mechanisms have been proposed throughout the last years and the author’s framework stands out to me due to it apparently generality as it seems to easily be applied to network classes which are, from my point of view, not commonly considered in bio-inspired learning mechanism papers, like autoencoders. This generality could allow for the authors framework to have an impact beyond theoretical neuroscience but also influence the more engineering focused side (e.g. neuromorphic computing). The new learning framework is supported by some additional empirical investigations, giving an intuitive understanding of the learning dynamics within the network.

Weaknesses

While authors mention a potential biological link, not much space is given to discussing specific biological implementations and authors do not seem to make specific predictions which would allow for empirical validation of their proposed mechanism in biology, to validate whether the mechanism is actually utilised in the brain. As such, I see this paper as being more focused on the engineering / computing solutions side, where it does a good job, mentioned above. Given this focus on the computing side, I would have hoped that authors would also consider training a model using a current SOTA architecture (i.e. Transformers or State Space Models) using their technique, to show whether their algorithm can also handle these cases. It would be important to discuss how the proposed work relates to a recent line of work in which two streams of information are assumed to exist in the brain: burstprop (Payeur et al. Nature Neuroscience 2021) and burstCCN (Greedy et al. NeurIPS 2022). Moreover, this work seems to have links with Sacramento et al. 2018 NeurIPS, in that both require specialised feedback neurons that encode the error signals. Both Sacramento et al. and Greedy et al. use an interneuron that learns to match the feedback, which conceptually seems to match the idea proposed by the authors. Perhaps even more relevant is the predictive coding of backprop by the group of Rafal Bogacz, which requires separate error neurons and both the forward and backward phases to align with each other. These should be discussed, and it may be worth making a more explicit link in future work.

Questions

If the authors see their work primarily focused on an engineering solution, I am wondering whether their technique generalises to Transformers and / or State Space Models (like Mamba or Griffin). Otherwise, I wonder whether authors could make specific predictions based on the learning dynamics observed in their model which would allow the community to test for its plausibility using neural data. How does your work relate to the bioplausible works referred to above?

Rating

6

Confidence

3

Soundness

2

Presentation

3

Contribution

2

Limitations

I think authors address limitations on the machine learning / engineering side well but could potentially expand their discussion of limitations with regards to biological evidence for / against their proposed learning framework.

Reviewer sTDo6/10 · confidence 4/52024-07-26

Summary

The article proposes a learning framework that addresses three major critiques of the backpropagation algorithm regarding its biological plausibility: (i) the weight transport problem, i.e., the error feedback weights being the transposes of the feedforward weights, (ii) the nonlocal update problem, i.e., the local weights being dependent on the global error signal, and (iii) the backward locking problem, i.e., the need to freeze layer activations until error feedback information becomes available. The basic idea of the proposed framework is to construct a dual network that operates in the reverse direction to the original inference network. This dual-network has transpose dimensional weights (but not necessarily the transposes of the forward weights), with some similarity to the case of backpropagation. However, this dual network propagates the target value backward. Each layer of the dual network is compared to the corresponding layer (of the same dimension) in the original inference network. The loss is defined as the mean square error between the activations of the corresponding layers. The numerical results demonstrate that the test performance in classification task are on par with backpropagation and the state-of-the-art models.

Strengths

- Novelty: The article offers a novel approach for the biologically plausible learning framework. The use of a dual network to propagate the target value backward and using the mean square error between the corresponding representations of the network as the loss function appears to be a new idea. - Numerical Experiments: The article presents several experiments demonstrating the performance of the proposed approach in comparison to existing methods. The performance appears to be close to that of backpropagation (and even significantly better in the case of CIFAR-10).

Weaknesses

- Analytical Support/Discussion: There is no analytical justification provided for the proposed approach, making it unclear why it should work. This is the main weakness of the article. At the very least, there could be more discussion aimed at providing intuition about the underlying mechanism of the proposed approach that would enable effective training of neural networks. The authors cite "counter-current" mechanisms observed in nature as their primary motivation. - Presentation: The presentation is generally smooth and clear. However, it can be further improved as addressed by the questions below. - Reporting of Numerical Experiments: The results reported for the numerical experiments are confusing, especially as they conflict with those of Shibuya et al. [2023], whose experimental setup is adopted in the current article. - Scalability: It is uncertain whether this idea would work for large-scale inputs/models (e.g., ImageNet 1K/ResNets).

Questions

- How does the proposed approach train the forward neural network to minimize the mean square error (MSE) at the final layer? - It would be useful to report the alignment (angle) between the forward and backward network weights, to check if the weight symmetry problem still exists. - The sentence "Due to random weight initialization, the information content ... decreases ..." in the caption of Figure 1(a) is imprecise. How do you measure information content and relative to what, and why is it decreasing? Furthermore, the next sentence does not really apply to the "before training" (a) part of Figure 1. - Figure 3: Do we see a similar organization of representations in other layers? Since the target label input for each class is fixed, we expect the backward network representations to be a single point for each class in any layer. Do the forward network layer activations appear as clouds around these points? - Section 4.2: MLP Experiments: Why do the models used for comparison employ tanh nonlinearity, while CCL uses ELU? Test results with the same model properties would be more meaningful. - Table 1: Is the DTP in the line below FA correct? As Noakland 16 is cited, is it actually DFA? Shibuya et al. [2023], which the authors claim to base their experiments on, report 52.17% accuracy for DTP/CIFAR10, which is not available or conflicts with Table 1. Similarly, Shibuya et al. [2023] report 51.33% for FA-CIFAR10, but Table 1 in the current article reports FA performance as 45.76%. The FW-DTP performances also do not match. - Figure 4: It would make more sense to compare the conv. kernels of CCL after training with the corresponding kernels of BP, as the initial random kernels shown in this figure are not informative. - Section 4.4: Do we need the CKA-based measure to compare the representations of the forward and backward networks? The proposed approach tries to minimize the mean square error (MSE) between them, so do we expect any linear transformation uncertainty? Isn't it more meaningful to look directly at the angle of alignment or the MSE normalized by the norm-square of the forward representations? - Figure 7 and Section 4.5: The best performance appears to occur toward the top right corner, suggesting that feedforward-feedback learning rates should be similar (symmetric) rather than asymmetric?

Rating

6

Confidence

4

Soundness

2

Presentation

3

Contribution

2

Limitations

The authors sufficiently discuss the limitations of their work at the end of the article. Related points are raised in the weaknesses and questions part.

Reviewer sTDo2024-08-10

I would like to thank the authors for their response. They have largely addressed my comments. I believe the approach presented in this paper has both merit and novelty, with the potential to impact future research on biologically plausible networks. Therefore, I have increased my overall rating.

Authorsrebuttal2024-08-10

Thank you again for your constructive suggestions from the theoretical framework, additional qualitative experiments, discussion, and clarification. We appreciate your time in and we will incorporate them in the future version.

Reviewer myCb2024-08-10

I appreciate the author's response, which addresses my main concerns. I think this is a promising bio-inspired learning method and will be interesting to a broad range of readers.

Authorsrebuttal2024-08-10

We thank the reviewer once again for the constructive suggestion and the oportunity to clarify. We will include more related information in the future version. Have a great day!

Reviewer ijwx2024-08-10

Thank you so much for the revision and detailed responses. I have one comment regarding the new ELBO result. The last equation appears to be incorrect. The final term should be: $$ E_{q(z_1, z_2 | y)} \left[ \log \frac{q(z_1 | z_2)}{p(z_1 | x)} \right] = E_{q(z_2 | y)} \left[ KL (q(z_1 | z_2) || p(z_1|x) ) \right], $$ since the KL divergence is evaluated with respect to $z_1$. Additionally, the middle term, $E_{q(z_1, z_2 | y)} \left[ \log \frac{q(z_2 |y)}{p(z_2 | z_1)} \right]$, doesn’t seem to lend itself to a simple KL-based expression. Please let me know if I’m overlooking something.

Program Chairsdecision2024-09-25

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC