- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper addresses learning in constrained environments for spiking classifiers whose synapses are programmable devices with limited range and write endurance. It builds on integer SNN training (I-LIF, full-integer online SNN training) and integer-only network training (NITRO-D). The proposed rule, TC-CRP, trains a single linear readout on integer time-to-first-spike (TTFS) latencies. It turns class-discriminative, perceptron-like votes into paired ±1 integer weight transfers that keep each row zero-sum and respect a weight bound and a cumulative write budget. Three priority signals are compared: the current vote (A), accumulated demand (CUM), and accumulated demand minus committed writes (H2, akin to error feedback). Feasibility and conditional per-row optimality are proven. At equal write counts, ranked selection clearly beats a random-coordinate control on MNIST and Fashion-MNIST. Memory gives higher mean accuracy than A on MNIST, Fashion-MNIST, N-MNIST and DVS128 Gesture, but the gain is statistically clear only on N-MNIST.
Critical strengths
S1 - The authors propose a clear and well-formalised method. The abstract and introduction give an efficient overview of the problem and the method. Sec. 3.2 defines the algorithm compactly and without ambiguity, including ties, the activity gate, pair dropping, budget truncation and resumption. The contribution is simple but interesting, and it is easy to understand and re-implement.
S2 - The theoretical analysis is well-formulated and appreciated. Props. 1–3 are stated with explicit conditions. App. A gives counterexamples showing exactly when Prop. 2 stops holding. This makes the guarantees of the rule transparent.
Critical weaknesses
W1 - The authors provide only experimental and theoretical evidences on very simple architecture, with no evidence of scaling. All experiments use a single linear layer on first-spike latencies, and absolute accuracies are low: 88.1–88.9% on MNIST, 76.2–79.3% on Fashion-MNIST, and about 16–17% on CIFAR-10 (App. E.2). Nothing indicates how the rule (votes, row-wise ranking, memory) would extend to multi-layer networks. It is therefore hard to judge how the method would perform in realistic scenarios.
W2 - The comparison framework proposed by the authors is limited. The write-matched comparisons are only internal (A/CUM/H2) or against RAND. RAND is a uniform random control designed after A's results were known (Sec. 5.3), and it performs at chance level (11.6% and 9.6%). The external references are a zero-sum floating-point linear model and a multiclass perceptron (Sec. 5.7, App. F), plus H1 (App. E.5). They are not write-matched, and they all outperform TC-CRP. For example, the perceptron reaches 90.45/84.26% best validation accuracy against 88.66/81.35% for H2. There is no comparison under the same write budget with learning rules from the neuromorphic and in-memory computing literature that also limit device writes. Examples are sign-based fixed-step (Manhattan rule) updates for memristive crossbars, and mixed-precision training that accumulates updates in a high-precision variable and programs the device only when a threshold is crossed (Nandakumar et al., 2020), which is close in spirit to CUM/H2. There is also no comparison with TTFS-based SNN learning rules such as S4NN or the cited EventProp.
S. R. Nandakumar, M. Le Gallo, C. Piveteau, V. Joshi, G. Mariani, I. Boybat, G. Karunaratne, R. Khaddam-Aljameh, U. Egger, A. Petropoulos, T. Antonakopoulos, B. Rajendran, A. Sebastian, E. Eleftheriou. “Mixed-precision deep learning based on computational memory.” Frontiers in Neuroscience 14:406, 2020. doi:10.3389/fnins.2020.00406
Questions for authors
Q1 - What motivates the row-conservation (zero-sum) requirement from the hardware side? The introduction mainly gives invariance to a common latency shift, and Sec. 6 calls signed row balance "a modelling choice". How would accuracy and write cost change with unpaired ±1 writes?
Q2 - How were J = 3,187,200, 6,374,400 and 12,748,800 chosen? They appear to correspond to 3, 6 and 12 epochs of maximum write capacity (cf. App. E.6). Why use B_w = 10^9 in the main experiments? Since max|W| ≤ 5467 (Table 9), the bound is never active in the headline results.
Q3 - CUM and H2 store a C×d int64 memory, the same size as W but at higher precision. How large is this overhead in storage and compute (cf. Table 6 for time), and is it compatible with the on-device setting that motivates the work?
Q4 - Do you see a path to multi-layer networks, and do you have preliminary results?
Q5 - What does "TC-CRP" stand for? The acronym is not expanded anywhere in the paper or the appendix.
7 comments
Continuing our response to Reviewer fNW4 (Part 2/2: Q1-Q3, Q5 & Ethics).
Q1. Motivation for Zero-Sum Rows & Unpaired Ablation (Appendix J)
Hardware limits alone do not require zero row sums: signed row balance is a modeling choice providing exact invariance to common latency shifts. To test when it helps, we compare A against an unpaired rule (Unpaired-topabs) at equal total writes, trading two writes per pair for one write per unpaired step:
| Setting (Budget) | Conserved Pair A (%) | Unpaired +/-1 (%) | +/-128 Shift Flips (A / Unpaired) |
|---|---|---|---|
Fashion-MNIST raw latency (750k) | 72.75 | 38.97 | 0.00% / 33.09% & 25.62% |
N-MNIST raw latency (750k) | 78.33 | 17.30 | 0.00% / 77.88% & 25.08% |
Frozen CIFAR10-DVS CNN (250k) | 69.92 | 68.72 | N/A |
The tested paired rule substantially outperforms Unpaired-topabs on these raw-latency inputs and is comparable to unpaired writes on learned non-negative CNN features; at 500k writes on CNN features, unpaired reaches 71.22% vs. 70.84% for A. Across physical -10 to +10 ms window shifts on 10,000 raw N-MNIST streams, three threshold baselines vary by at most 0.13 pp, while centering Threshold-single cuts +10 ms prediction flips from 1.116% to 0.852% at a 3.82 pp accuracy cost (62.47% vs. 66.29%).
Q2. Origin of Budgets and vs. Active Bounds (Appendix E.3 & Table 23)
- Why
{3,187,200; 6,374,400; 12,748,800}: Your reading is exact. With 53,100 training samples at batch size 128 (415batches per pass), one full-capacity pass allows up to 1,062,400 writes, so our budgets equal 3x, 6x, and 12x this pass capacity rather than standard epochs, since inactive rows skip writes. - Wide vs. active bounds: Setting isolates update ranking from saturation. We also tested active bounds in 54 TC-CRP runs across (all reaching with zero row sums) and in our new runs. At on MNIST,
A,CUM, andH2reach 85.56%, 86.44%, and 86.39% despite 45.1%-90.7% pair rejections, and at ,H2keeps 76.53% on Fashion-MNIST and 83.99% on N-MNIST.
Q3. Memory, Speed, Write Savings & Hardware Fit (Appendix L)
- Footprint & compute: Alongside
int32weights,CUMandH2keep anint64history tensor twice as large in bytes (61.25 KiBon images;184,960 Bon N-MNIST),Arequires no persistent history tensor, and all variants discard histories at inference. Core training times on our i7-13620H/RTX 4050 system are 14.141-15.912 s on MNIST and Fashion-MNIST and 20.090-24.084 s on N-MNIST. - Why this controller RAM pays off:
Aavoids this additional history-storage requirement. In exchange for modest controller RAM andint64state writes,CUMandH2cut committed weight writes needed for target accuracy by 87.5% on Fashion-MNIST (75% target) and 50% on N-MNIST (80% target), and cut direction reversals at 750k writes from 40.94%-56.18% underAdown to 0.41%-1.37%, though N-MNIST top-1% write share rises from 5.04% to 7.56%-7.59%. Against integer S4NN on Fashion-MNIST at 241k writes,H2reduces 32B block writebacks from 6.515 MB to 2.359 MB, state writes from 3.30B to 1.00M, and 60s host energy from 108.38 to 16.24 J/run, measured via CMOS host telemetry rather than chip physics.
Q5 & Details Of Ethics Concerns
- TC-CRP stands for Task-driven Competition for Constrained Redistribution of Parameters.
- English README & provenance: Thank you for flagging the Chinese README. We replaced
supplement/README.mdwith a concise English index covering protocols, results, data sources, verification checks, and hardware details, while noting reused official splits under frozen protocols.
We hope these multi-layer controls, write-matched comparisons against Manhattan, threshold accumulation, and S4NN, overhead analyses, and clarified scope boundaries resolve your concerns.
We have revised the main text to clarify the method, strengthen its empirical support, and better define its scope. We also added supporting experiments and analyses in Appendices J–L. The blue revisions include:
-
Clarified the method’s positioning and contributions. In the introduction, we explicitly define TC-CRP as Task-driven Competition for Constrained Redistribution of Parameters. We distinguish the primary single-layer setting from preliminary two-layer extensions and constrained readouts on frozen features. The contribution statements now include external comparisons, constraint ablations, and analyses of scalability and implementation costs.
-
Expanded and connected the related work. We discuss Manhattan sign updates, threshold-triggered residual accumulation, multilayer temporal learning with S4NN, and frozen-feature readout adaptation. We explain how these approaches relate to TC-CRP and connect the discussion to the new experimental comparisons.
-
Clarified the formulation and experimental accounting. In the problem setup, we distinguish the core linear formulation from the extensions. In the experimental section, we explain how theoretical per-pass write capacity is calculated and clarify that budget multipliers represent capacity multiples, not actual training epochs. We also explain why the primary experiments use wide weight bounds and summarize additional results where bounds actively block updates.
-
Strengthened the evidence supporting the main discussion. Appendix J adds write-matched Manhattan, threshold-accumulation, and integer S4NN comparisons; unpaired-update ablations; tight-bound residual checks; and latency-shift and observation-window robustness tests. The main text now reflects the resulting qualifications: baseline comparisons depend on the dataset and budget, while the benefit of row conservation depends on the representation and update rule.
-
Expanded the treatment of scalability and practical use. Appendix K adds two-layer experiments with frozen-hidden controls and constrained CIFAR10-DVS readouts on frozen CNN features. The main discussion now covers both promising results and failure modes, including clipping-induced dead zones and inefficient hidden-layer write allocation. We explicitly distinguish these preliminary prototypes and hybrid models from fully constrained multilayer spiking networks.
-
Revised the practical-cost discussion and limitations. Appendix L quantifies training memory, isolated runtime, write locality, coordinate concentration, shared-target write savings, and host CPU/GPU energy. The main text now acknowledges auxiliary history-storage costs, hotspot risks despite fewer write reversals, and the distinction between host-software measurements and dedicated neuromorphic-device performance. We also clarify the limited seeds in some extensions and the reuse of official test sets.
-
Updated future directions, disclosures, and reproducibility. We refocused future work on deeper integer spiking models, constraint-aware selection, and device-level evaluation. We also updated the disclosure and reproducibility statements and expanded the supplement with protocols, per-seed records, input and training-order verification, and portable CPU reproduction checks.
We thank you for highlighting our formal clarity and explicit guarantees. In our revised PDF, Sections 1-6 remain on pp. 1-9, and we added three appendices covering external comparisons (Appendix J), multi-layer and CNN tests (Appendix K), and memory and write overhead (Appendix L), along with an English
supplement/README.md. Under OpenReview's 5,000-character limit, Part 1 covers W1/Q4 and W2; Part 2 covers Q1-Q3, Q5, and Ethics.W1 & Q4. Multi-Layer Feasibility and Frozen-Feature Readouts (Appendix K)
Our new tests establish preliminary, task-dependent feasibility for hidden-layer training rather than finished deep scaling:
A: Sharing 2M training writes under Bw=127 with clipped hidden units and separate initialization accounting, two-layerAreaches 89.70% on MNIST. It beats identically initialized frozen hidden weights (78.86%, positive on all 5 seeds) and single-layerA(85.77%). On Fashion-MNIST, hidden clipping triggers dead-zone collapse: 52.54%-57.42% of validation inputs produce all-zero hidden activations, dropping accuracy to 37.51% vs. 69.85% frozen.H2probe: On seed-101 internal validation, jointly switching to piecewise-linear+8/+1activation,H2tracking,k_hid=5, k_out=64, Bw=109, and 12,748,800 writes avoids collapse and beats frozen controls on both MNIST (93.76% vs. 83.44%) and Fashion-MNIST (77.88% vs. 76.00%). Both prototypes propagate output error signals to the hidden layer and apply row-wise ranked pair updates under a shared write budget;Auses an STE, whileH2uses piecewise-linear derivatives. Full deep TTFS scaling remains future work.int32, and trained only integer linear heads with CNN training outside budget J. At 250k writes over 5 seeds, H2 (70.78%), CUM (70.68%), and A (69.92%) beat paired Manhattan (64.66%) and approach tuned thresholds (71.94%, vs. 76.50% float L2 reference). Only the linear head obeys our constraints, so we make no integer front-end or chip-energy claim.W2. Write-Matched External Comparisons (Appendix J)
RANDtests coordinate ranking insideArather than acting as prior work. Adapting the requested Manhattan and threshold rules into our linear setup gives controlled algorithmic benchmarks showing where TC-CRP helps:Abeats paired Manhattan on N-MNIST (78.33% vs. 71.08%) and matches on Fashion-MNIST (72.75% vs. 72.64%).H2beats tunedThreshold-pairon Fashion-MNIST (78.75% vs. 77.02%) while trailing on N-MNIST (83.04% vs. 85.92%), where equal write counts letThreshold-pairsee nearly 2.8x as many sample exposures.H2keeps zero row sums and achieves 76.53% on Fashion-MNIST and 83.99% on N-MNIST, matchingThreshold-pairat 74.90% and 84.05%. By contrast,Threshold-singlebreaks row balance on Fashion-MNIST (66.62%, max row sum 576) and stalls early on N-MNIST (21.32% vs. 80.11% againstThreshold-pairat common J=50,000 on an expanded grid). Unlike Nandakumar et al., TC-CRP turnsH2residuals directly into conditionally optimal+/-1pair transfers (Prop. 2).H2reaches 84.23% vs. 65.59% author and 3.97% strict, and at 241k on Fashion-MNIST 76.74% vs. 57.71% and 44.23%. At a larger budget of 12,748,800 writes on seed 101, strict S4NN reaches 94.80% MNIST in 1,022 epochs and 66.39% Fashion-MNIST in 24 epochs, showing S4NN fits large budgets while TC-CRP performs better at the tested low-write operating points (EventPropremains open).