- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies parameter extraction from single-hidden-layer, direct-coded LIF spiking neural networks using only adaptive input queries and final logits. Its central observation is that constant-drive spike-count transitions form parallel hyperplane families, while isolated crossings produce logit jumps proportional to the corresponding output-weight columns. The proposed attack groups transitions by jump direction, recovers boundary normals and locations, unfolds merged transitions using jump multiplicities, and fits theoretical threshold sequences to recover normalized hidden parameters and a shared leak. Output parameters are subsequently recovered through a linear system. The paper provides conditional identifiability results and evaluates extraction on MNIST and Fashion-MNIST across hidden widths and temporal settings. It reports complete estimate coverage, small normalized-weight and leak errors, above 99% spike-count fidelity, and high prediction agreement, with query costs in the millions.
Critical strengths
- A coherent mechanism linking observable logits to hidden temporal dynamics. The paper goes beyond behavioral imitation by exploiting boundary directions, jump multiplicities, and relative boundary spacing to reconstruct canonical parameters. Recovering the shared leak alongside static weights is a consequential aspect of the contribution, and the scale and permutation ambiguities are explicitly addressed.
- The experiments assess internal recovery rather than prediction agreement alone. The main study reports normalized-weight error, leak error, and hidden spike-count fidelity across five runs for each hidden width. The transition-unfolding ablation is particularly informative: removing it preserves estimate coverage but substantially degrades transition-index accuracy, leak recovery, and functional fidelity. This supports the importance of accounting for merged transitions.
Critical weaknesses
-
The central dynamical identifiability result leaves the decisive uniqueness condition unresolved. Theorem 2 assumes unique transition unfolding/alignment and that the selected spacing ratios uniquely determine the leak. The paper explicitly acknowledges that these properties need not hold generally, but does not characterize concrete regimes where they hold or provide a practical certificate for the experimental targets. Thus, the theorem establishes conditional recovery without resolving when the main ambiguity can actually be eliminated. The algorithm additionally relies on selecting among transition assignments, yet its search complexity and behavior under competing leak candidates are insufficiently specified. This limits the theoretical contribution and confidence in recovery beyond the tested configurations.
-
The validation does not fully support complete canonical recovery or characterize practical robustness. “Recovered” measures estimate coverage without an accuracy threshold, and direct errors are reported for normalized input weights and the leak, but not hidden biases, output weights, or output biases. Functional checks are limited to natural inputs despite the stated equivalence domain being the full query box. Moreover, extraction uses roughly 8.5–96.8 million queries on small, single-hidden-layer models, without runtime or output-precision sensitivity measurements. These limitations are acknowledged, but leave the practical significance of the attack insufficiently established. There is also an evaluation ambiguity: individual configurations in Table 3 report PMR values such as 0.9999, which cannot arise from the stated indicator average over exactly 1,000 test inputs without additional samples or aggregation.
Questions for authors
- For the tested horizons and leak values, can the authors establish or empirically certify uniqueness of the aligned threshold pattern over the actual admissible leak interval? How are multiple indistinguishable or near-indistinguishable candidates detected and handled?
- Please specify the leak-search interval and resolution, transition-subsequence search, alignment tolerances, candidate-selection loss, and stopping criteria. What are the runtime and query-cost breakdowns for boundary discovery, geometry recovery, and alignment? 3.What exact number of examples and aggregation procedure produce the individual target accuracies and PMRs in Table 3? Please reconcile these values with the stated 1,000-example test set.
- Can the authors report errors for all canonical parameter blocks and fidelity on held-out inputs spanning the query domain, including near recovered boundaries? A controlled experiment with reduced logit precision would also help establish whether the demonstrated recovery survives a modest departure from the ideal interface.