Time Is All It Takes: Spike-Retiming Attacks on Event-Driven Spiking Neural Networks
Yi Yu, Qixin Zhang, Shuhan Ye, Xun Lin, Qianshan Wei, Kun Wang, Wenhan Yang, Dacheng Tao, Xudong Jiang

TL;DR
This paper introduces a novel timing-only adversarial attack on event-driven spiking neural networks, demonstrating its practicality and stealthiness across various benchmarks and architectures, and highlighting the need for improved temporal robustness.
Contribution
We formalize a spike-retiming threat model and develop a scalable optimization method for timing-only attacks on SNNs, revealing vulnerabilities not addressed by current defenses.
Findings
High success rate of over 90% on DVS-Gesture with minimal spike tampering
Spike retiming remains effective against timing-aware adversarial training
Retiming attacks are practical and stealthy across multiple benchmarks and architectures
Abstract
Spiking neural networks (SNNs) compute with discrete spikes and exploit temporal structure, yet most adversarial attacks change intensities or event counts instead of timing. We study a timing-only adversary that retimes existing spikes while preserving spike counts and amplitudes in event-driven SNNs, thus remaining rate-preserving. We formalize a capacity-1 spike-retiming threat model with a unified trio of budgets: per-spike jitter , total delay , and tamper count . Feasible adversarial examples must satisfy timeline consistency and non-overlap, which makes the search space discrete and constrained. To optimize such retimings at scale, we use projected-in-the-loop (PIL) optimization: shift-probability logits yield a differentiable soft retiming for backpropagation, and a strict projection in the forward pass produces a feasible…
Peer Reviews
Decision·ICLR 2026 Poster
- Original, well-motivated retiming-only attack; strong proposal (even if the experiments feel less persuasive). - Neat, precise formulation with clear feasibility and the writing is clean and readable. - Complete and intuitive presentation of the three timing budgets.
- The paper’s core motivation is rate-preserving, timing-only perturbations that evade naive rate detectors, but the experiments don’t directly quantify this. There’s no head-to-head against non-timing-space attacks showing for instance the rate drift,. As a result, the motivation of the paper as rate-preserving although defined in the feasible assignment (equation in (5)) may be lost in the approximation of assignment, or at worse case may not be needed if non-timing attack preserve it to some
The paper (with the exception of the abstract) is well written and easy to follow. The experiments are done on a wide array of datasets and the findings are of interest.
I can only see one major weakness of the paper from a scope perspective: There are a few areas where the paper should cite existing literature either to explain why they did not do more, or explain how this could be incorporated in future work: 1. For the adversarial training, since you have attacks with respect to different norms, why not combine the training against different norms together like what was done in: https://proceedings.mlr.press/v119/maini20a/maini20a.pdf At the very least, why
1.The scenario of the attack is novel and realistic. Keeping the intensity and event count unchanged, the attack can evade detection. 2.The relaxation resolves the non-differential problem and optimizes the perturbation budgets. 3.The discussion about robustness comparison between binary-grid and integer-grid is interesting.
1.Section 4.2 is really confusing. As a core part of the method, the meaning of every variable and equation must be clearly demonstrated. For instance, in Eq.8, does ‘shift logits’ represent the possibility of each $(s,j)$ changing to other time bins? In Eq.9, does $S(x)[t,j]$ represent the weighted possible value in $[t,j]$ after perturbation? The author should clarify what the term and equation are used for instead of only using concepts or definitions like ‘the expected soft retiming’. For se
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Advanced Memory and Neural Computing · Ferroelectric and Negative Capacitance Devices
