- Rating
- 2(−1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
Backpropagation-free learning methods are pivotal for training SNNs on neuromorphic hardware. While most high-performance SNNs rely on surrogate-gradient-based backpropagation, recent black-box zeroth-order optimization approaches, such as Evolving Connectivity, have enabled training recurrent SNNs with binary connectivity without backpropagation. However, optimizing only coarse-grained discrete connectivity reconfigurations fails to fully exploit the computing capacity and adaptability of continuous fine-grained neuronal dynamics. To address this limitation, the paper proposes Directional Credit-guided Forward Optimization (DCFO), a framework that jointly adapts discrete connectivity structures and continuous neuron-specific time constants by reconstructing forward updates from directional credits estimated via zeroth-order evaluations. Evaluations across three continuous-control tasks demonstrate that DCFO outperforms existing backpropagation-free baselines in both task performance and generation efficiency.
Critical strengths
By jointly optimizing coarse-grained discrete connectivity and neuron-specific time constants, the proposed approach goes beyond a simple extension of prior works and effectively applies the unique characteristics of SNNs. Unlike conventional structural optimization methods that merely adapt connectivity, this paper novelly integrates the intrinsic neuronal dynamics of SNNs into the zeroth-order optimization.
The paper presents a principled and convincing framework to effectively apply black-box zeroth-order optimization to SNNs (which is a good research direction), and empirically demonstrates that the method improves both final task performance and efficiency.
Critical weaknesses
While the proposed framework bypasses the memory overhead of BPTT and surrogate gradient dependencies, it trades them for heavy sampling demands (large population sizes; 10240) and high-dimensional matrix solves (Ridge Reconstruction). This trade-off raises concerns regarding scalability to larger networks and makes direct deployment on neuromorphic hardware non-trivial.
The evaluation is restricted to three robot locomotion tasks, which share similar continuous action spaces and physics. The method is not tested on event-based neuromorphic benchmarks or long-range temporal processing tasks where SNNs typically excel.
Questions for authors
How scalable is the population sampling? The method requires a large population size () even for small hidden layers (). As the network scales up, the variance of the zeroth-order credit estimates will drastically increase, necessitating an impractically large population.
Is the ridge solving scalable and neuromorphically implementable? Reconstructing credits requires solving a ridge regression system. As the parameter dimension grows, increasing leads to an computational bottleneck. Furthermore, high-precision matrix decomposition may not be executed natively on neuromorphic cores.
Can DCFO be generalized to temporal sequence learning or event-based classification benchmarks like DVS-Gesture or SHD? The current formulation relies on trajectory-level episode returns, which seems to limit its applicability to continuous control tasks.
Could you also list reference results from backpropagation/surrogate-gradient-based upper bounds (e.g., PPO with PLIF-RSNN), so that readers can contextualize the performance and efficiency trade-off of using backpropagation-free methods?
Could you further justify the biological implications? DCFO's main components like the Ridge solving and forward JVP reconstruction seems to lack biological plausibility. Besides being backprop-free, the method remains purely mathematical rather than biologically grounded.
Why is the title termed ‘structure dynamics’? Terms like ‘connectivity-dynamics co-adaptation’ or 'Co-adapting Connectivity and Neuronal Dynamics' may be less misleading.
2 comments
Thank you for the detailed response and the additional experiments. The SHD and MNIST results and the PPO reference results partially address my questions on generality and on contextualizing backpropagation-free performance. However, the rebuttal has weakened rather than strengthened my original assessment.
- Performance. My positive assessment relied on the claim that joint optimization improves task performance. In the new five-seed results, the gap between full DCFO and structure-only DCFO is within one standard deviation on Walker2d and Hopper, and as Reviewer g1Gu notes, it is not statistically significant even on Humanoid (Welch’s p ≈ 0.10). The central claim of structural–dynamical co-adaptation is therefore not yet supported.
- Efficiency. DCFO reaches the target in fewer generations, but it is slower than EC in wall-clock time on Humanoid and Walker2d (Table 2), while the rebuttal argues for efficiency only in terms of generation counts. The PPO comparison also does not report matched sample budgets, although DCFO evaluates 10,240 episodes per generation.
- Neuromorphic and biological motivation. The response to my scalability question proposes running ridge reconstruction on an external CPU/GPU, which implies that the update step is not performed natively on neuromorphic hardware, while the conclusion still claims suitability for neuromorphic devices. On biological plausibility, the response relies on analogies to reward-modulated plasticity and does not address the ridge solve and JVP reconstruction specifically. Moreover, Appendix B shows that the JVPs are directional derivatives of a constructed quadratic surrogate rather than forward-mode derivatives through the network.
The current manuscript also does not include the new results. Given these points, my original assessment overstated the empirical support for the method, and I am lowering my score to 2.
We thank the reviewer for the constructive feedback. We address the questions below.
Q1: How scalable is the population sampling?
Population sampling remains challenging in reward-driven optimization. DCFO reuses sampled reward feedback for directional credit assignment, while ridge reconstruction accounts for correlated candidates and regularizes updates, enabling more effective utilization of each sampled population.
Q2: Is the ridge solving scalable and neuromorphically implementable?
DCFO supports scalable computation through matrix-free iterative solvers such as CG and LSQR, which approximate ridge solutions using matrix–vector products without explicitly constructing the Gram matrix or performing dense factorization. Randomized preconditioning can further improve solver efficiency [3].
For neuromorphic deployment, DCFO can adopt a hybrid architecture in which neuromorphic cores execute RSNN forward computation, while an external CPU/GPU performs ridge reconstruction.
Q3: Can DCFO be generalized to temporal sequence learning or event-based classification benchmarks like DVS-Gesture or SHD?
We extended DCFO to MNIST and SHD using classification-derived reward feedback, obtaining:
DCFO requires only scalar reward feedback, rather than environment interaction trajectories. These results demonstrate its applicability to visual and event-based temporal classification.
*Q4: Reference results from backpropagation-based methods?
We added PPO baselines using surrogate-gradient LIF-RSNN and ANN policies:
Q5: Could you further justify the biological implications?
Perturbation-driven exploration. DCFO explores the joint adaptation of connectivity structure and neuron-specific membrane time constants through parameter perturbations. Bernoulli connectivity sampling and antithetic perturbations of membrane time constants under the same sampled connectivity enable exploration of structural and neuronal dynamical variations. Changes in membrane time constants affect membrane-potential decay and temporal integration, while task rewards provide learning signals that guide structural–dynamical co-adaptation to task demands.
Reward-modulated learning. The reward-related neuromodulator dopamine can regulate activity-dependent synaptic plasticity [1]. Inspired by this principle, DCFO uses task rewards to evaluate perturbation-induced changes and guide the adaptation of connectivity structure and membrane time constants, without explicitly propagating error signals.
Population coordination and directional credit assignment. Neural population reinforcement experiments show that reward feedback can select and shape coordinated neural activity patterns [2]. DCFO represents coordinated parameter variations as candidate directions. JVPs evaluate how strongly these patterns are supported by reward-conditioned evidence, while ridge reconstruction accounts for their correlations to suppress redundant contributions and guide selective, coordinated parameter adaptation. This reflects the biological learning principle of reward-guided population coordination.
Q6: Why is the title termed ‘structure dynamics’?
We thank the reviewer for this valuable suggestion. Our original motivation was to incorporate learnable intrinsic neuronal dynamics, particularly membrane time constants, into connectivity optimization. We therefore used “Structure Dynamics” to emphasize this extension. We agree that “Connectivity–Neuronal Dynamics Co-Adaptation” more accurately reflects our contribution.
References
[1] Yagishita, S., Hayashi-Takagi, A., Ellis-Davies, G. C. R., Urakubo, H., Ishii, S., & Kasai, H. (2014). A critical time window for dopamine actions on the structural plasticity of dendritic spines. Science, 345(6204), 1616–1620. DOI: 10.1126/science.1255514
[2] Athalye, V. R., Santos, F. J., Carmena, J. M., & Costa, R. M. (2018). Evidence for a neural law of effect. Science, 359(6379), 1024–1029. DOI: 10.1126/science.aao6058
[3] Frangella, Z., Tropp, J. A., & Udell, M. (2023). Randomized Nyström Preconditioning. SIAM Journal on Matrix Analysis and Applications, 44(2), 718–752.