- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Learnable Truncated BPTT (LT-BPTT), an adaptive temporal partitioning method for training spiking neural networks. Starting from full BPTT, the method generates candidate partitions and evaluates them on shared probe mini-batches using a combination of coordinate-wise gradient standard deviation and segment-level classification loss. The selected partition is used for subsequent training, preserving neuronal states across boundaries while truncating temporal gradients. Segment gradients are accumulated before a single optimizer update per mini-batch. Experiments cover multiple architectures and static and neuromorphic datasets, reporting accuracy improvements and reduced memory requirements relative to full BPTT.
Critical strengths
-
Adaptive temporal partitioning addresses a relevant training trade-off. Jointly adjusting segment numbers and lengths offers more flexibility than a fixed truncation window. Preserving forward states while accumulating segment gradients into one update per mini-batch also makes the training procedure reasonably well controlled.
-
The empirical evaluation spans several architectures and data modalities. Results include MLPs, convolutional networks, and a spiking transformer, with additional evaluations at different simulation lengths and network depths. Table 8 further supports the usefulness of combining gradient dispersion with the classification term rather than using either component alone.
Critical weaknesses
-
The evidence does not sufficiently isolate the benefit of gradient-guided partition selection. LT-BPTT changes both temporal gradient paths and the supervision objective through segment-level losses. Table 8 evaluates the selection-score components, but does not establish how much improvement comes from adaptive search over well-tuned fixed or random partitions using identical segment losses. Table 7’s association between decreasing dispersion and increasing training accuracy may also reflect ordinary training progress. Appendix E appropriately acknowledges that lower dispersion does not guarantee better gradient alignment or accuracy, and its loss bound retains a separate truncation-discrepancy condition. Consequently, stronger controlled evidence is needed to establish the proposed statistic as a useful selection criterion.
-
The reported efficiency results do not clearly establish the cost of the complete adaptive procedure. Table 3 measures controlled fixed-partition configurations on an MLP, while Table 10 does not explicitly account for evaluating multiple candidate partitions on probe mini-batches. Although Appendix C reports GPU timing and energy measurements, it is unclear whether these include the amortized search cost. Without this accounting and the selected partition trajectories, the practical accuracy–efficiency trade-off of adaptive LT-BPTT remains uncertain.
Questions for authors
-
Can you compare LT-BPTT against tuned fixed partitions and random partition selection under identical segment-level supervision and optimizer-update schedules? This would clarify whether gradient-guided adaptation provides benefits beyond segmentation itself.
-
Do the timing and energy measurements include candidate evaluation? Please specify the candidate budget, number of probe mini-batches, acceptance threshold, and monitored parameter set, and report end-to-end epoch time and peak memory including search.
-
Can you report variability across the ten runs for the main accuracy comparisons? Some improvements over the strongest competing method are small, such as 44.39% versus 44.35% on DVS-CIFAR-100, making uncertainty important to the assessment.
Review
Thank you for the detailed response and additional experiments.
My main remaining concern is whether Table 8 isolates the benefit of gradient-guided partition selection. LT-BPTT achieves similar accuracy to the exhaustively tuned fixed-length baseline and higher mean accuracy than random truncation, but the comparison does not clearly specify whether all methods use the same segment-level loss and optimizer update schedule. Clarifying these controls would help determine how much of the observed difference can be attributed to the selection strategy. The end-to-end results also show a substantial search cost on DVS-Gesture-128, where GPU processing time increases from 1.48 to 7.80 seconds per mini-batch after amortizing the search cost. This limits the practical efficiency of LT-BPTT in that setting.
Overall, the revision improves the empirical evaluation, but the central concern about what drives the gains remains, so I maintain my original rating.