Summary
This paper proposes a normative principle for the symmetric whitening problem, i.e., a batch optimization problem which is provable to attain symmetric whitening is used to derive an online adaptive algorithm. The proposed framework unifies the previous works, and the resulting algorithm maps into single layer network with interneurons and local learning rules. The mathematical findings of this normative approach is also supported with the evidences from neuroscience. The proposed approached is tested with synthetic data and natural images to demonstrate the performance. Potential improvements for more biologically realistic method is also discussed.
Strengths
The paper provides a neural network solution to the whitening problem which satisfies two important constraints for biological plausibility: i) the network operates in an online manner, and ii) the weight and gain updates are local. The proposed online algorithm is illustrated to obtain whitening with both synthetic and natural datasets.
Weaknesses
The writing is lacking in some parts, and some important details are missing in the paper. More numerical experiments should be presented to assess the introduced framework. For exact details on the weaknesses, please see my comments below and questions section.
* Line 83, "... where $f_c(\mathbf{M}_c) = 2 \mathbf{M}_c$" should be changed to "... where $f_c(\mathbf{M}_c) = \text{Tr}(2 \mathbf{M}_c)$" since $f_c$ is a scalar function of matrices. Moreover, even though it is a simple proof, it would be valuable how this unique minimum is achieved.
* The intermediate step (stated between line 150 and line 153) to obtain Equation (4) should be written explicitly in the paper (can be in the appendix).
* The decoupling the feedforward and feedback weights (in Appendix D.2) is very similar to the idea presented in [i] since the assumption $g_i + m_i \in (0, 2 \eta_w^{-1})$ corresponds to weight decaying. The paper should cite this reference.
[i]J.F. Kolen and J.B. Pollack. Backpropagation without weight transport. In Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN’94), volume 3, pages 1375–1380 vol.3, 1994. doi: 10.1109/ICNN.1994.374486.
* For the experiment with synthetic data, the experiment only considers the whitening matrix of the form $\mathbf{M}_c = \mathbf{I}_N + \mathbf{V} \mathbf{\Lambda}(c)\mathbf{V}^T$. An experiment with more general form of whitening matrix is required to assess the performance of the proposed algorithm.
* Hyperparameters (i.e., $\eta_w, \eta_g, \eta_r$) are not provided in the paper (except that the authors provide $\eta_w$ for Algorithm 2 in Appendix C). It would be beneficial for the paper to include a table that provides the hyperparameters used in each experiment
* The differences and novelties compared to previous works by Pehlevan and Chklovskii [11] and Duong et al. [18] are discussed quite well, but the comparison in the numerical experiments is missing.
* A single Python script is shared for the proposed method, although it does not include the experiment code. The authors mentioned in the paper that the full code would be shared upon publication. However, the current code does not provide a comprehensive understanding of the conducted experiments.
Questions
* The numerical experiments presented in Appendix C uses Algorithm 2, but the biological plausibility of it is questionable due to matrix inversion and batch learning. Did you experiment with this setup using Algorithm 1?
* The authors propose Algorithm 3 as more biologically plausible algorithm compared to the Algorithm 1, by complying to the Dale's law and decoupling the feedforward and feedback weights for asymmetry (weight transport problem). However, no numerical experiment has been demonstrated for this proposal. Did you test this algorithm?
* The value of $\alpha$ seems to be also an hyperparameter for the proposed framework. Did you analyze the effect of this choice?
Rating
6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.
Confidence
4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.
Limitations
I think that the limitations are adequately discussed in the paper.