- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper revisits the biological plausibility of backpropagation through the constrained-optimization formulation of recurrent backpropagation (RBP). It introduces dyadic coordinates that encode network states and adjoint signals as weighted averages and differences of two state variables. The authors establish exact equivalence between the original and transformed dynamics, and propose a split surrogate with a second-order approximation error under smoothness assumptions. Experiments examine gradient consistency, CIFAR-10 classification, and image denoising under different connectivity structures.
Critical strengths
- The paper clearly distinguishes gradient computation from the conventional scheduling of forward and backward passes. Representing adjoint signals through differences between paired states provides an informative perspective on the dedicated-error-channel objection to backpropagation.
- The paper connects standard BP, RBP, and dyadic formulations through a common constrained-optimization framework. By showing how predictions and adjoint signals can be represented as weighted averages and differences of paired states, it clarifies the mathematical relationships between these methods and distinguishes exact reparameterization from approximate splitting.
Critical weaknesses
- The incremental contribution over closely related work needs sharper justification. The paper acknowledges that the symmetric dyadic formulation coincides with dyadic equilibrium propagation, and that related splitting procedures already exist. Generalizing the mixing coefficient, constraints, and split parameter updates is meaningful, but the experiments primarily confirm gradient equivalence and comparable task performance. They provide limited evidence that these extensions enable capabilities or implementation benefits unavailable to the closest predecessors.
- The biological interpretation requires a clearer connection to implementation. The coordinate transformation establishes that adjoint information can be encoded through differences between paired states, but it does not establish how those states and their coupled dynamics could be realized by neural or synaptic mechanisms. The unresolved Jacobian-transpose requirement is acknowledged by the authors, yet the claimed comparability to other biologically motivated methods would benefit from an explicit comparison of the required computations and circuit assumptions.
- Limited empirical support for the proposed implementation benefits. The theoretical analysis and gradient comparisons adequately support the distinction between exact reparameterization and approximate splitting. However, the suggested hardware advantages remain largely prospective. Although relaxation iteration counts are reported, the paper does not directly evaluate whether the split formulation reduces computational cost, memory usage, or implementation complexity relative to RBP and the non-split dyadic formulation.
Questions for authors
- The paired-state representation offers an informative perspective on error encoding. How could these states and their coupled dynamics be implemented biologically, and which implementation constraints does this formulation alleviate given the remaining Jacobian-transpose requirement?
- The unified framework usefully clarifies the relationships between BP, RBP, and dyadic methods. What capabilities or implementation benefits do the proposed extensions add beyond the closest predecessors, and can controlled comparisons demonstrate gains in computational cost, memory usage, or convergence?
2 comments
New tables
We would just like to draw reviewer's attention to the new computational cost benchmarks and SOTA results added in general rebuttal.
Response to reviewer JwhD
We thank the reviewer for their comments which encouraged us to sharpen several points in the motivating section of the paper.
W1
When simulated on GPUs RBP, dyadic RBP (with α=0.5 e.g. "dyadic EP"), and split dyadic RBP perform comparably. Changing the topology (skew-sym, sym, asym and feedforward) leads to noticeable differences in performance. The split formulation has the benefit of not requiring evaluating constraints or derivatives at the midpoint, which prior works have highlighted as a potential limitation for neuromorphic hardware. The cost is that the split formulation introduces a β dependent approximation error which we show can be circumvented by setting alpha to 1 or 0. Splitting techniques applied in prior works have either been limited to one specific potential (Scurria et al 2026) or have been presented without derivation (Scurria 2026). The alpha reparametrization offers us a way to avoid evaluating constraints and derivatives at the midpoint without approximation error –a genuine strength of our algorithm– since the edge cases α∈{0,1} give equivalent formulations. Although a performance difference in terms of accuracy is not noticeable we believe the α=1 and α=0 setting are interesting from a neuromorphic computing perspective because the circuit is comparatively simpler than the centered case explored in prior works. It should therefore in principle be more amenable to implementation on physical substrates, where significant benefits in energy efficiency and/or inference/training speed have been theorized, and where the requirement of infinitesimal nudging from previous best prospects (Eqprop) are a barrier in scaling on noisy devices. This is a novelty of our work that may have utility for analog computing and we demonstrate it in our main classification results (final row) and appendix F. We provide more details on our contribution and how we build on prior works in our answer to Reviewer hXnx’s question Q2
W2
This touches on the main message of our paper (See line 53-55 in the introduction and line 479-481) in the conclusion. The motivation for this work was that we noticed that the term “biological plausibility” is used very liberally in the EP and PC literature and that by definitions established in those works BP and RBP are just as plausible as EP and PC. The implication being that the bar for calling something a biologically plausible alternative to backpropagation should be set higher than is typically done in the literature. We propose to introduce a table summarizing the commonly used criteria and indicating which algorithms check which boxes. You find this table in our general rebuttal to all reviewers above.
W3
The benefit of the split formulation is that it avoids the need to evaluate constraints and derivatives at the mid-point. Arguably, the settings$ \alpha=1$ and α=0 where the dyadic RBP and split dyadic RBP formulations are equivalent are the most appealing from a hardware perspective as only one of the two states receive an error perturbation, and as the beta dependence vanishes (weak nudging is problematic in noisy analog hardware). Since submitting the paper we have completed additional experiments with ResNet18 type asymmetric networks achieving SOTA performance in the local learning algorithm literature on CIFAR10 and ImageNet32. For details about runtime and memory requirements please see our answer to Reviewer ihBj’s question Q2.
Q1
The main difference is what type of information a neuron stores. In RBP we store both the activity and the error, whereas in dyadic RBP and split dyadic RBP we store two oppositely perturbed states. Previous work has suggested that such a thing could be accomplished via the integrative function of a cell-body in relation to its apical and basal (dyadic) dendrites. The dual/integrative nature of neurons is a fact of biology. However any effort to tie our formulation precisely to such biology, we believe, would be overly speculative. In the case of symmetric and skew-symmetric connectivity (split) dyadic, RBP can be implemented in two distinct phases with single compartment neurons –resulting in a circuit that only propagates activity (and not errors), though this is hardly “bioplausible.” Please see our rebuttal to ihBj Q1.
Q2
We believe we have addressed this in our previous responses. Please take a look at our responses to reviewer ihBJ, especially Q2, regarding computational cost and memory. As we mention in our general rebuttal, we propose to add a table comparing runtimes, and a general discussion of this matter in the paper body.