- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes SpikeLeak, an analytical gradient inversion attack on SNNs. It combines binary candidate recovery from gradient row-space constraints with sequence reconstruction guided by neuronal dynamics and cross-layer consistency. Theoretical analysis establishes rank conditions ensuring coverage of all true spike patterns, while experiments on four event-based vision datasets demonstrate exact reconstruction across multiple configurations.
Critical strengths
-
Theoretical characterization of gradient leakage. The paper characterizes gradient leakage in fully connected SNNs and establishes rank conditions ensuring that the candidate set contains all true spike patterns.
-
The two-stage framework combines binary candidate recovery with neuronal dynamics and cross-layer consistency to resolve temporal ordering and sample assignments.
-
Experiments on four event-based vision datasets and demonstrate exact reconstruction at batch sizes up to 32 on N-MNIST. The sparsity analysis further distinguishes candidate coverage from practical recoverability.
Critical weaknesses
Limited validation on trained models. The main experiments use randomly initialized, fully connected SNNs. It remains unclear whether the rank conditions and reconstruction performance persist after training, limiting the empirical support for applicability to trained models.
Insufficient characterization of uniqueness. The rank analysis guarantees candidate coverage, while exact recovery additionally depends on uniqueness. The paper does not provide a verifiable criterion for determining when the reconstruction constraints uniquely identify the input batch.
High computational cost. Reconstruction takes approximately 20 hours at B=32, T=8, and search can exhaust its budget even with complete candidate coverage. These results leave the computational feasibility of recovery beyond the demonstrated settings uncertain.
Questions for authors
-
How do gradient rank, candidate coverage, and reconstruction success change across trained checkpoints of the same architecture?
-
Can the authors provide theoretical or empirical evidence for reconstruction uniqueness up to sample permutation? Are alternative feasible input batches investigated?
-
For configurations with complete candidate coverage but failed reconstruction, how does reconstruction success vary with the Stage II search budget? This analysis would help determine whether the search budget is the primary bottleneck.