Skip to Content
You are currently on the new version of our website. Access the old version .
ElectronicsElectronics
  • Article
  • Open Access

2 July 2026

29 Pages

Fast and Effective Backdoor Removal in Federated Spiking Neural Networks via Temporal Synaptic Sanitization

and
School of Management, Guangdong University of Science and Technology, Dongguan 523070, China
*
Author to whom correspondence should be addressed.

Abstract

Federated learning enables privacy-preserving training of spiking neural networks on distributed neuromorphic and event-based data, but it also exposes the global model to stealthy backdoor attacks injected by malicious clients. Compared with conventional artificial neural networks, federated spiking neural networks are more difficult to sanitize because malicious behavior may be encoded not only in spatial filters but also in spike timing, membrane dynamics, and temporal firing sparsity. Existing backdoor defenses usually require repeated federated retraining, access to client data, trigger synthesis, or computationally expensive model repair, which limits their practicality in low-power neuromorphic deployment. This paper proposes FedTSR, a fast post-training backdoor removal framework for spiking neural networks trained through federated learning. FedTSR introduces two coordinated algorithms: temporal synaptic risk estimation, which identifies backdoor-sensitive synaptic groups by measuring abnormal spike-response contributions across simulation timesteps using a small clean calibration set, and spike-consistency recalibration, which restores benign task performance through lightweight membrane-potential alignment and firing-rate regularization without restarting federated training. The proposed method is trigger-agnostic, client-independent, and compatible with surrogate-gradient trained spiking models. Here, trigger-agnostic means that FedTSR does not use trigger identity during repair; it should not be interpreted as certified robustness against every adaptive trigger family. Experiments on real neuromorphic and vision benchmarks, including N-MNIST, CIFAR10-DVS, DVS Gesture, and CIFAR-10, show that FedTSR substantially reduces attack success rate while preserving clean accuracy under multiple backdoor patterns, poisoning ratios, and non-IID federated settings. The results indicate that exploiting temporal spike dynamics provides an efficient and effective route for sanitizing compromised federated spiking neural networks.

1. Introduction

Spiking neural networks (SNNs) have become an important learning paradigm for neuromorphic and event-driven intelligence because they represent information through sparse spike trains and can exploit temporal dynamics for low-power inference. Different from artificial neural networks that process continuous activations, SNNs integrate synaptic currents into membrane potentials and emit discrete spikes only when firing thresholds are reached. This event-driven mechanism is attractive for edge perception, autonomous sensing, and human–machine interaction, especially when inputs are naturally asynchronous, such as dynamic vision sensor streams. Recent advances in surrogate-gradient learning and deep spiking architectures have significantly improved the accuracy of directly trained SNNs, making them increasingly practical for real-world deployment [1,2,3,4,5,6].
At the same time, many neuromorphic applications are inherently distributed. Event cameras, wearable sensors, mobile robots, and embedded monitoring devices often collect private or location-sensitive data that cannot be centralized. Federated learning provides a natural framework for such scenarios by allowing clients to collaboratively train a global model through model-update aggregation rather than raw-data sharing [7,8]. Recent studies have therefore explored federated SNN training, asynchronous neuromorphic collaboration, vertical federated spiking learning, and energy-aware hierarchical SNN systems [9,10,11,12,13]. These studies show that federated SNNs can combine privacy-preserving distributed learning with efficient spike-based inference. However, the same distributed training process also creates a serious security risk: the server may aggregate malicious local updates into the global SNN without being able to inspect the clients’ private data.
Backdoor attacks are among the most concerning threats in federated learning. In a backdoored model, clean inputs are classified normally, but inputs containing a hidden trigger are forced into an attacker-specified target class. Classical backdoor attacks have been widely studied in centralized neural networks [14,15], and federated learning further amplifies the threat because malicious clients can poison only local data or scale their updates while still participating in normal aggregation [16,17,18]. Recent federated attacks have become increasingly adaptive, including covert attacks, data-free fake-client attacks, practical deployment-oriented attacks, and multi-label adversarial conflicts [19,20,21,22,23]. For SNNs, the problem is even more subtle. A trigger may be encoded not only as a spatial patch, but also as a short spike burst, a delayed event pattern, or a hybrid spatio-temporal signal. Recent attacks against neuromorphic and federated SNNs demonstrate that malicious behavior can exploit spike timing, temporal windows, and distributed event slices [24,25,26,27].
Although many backdoor defenses have been proposed, directly applying them to SNNs trained through federated learning is insufficient. Trigger-reconstruction methods assume that a compact trigger can be recovered from model behavior, but temporal triggers in SNNs may not correspond to a single static pattern [28]. Fine-pruning and attention distillation can remove some suspicious neurons, but they mainly depend on activation magnitude or attention similarity and may damage sparse event-driven representations [29,30]. Adversarial neuron pruning improves post-training repair by identifying sensitive neurons, but it still does not explicitly model timestep-wise membrane contribution or spike concentration [31]. More recent defenses have considered adversarial neuron noise, data-free federated sanitization, and consistency-based vertical federated defense [32,33,34]; nevertheless, these methods are not designed for the temporal membrane dynamics that determine SNN decisions. SNN-specific backdoor mitigation has begun to use membrane-potential evidence [35], but fast trigger-agnostic repair for SNNs trained through federated learning remains underexplored.
This paper studies the following problem: given an SNN trained through federated learning θ ★ that may contain a backdoor, how can the server quickly construct a sanitized model θ ^ using only a small clean calibration set D c , without knowing the trigger τ ( · ) , the target label y tar , or the malicious clients? This setting is practical because a deployed server may only possess the final global model and a small amount of verified clean data. It is also challenging because ordinary clean accuracy cannot reveal whether the model has learned a hidden temporal shortcut. In addition, restarting federated training is often expensive or impossible, since clients may be offline, communication may be limited, and private training data remain inaccessible.
To address this challenge, we propose FedTSR, a fast post-training backdoor removal framework based on temporal synaptic sanitization. The key idea is that backdoor-sensitive pathways in SNNs often exhibit abnormal temporal behavior: they produce concentrated membrane contributions over a small number of timesteps, deviate from the normal layer-level firing population, and strongly align with a narrow set of output classes. FedTSR therefore estimates a group-wise temporal synaptic risk score R l , g for each synaptic group g in layer ℓ. The score combines temporal concentration A l , g , firing deviation B l , g , and class-response concentration D l , g , and is converted into a continuous risk mask π l , g . High-risk synaptic groups are softly damped rather than completely pruned, which weakens suspicious pathways while retaining useful capacity for clean inference.
FedTSR further introduces spike-consistency recalibration to recover benign performance after risk-adaptive damping. The recalibration objective combines clean-label supervision, output consistency with the original model on correctly predicted clean samples, temporal spike and membrane consistency, and a risk-anchoring term that prevents high-risk groups from regaining their original suspicious strength. This design is important for SNNs because clean accuracy depends not only on final class logits but also on stable temporal firing regimes. By preserving layer-level spike and membrane statistics while suppressing high-risk synaptic groups, FedTSR avoids the two common failure modes of post-training repair: leaving temporal backdoors active or over-suppressing useful sparse representations.
The main contributions of this paper are threefold. First, we formulate fast post-training backdoor removal for SNNs trained through federated learning under a strict trigger-agnostic and client-independent threat model, where the defender only uses θ ★ and D c . Second, we propose temporal synaptic risk estimation, a group-wise mechanism that identifies suspicious SNN pathways through timestep-wise membrane contribution, firing deviation, and class-response concentration. Third, we develop spike-consistency recalibration, which restores benign spike dynamics after risk-adaptive damping without restarting federated optimization. Extensive experiments on N-MNIST, CIFAR10-DVS, DVS Gesture, and CIFAR-10 show that FedTSR substantially reduces attack success rate while preserving clean accuracy under static, temporal, and hybrid triggers, demonstrating that explicitly modeling temporal spike dynamics is an effective route for sanitizing compromised federated SNNs.
FedTSR is not intended to replace all training-time federated defenses or certified backdoor defenses. Its contribution is a practical post-training repair mechanism that explicitly uses timestep-wise SNN dynamics when only the final global model and a small calibration set are available.

3. Preliminaries

3.1. Federated Spiking Neural Networks

We consider a cross-device federated learning system with K clients and one coordination server. Client k owns a private local dataset D k = { ( x i , y i ) } i = 1 n k , where x i denotes an input sample and y i ∈ { 1 , … , C } is its class label. The total number of training samples is n = ∑ k = 1 K n k . In a standard federated training round, the server broadcasts the current global model parameters θ r to selected clients, each selected client locally updates the model on D k , and the server aggregates the returned parameters into θ r + 1 . The global optimization objective is written as min θ L fed ( θ ) = ∑ k = 1 K ( n k / n ) L k ( θ ) , where L k ( θ ) is the empirical loss of client k. In the non-IID setting, the local distributions P k ( x , y ) may differ substantially across clients, which makes the global model more vulnerable to malicious updates because abnormal local behavior can be partially hidden by natural client drift.
The model trained in this work is a spiking neural network denoted by F θ . Unlike artificial neural networks that process static activations, an SNN represents information through binary spikes over T discrete simulation timesteps. For layer ℓ at timestep t, the presynaptic spike vector is denoted by s l − 1 t , the membrane potential by u l t , and the output spike vector by s l t . A commonly used discrete leaky integrate-and-fire neuron can be expressed as u l t = λ u l t − 1 + W l s l − 1 t + b l − v th s l t − 1 and s l t = H ( u l t − v th ) , where W l and b l are the synaptic weight matrix and bias, λ ∈ [ 0 , 1 ) is the leakage factor, v th is the firing threshold, and H ( · ) is the Heaviside step function. Since H ( · ) is non-differentiable, surrogate-gradient learning replaces its derivative with a smooth approximation during backpropagation while preserving binary spike generation during the forward pass. The final prediction is obtained from temporal evidence accumulated across timesteps, for example by using the average output membrane potential or spike count. In this paper, F θ ( x ) denotes the predicted class of input x, while z θ ( x ) ∈ R C denotes the corresponding class-wise temporal readout before the final decision.

3.2. Backdoor Attacks in Federated SNNs

A backdoor attack injects a hidden malicious behavior into the global model while preserving normal accuracy on clean inputs. Let A be the set of malicious clients controlled by the adversary, with | A | ≪ K in a stealthy attack. During federated training, a malicious client modifies part of its local data by applying a trigger transformation τ ( · ) and assigning the triggered samples to an attacker-specified target label y tar . A poisoned sample is therefore represented as ( τ ( x ) , y tar ) . The malicious client then performs local training on a mixture of clean and poisoned samples and submits the resulting update to the server. The poisoning ratio on a malicious client is denoted by ρ , where ρ = 0 means no poisoned sample is used and larger ρ indicates stronger local poisoning.
For event-based or temporally encoded inputs, the trigger transformation τ ( · ) may operate in different domains. A spatial trigger modifies a fixed region of the input frame or event projection, a temporal trigger injects abnormal spikes during selected timesteps, and a hybrid trigger changes both spatial location and spike timing. In an SNN, the same visible trigger can produce different internal effects depending on firing threshold, leakage, temporal encoding, and simulation length. Therefore, a successful backdoor in federated SNNs is not necessarily characterized by a large static weight perturbation. Instead, it may rely on abnormal temporal amplification, where a few synapses produce disproportionately strong postsynaptic responses when trigger-induced spikes arrive at sensitive timesteps.
We evaluate a compromised global model using two complementary metrics. Clean accuracy measures benign task performance on unmodified test samples and is denoted by ACC = P ( F θ ( x ) = y ) . Attack success rate measures malicious effectiveness on triggered non-target test samples and is denoted by ASR = P ( F θ ( τ ( x ) ) = y tar ∣ y ≠ y tar ) . A well-hidden attack aims to keep ACC high while making ASR high. A successful defense should reduce ASR sharply while causing only a small decrease in ACC . In this work, the defender is not assumed to know the trigger pattern, the target label, the malicious clients, or the poisoned local samples. This threat model is stricter than defenses that require trigger reconstruction or malicious-client identification. The only data-side assumption is access to a small calibration set that the server treats as clean. In practice, this set can be obtained from a trusted third-party validation source, from a small server-held holdout collected before federated deployment, or from manually verified deployment samples. This assumption is weaker than requiring access to client training data, and the limitations related to calibration contamination, imbalance, and distribution shift are discussed in Section 5.5.

3.3. Post-Training Backdoor Removal Objective

Let θ ★ denote the SNN trained through federated learning that may contain a backdoor. The goal of backdoor removal is to construct a sanitized model θ ^ from θ ★ using only D c and model-level observations. The desired sanitized model should satisfy three requirements. First, it should preserve benign predictions, meaning that F θ ^ ( x ) should remain close to F θ ★ ( x ) and to the ground-truth label y for clean samples. Second, it should suppress abnormal trigger-sensitive pathways so that triggered samples no longer collapse to y tar . Third, it should be fast enough for practical use, requiring no communication with clients and no full federated retraining.
To formalize this objective, we view the compromised model as containing two coupled components: benign task parameters and backdoor-sensitive temporal parameters. The defender does not know this decomposition explicitly, but can estimate suspicious behavior from clean temporal responses. For a synaptic group g in layer ℓ, let a g t ( x ) denote its contribution to postsynaptic membrane variation at timestep t under input x. A synaptic group may be considered risky when its temporal contribution is unusually concentrated, unstable across clean samples, or strongly aligned with a small number of output classes. This intuition is important because backdoor triggers often create shortcut-like spike routes that are rarely needed for normal classification but dominate the decision once activated.
The proposed method in Section 4 instantiates this objective through temporal synaptic risk estimation and spike-consistency recalibration. The former assigns a risk score to synaptic groups by comparing timestep-wise membrane contributions and firing behavior on clean calibration samples. The latter repairs the model by selectively damping high-risk synapses and recalibrating membrane dynamics so that normal firing patterns remain stable. By separating risk localization from lightweight recalibration, the defense targets the temporal structure of SNN backdoors rather than treating the model as a static artificial neural network. This design is the basis for achieving fast yet effective backdoor removal in SNNs trained through federated learning.

4. Methodology

4.1. Overview of FedTSR

This section presents FedTSR, a fast trigger-agnostic framework for removing backdoors from a spiking neural network trained through federated learning. The input to FedTSR is a possibly compromised global model θ ★ and a small, clean calibration set D c . The output is a sanitized model θ ^ that preserves clean spiking behavior while suppressing hidden malicious temporal pathways. FedTSR is designed for the post-training setting introduced in Section 3.3; therefore, it does not require access to private client data, malicious-client identities, trigger patterns, or a new round of federated optimization. Figure 1 shows a general pipeline of our proposal.
Figure 1. High-level pipeline of FedTSR. After federated training, the server uses only the aggregated SNN θ ★ and a small clean calibration set D c . TSRE estimates a temporal synaptic risk mask, risk-adaptive damping weakens high-risk groups, and SCR recalibrates clean spike dynamics to produce the sanitized model θ ^ .
Table 1 summarizes the operational assumptions, inputs, outputs, and main failure cases of FedTSR.
Table 1. FedTSR assumptions, inputs, outputs, and failure cases.
The key observation behind FedTSR is that backdoors in spiking neural networks are often encoded as temporally concentrated shortcut responses. In a benign SNN, discriminative evidence is usually accumulated over multiple timesteps and distributed across multiple synaptic groups. By contrast, a triggered input can activate a small number of synaptic groups at highly sensitive timesteps, causing the output readout to move rapidly toward the attacker-specified target class. Such behavior may remain hidden when only static weight norms are inspected, because a malicious pathway can be represented by synapses whose magnitudes are not individually large. FedTSR therefore measures risk from temporal spike-response behavior rather than from static parameters alone.
FedTSR contains two coordinated components. The first component, temporal synaptic risk estimation (TSRE), assigns a risk score to each synaptic group by analyzing its timestep-wise membrane contribution, firing deviation, and class-response concentration on D c . The second component, spike-consistency recalibration (SCR), selectively suppresses high-risk synaptic groups and then performs lightweight calibration to restore benign membrane and spike statistics. These two components instantiate the objective in Section 3.3: TSRE estimates the implicit risk regularizer R risk , while SCR minimizes a calibration loss that balances clean-label supervision, output consistency, and temporal spike consistency.
Let G l denote the set of synaptic groups in layer ℓ. For a convolutional layer, one group corresponds to all incoming kernels associated with an output channel; for a fully connected layer, one group corresponds to the incoming weight vector of one postsynaptic neuron. This structured grouping avoids unstructured neuron-level noise and makes the sanitization operation compatible with efficient neuromorphic implementation. For a group g ∈ G l , FedTSR computes a scalar risk value R l , g and a continuous risk mask π l , g ∈ [ 0 , 1 ] . A larger π l , g means that the group is more likely to participate in a backdoor-sensitive temporal pathway and will be damped more strongly during model repair.

4.2. Temporal Synaptic Risk Estimation

TSRE estimates whether a synaptic group behaves like a temporally concentrated shortcut under clean calibration inputs. For each sample x ∈ D c , the original model θ ★ is simulated for T timesteps. During this simulation, FedTSR records spikes s l t ( x ) , membrane potentials u l t ( x ) , and the contribution of each synaptic group to the postsynaptic membrane. For group g in layer ℓ, its instantaneous contribution is denoted by h l , g t ( x ) . In a convolutional layer, h l , g t ( x ) is the feature map produced by the kernels of group g at timestep t; in a fully connected layer, it is the postsynaptic current produced by the incoming weights of neuron g. The average temporal contribution is defined as
c l , g t = 1 | D c | ∑ x ∈ D c ∥ h l , g t ( x ) ∥ 1 ,
where the norm is normalized by spatial size for convolutional layers. The normalized contribution distribution over time is p l , g t = ( c l , g t + ϵ ) / ∑ τ = 1 T ( c l , g τ + ϵ ) , where ϵ is a small numerical constant.
The first risk component is the temporal concentration score. It measures whether a group concentrates its contribution on only a few timesteps:
A l , g = 1 − − ∑ t = 1 T p l , g t log ( p l , g t ) log T .
When A l , g is close to zero, the group contributes broadly across timesteps; when it is close to one, the group is dominated by a narrow temporal window. This is important because temporal backdoor triggers can exploit a short interval of abnormal spikes to force a target decision while leaving most clean-time behavior apparently normal.
A simple entropy argument explains why A l , g is useful but should not be used alone. If benign evidence is accumulated across T timesteps, the contribution distribution p l , g t has high entropy and A l , g ≈ 0 . If a shortcut pathway is activated in only w ≪ T timesteps, then its entropy is at most log w , giving A l , g ≥ 1 − log ( w ) / log ( T ) . Therefore, temporally sparse malicious shortcuts are statistically separated from broadly accumulated benign evidence. Class-selective benign neurons can also be temporally concentrated, so FedTSR combines A l , g with firing deviation B l , g and class-response concentration D l , g ; the localization evidence is reported in the ablation and sensitivity analysis.
More formally, consider a stylized benign–shortcut mixture for one layer. Let a benign group have temporal entropy at least log T − δ b , firing deviation at most β b , and class-response concentration at most δ c . Let a backdoor shortcut place at least 1 − ε t of its contribution mass inside a trigger window of length w < T , have firing deviation at least β b + Δ b , and place at least 1 − ε c of its class response on one target class. Then its temporal entropy is bounded by log w + O ( ε t log T ) , so the concentration gap satisfies
A bd − A ben ≥ 1 − log w + O ( ε t log T ) log T − δ b log T .
After the same robust layer-wise normalization, the risk gap increases with this entropy gap, Δ b , and the class-response gap 1 − ε c − δ c . Thus TSRE is expected to separate malicious from benign groups when the backdoor is temporally narrower, population-wise more abnormal, and class-wise more concentrated than normal evidence. This is a conditional explanation rather than a certified guarantee; adaptive attacks that deliberately match benign entropy, firing deviation, and class response reduce this gap, so the benign-mimic setting is reported later as a limitation.
The second risk component is the firing deviation score. Let f l , g t be the average firing rate of group g at timestep t on D c . Let μ l t and σ l t denote the mean and standard deviation of firing rates across all groups in layer ℓ at timestep t. FedTSR measures deviation as
B l , g = 1 T ∑ t = 1 T | f l , g t − μ l t | σ l t + ϵ .
This score is not intended to remove all unusual neurons, since class-specialized neurons can be useful. Instead, it is used jointly with temporal concentration and class-response concentration. A benign discriminative group may fire more strongly for a class, but it is less likely to be both temporally sharp and abnormally detached from the layer population.
The third risk component is the class-response concentration score. Let z θ ★ ( x ) be the class-wise temporal readout of the original model. For each class c, FedTSR estimates the contribution sensitivity of group g to the output logit z c by
d l , g , c = 1 | D c ( c ) | ∑ ( x , y ) ∈ D c ( c ) ∑ t = 1 T ∂ z θ ★ , c ( x ) ∂ u l , g t ( x ) , h l , g t ( x ) ,
where D c ( c ) = { ( x , y ) ∈ D c : y = c } and the gradient is computed with the same surrogate derivative used by the SNN. The normalized class-response distribution is q l , g , c = ( d l , g , c + ϵ ) / ∑ j = 1 C ( d l , g , j + ϵ ) . The class-response concentration is then
D l , g = 1 − − ∑ c = 1 C q l , g , c log ( q l , g , c ) log C .
A group with large D l , g strongly supports a narrow set of output classes. Such behavior is not automatically malicious, but when combined with high temporal concentration and abnormal firing deviation, it becomes a strong indicator of a shortcut that may be activated by a trigger.
The final risk score is obtained through robust layer-wise normalization. For a raw score X l , g ∈ { A l , g , B l , g , D l , g } , FedTSR computes X ˜ l , g = max ( 0 , ( X l , g − med l ( X ) ) / ( mad l ( X ) + ϵ ) ) , where med l and mad l are the median and median absolute deviation over groups in layer ℓ. The risk score is R l , g = ω A A ˜ l , g + ω B B ˜ l , g + ω D D ˜ l , g , where ω A , ω B , and ω D are non-negative weights and are set equally unless otherwise specified. The continuous risk mask is computed by π l , g = clip ( ( R l , g − Q l 50 ) / ( Q l 90 − Q l 50 + ϵ ) , 0 , 1 ) , where Q l 50 and Q l 90 are the 50th and 90th percentiles of risk scores in layer ℓ. This percentile-based conversion avoids a fixed global threshold and makes the method stable across layers with different firing statistics. The equal weighting ω A = ω B = ω D = 1 / 3 is used as a conservative default because the defender has no trigger-aware validation set for tuning attack-specific coefficients. Fixed and validation-learned alternatives are compared in the sensitivity analysis. Learned coefficients slightly improve ASR in some cases, but the gain is small compared with the risk of overfitting to the limited calibration set; hence the main experiments keep equal weights.

4.3. Risk-Adaptive Damping and Spike-Consistency Recalibration

After TSRE assigns π l , g to each synaptic group, FedTSR performs risk-adaptive damping. The damped initialization is
W l , g † = ( 1 − γ π l , g ) W l , g ★ ,
where W l , g ★ is the original weight group in θ ★ and γ ∈ [ 0 , 1 ] controls the maximum damping strength. A group with π l , g = 0 remains unchanged, while a group with π l , g = 1 receives the strongest suppression. This operation is softer than pruning: it weakens suspicious pathways without destroying the surrounding representation. Such continuous damping is especially useful for SNNs because abrupt removal of synapses can significantly change membrane trajectories and cause unstable firing.
Direct damping may reduce attack success rate, but it may also slightly disturb clean accuracy. SCR therefore recalibrates the damped model using D c . The recalibration starts from θ † , the model obtained after risk-adaptive damping, and optimizes only for a small number of epochs. The clean-label loss is
L ce = 1 | B | ∑ ( x , y ) ∈ B CE ( z θ ( x ) , y ) ,
where B is a calibration mini-batch. Since D c is small, clean-label supervision alone may overfit. FedTSR therefore adds an output consistency term that keeps the sanitized model close to the original model on benign inputs:
L out = T d 2 KL softmax z θ ★ ( x ) T d ∥ softmax z θ ( x ) T d ,
where T d is the distillation temperature. This term is applied to clean samples for which the original model prediction is correct, so that SCR preserves useful benign decision boundaries without intentionally preserving wrong predictions. To maintain the temporal operating regime of the SNN, SCR further introduces a spike-consistency loss. Let s ¯ l , θ t ( B ) and u ¯ l , θ t ( B ) denote batch-averaged spikes and membrane potentials of model θ at layer ℓ and timestep t. The temporal consistency loss is
L temp = ∑ l ∑ t = 1 T ∥ s ¯ l , θ t ( B ) − s ¯ l , θ ★ t ( B ) ∥ 2 2 + κ ∥ u ¯ l , θ t ( B ) − u ¯ l , θ ★ t ( B ) ∥ 2 2 ,
where κ balances spike and membrane alignment. This term does not force every neuron to reproduce the original trajectory exactly. Instead, it preserves layer-level temporal statistics, preventing the sanitized model from drifting into a firing regime that is accurate on the small calibration set but unstable on the test distribution.
The complete SCR objective is
L SCR = L ce + λ out L out + λ temp L temp + λ risk ∑ l ∑ g ∈ G l π l , g ∥ W l , g − W l , g † ∥ 2 2 .
The last term discourages high-risk groups from recovering their original suspicious strength during recalibration. In addition, FedTSR applies risk-gated learning rates to synaptic groups, written as W l , g ← W l , g − η ( 1 − ζ π l , g ) ∇ W l , g L SCR , where ζ ∈ [ 0 , 1 ] reduces updates on risky groups. This design allows low-risk benign groups to adapt and recover accuracy, while high-risk groups remain suppressed. All gradients are computed with surrogate-gradient backpropagation through time, and no triggered sample is used at any stage.

4.4. Training-Free Inference Repair and Complexity

FedTSR can be used in two modes. In the default mode, it performs risk-adaptive damping followed by SCR. In an even faster inference-repair mode, the defender can skip SCR and use θ † directly. This training-free mode is useful when the calibration set is extremely small or when the server must deploy a patched model immediately. The full mode is used in our experiments because it provides a better accuracy–robustness trade-off while still requiring only a few local calibration epochs.
Algorithm 1 summarizes the complete procedure. The algorithm first simulates the compromised model on the clean calibration set and collects temporal statistics. It then computes risk scores and converts them into continuous masks. After damping risky groups, SCR recalibrates the model with clean supervision, output consistency, temporal consistency, and risk anchoring. The sanitized parameters after recalibration are returned as θ ^ .
Algorithm 1 FedTSR: Temporal Synaptic Sanitization for Federated SNNs
Require: 
SNN trained through federated learning θ ★ , clean calibration set D c , simulation length T, damping strength γ , recalibration epochs E
Ensure: 
Sanitized SNN θ ^
  1:
Define synaptic groups { G l } for each trainable layer ℓ
  2:
Run θ ★ on D c for T timesteps and record s l t , u l t , and h l , g t
  3:
Compute temporal concentration A l , g , firing deviation B l , g , and class-response concentration D l , g
  4:
Normalize the three scores layer-wise and obtain R l , g
  5:
Convert R l , g into the continuous risk mask π l , g
  6:
for each layer ℓ and each group g ∈ G l  do
  7:
    Set W l , g † ← ( 1 − γ π l , g ) W l , g ★
  8:
end for
  9:
Initialize θ ← θ †
10:
for  e = 1 to E do
11:
  for each mini-batch B ⊂ D c  do
12:
      Compute L SCR using clean labels and temporal statistics from θ ★
13:
      Update each group by risk-gated surrogate-gradient descent
14:
  end for
15:
end for
16:
Set θ ^ ← θ and return θ ^
The computational cost of TSRE is dominated by one forward simulation and one surrogate-gradient backward pass on D c . If N c = | D c | , the cost is approximately O ( N c T | θ ★ | ) , which is much lower than repeating federated training over all clients. The memory cost can be kept small by streaming statistics over mini-batches, requiring storage only for layer-wise group scores and batch-level temporal means. SCR adds E calibration epochs on D c , where E is typically much smaller than the number of local epochs used during federated training. No client communication is needed after the compromised model has been received. More explicitly, TSRE needs O ( N c T ∑ l | W l | ) arithmetic operations and O ( ∑ l | G l | + B T ∑ l d l ) working memory when traces are streamed over a calibration batch of size B and layer state dimension d l . SCR adds E ordinary surrogate-gradient calibration epochs. The damping-only variant includes the TSRE forward/backward simulation and risk-mask construction, not only the final weight scaling. Absolute wall-clock time, peak GPU memory, and an energy proxy are reported in the sanitization-efficiency experiments.
For larger neuromorphic deployments, this cost should be interpreted as one-time server-side repair latency, not inference latency. The gradient-based class-response term is the dominant overhead because it requires surrogate-gradient tracing through the simulated timesteps. In practice, the defender can reduce this cost by streaming calibration batches, grouping synapses at the channel/block level, or using the damping-only mode when immediate patching is required. These trade-offs are evaluated later by separating TSRE-only, SCR-only, and full FedTSR measurements and by comparing normalized repair costs.
The design of FedTSR directly addresses the three requirements stated in Section 3.3. First, clean behavior is preserved by output consistency and temporal spike consistency. Second, malicious behavior is suppressed by identifying and damping synaptic groups with concentrated temporal risk. Third, the repair is fast because it is performed entirely at the server using a small clean calibration set. This makes FedTSR suitable for federated neuromorphic systems where retraining is expensive, client data are inaccessible, and deployed SNNs must be sanitized under strict latency and energy constraints.

5. Experiments

5.1. Experimental Settings

We evaluate FedTSR in a post-training sanitization scenario. A federated SNN is first trained by FedAvg under clean or poisoned client updates, and the resulting global model θ ★ is then repaired at the server using only a small clean calibration set D c . No client data, malicious-client identities, trigger labels, or poisoned samples are used during removal. The sanitized model θ ^ is evaluated on both clean test samples and triggered test samples. Clean performance is measured by clean accuracy ACC , while backdoor effectiveness is measured by attack success rate ASR as defined in Section 3.2. For all datasets, results are averaged over three random seeds, and the same compromised checkpoint θ ★ is used for comparing different removal methods.
For reproducibility, we now report random seeds, model architectures, neuron parameters, surrogate functions, optimizer settings, batch sizes, hardware, runtime, and baseline adaptation details. Unless otherwise stated, all quantitative entries are mean ± standard deviation over seeds { 1 , 2 , 3 } . Paired two-sided t-tests on ASR are reported only as descriptive support because the seed budget is small, as further noted in Section 5.5. Table 2 lists the complete implementation settings used in all experiments.
Table 2. Implementation and hyperparameter details. BN denotes batch normalization before the spiking activation. All runs used PyTorch 2.1/CUDA 12.1 on one NVIDIA RTX 3090 GPU with 24 GB memory.
The evaluation covers both neuromorphic event datasets and frame-based datasets converted into spike trains. The dataset and preprocessing settings are summarized in Table 3. N-MNIST [41], CIFAR10-DVS [42], and DVS Gesture [43] are used to test whether FedTSR can sanitize models trained on genuine event streams, while CIFAR-10 [44] is used to examine the compatibility of FedTSR with rate-coded static images. For event datasets, raw events are accumulated into T discrete event frames with polarity channels preserved. For CIFAR-10, each image is converted into a spike train by Poisson rate coding, where pixel intensity determines the firing probability at each timestep. All input samples are normalized using statistics computed only from the corresponding training split. The calibration set D c is sampled from verified clean data and is disjoint from the training and test sets.
Table 3. Datasets and preprocessing settings used in the experiments. The URLs are included in the setting section to make the benchmark sources explicit.
The federated and attack settings are listed in Table 4. Unless otherwise stated, we use K = 20 clients and sample 10 clients per communication round. Data heterogeneity is controlled by a Dirichlet label partition with concentration parameter ξ = 0.5 , where a smaller ξ indicates a stronger non-IID distribution. The default malicious-client ratio is 10 % , and the default local poisoning ratio is ρ = 0.2 . A malicious client trains on a mixture of clean samples and poisoned samples ( τ ( x ) , y tar ) , where y tar is fixed to class 0 for digit and object datasets and to the “hand clap” class for DVS Gesture. The target class is not disclosed to any defense.
Table 4. Federated training, attack, and FedTSR sanitization settings. These settings are used as defaults unless a later subsection explicitly changes one factor.
All baselines are adapted to SNNs rather than applied as static ANN procedures. Table 5 summarizes the adaptation and tuning ranges. The damping-only FedTSR variant includes temporal statistic collection and risk estimation.
Table 5. Baseline adaptation and tuning for SNN repair.
In our experimental protocol, the server first receives local model updates from benign and malicious clients and aggregates them into θ ★ . The compromised model is then passed to FedTSR, which estimates temporal synaptic risk on D c , performs risk-adaptive damping, and applies spike-consistency recalibration. The final model θ ^ is evaluated on clean and triggered test sets. This separation between federated training and server-side sanitization is essential because it matches the intended deployment scenario: the defender may receive an already trained SNN and must repair it without restarting collaboration among clients.
Figure 2 shows the three trigger types used in the experiments. The static patch trigger inserts a fixed spatial pattern into event frames or rate-coded frames across all timesteps. The temporal burst trigger injects a short, high-frequency spike pattern into a small temporal window while leaving other timesteps unchanged. The hybrid trigger combines a spatial patch with a temporally delayed burst. These triggers are chosen because they represent three different ways in which backdoors can exploit SNN behavior: persistent spatial evidence, short-time temporal evidence, and coupled spatio-temporal evidence.
Figure 2. Backdoor trigger designs. The static patch is active at every timestep, the temporal burst is active only in a short time window, and the hybrid trigger activates a spatial pattern during delayed timesteps. Shaded cells indicate triggered timesteps and black squares indicate spatial trigger locations.
The victim architectures are selected to match the difficulty of each benchmark. For N-MNIST, we use a four-layer convolutional SNN with two convolutional blocks and two fully connected layers. For CIFAR10-DVS and CIFAR-10, we use a VGG-style SNN with batch normalization before spiking activations. For DVS Gesture, we use a residual SNN because gesture recognition requires longer temporal aggregation and benefits from residual feature reuse. All SNNs use leaky integrate-and-fire neurons with learnable affine parameters and fixed simulation length T as specified in Table 3. The initial compromised model θ ★ is trained using surrogate gradients, and the same surrogate function is used in SCR for fair comparison.
We compare FedTSR with representative post-training and calibration-based defenses. Fine-tuning updates all parameters on D c without risk estimation. Fine-pruning removes low-activity channels and then fine-tunes the remaining model. Neural Attention Distillation transfers clean attention statistics from θ ★ to the repaired model. ANP-style perturbation identifies sensitive neurons by adversarial parameter perturbation and suppresses them before calibration. For SNN compatibility, all baselines are implemented with the same timestep length, neuron model, and calibration set. Since none of these baselines receives trigger information, the comparison follows the same trigger-agnostic repair setting as FedTSR.

5.2. Overall Backdoor Removal Performance

Table 6 reports the overall backdoor removal performance under the hybrid spatio-temporal trigger, which is the most difficult attack considered in our evaluation because it simultaneously exploits spatial shortcut features and delayed spike timing. The compromised federated SNN maintains high clean accuracy but also exhibits a very high attack success rate, showing that the injected backdoor is effective and stealthy. Fine-tuning on the clean calibration set slightly reduces ASR , but the reduction is limited because the calibration set does not contain triggered samples and therefore provides weak evidence about the hidden malicious pathway. Fine-pruning performs better than fine-tuning on N-MNIST, where the trigger-related neurons are relatively sparse, but its clean accuracy decreases more clearly on CIFAR10-DVS and DVS Gesture because removing low-activity channels also damages useful event-driven representations. ANP obtains stronger ASR reduction by suppressing sensitive neurons, but its perturbation criterion is not explicitly temporal and therefore tends to either miss delayed trigger pathways or over-suppress benign high-response neurons.
Table 6. Overall performance under the hybrid spatio-temporal trigger. The best sanitized result in each dataset is marked in bold. θ ★ denotes the compromised federated model before removal.
FedTSR achieves the best balance between clean performance preservation and backdoor removal. On CIFAR10-DVS, FedTSR reduces ASR from 94.8 % to 7.6 % while keeping ACC at 70.3 % , which is only 1.5 percentage points lower than the compromised model. On DVS Gesture, where long temporal dependencies are more important, FedTSR reduces ASR from 91.5 % to 6.9 % and preserves 94.5 % clean accuracy. These results support the central claim of this paper: backdoor behavior in federated SNNs can be removed more effectively when the defense directly analyzes temporal synaptic risk rather than relying only on static activation magnitude or parameter sensitivity.
Table 7 adds standard deviations, a paired-test statistic, and an SNN-specific baseline. TMPBD + NDSBM is competitive because it uses temporal membrane evidence, but FedTSR obtains lower ASR in the tested settings because it estimates hidden-layer synaptic risk and then recalibrates spike consistency. Because each comparison uses only three paired seeds, the p-values are interpreted as indicative support rather than definitive statistical proof of superiority. We therefore base our conclusion mainly on the magnitude and consistency of the ACC/ASR differences, and we explicitly list the small seed budget as a limitation in Section 5.5.
Table 7. Statistical reporting and SNN-aware baseline comparison under the hybrid trigger. The p-value compares FedTSR with ANP on ASR using three paired seeds and is interpreted as indicative rather than definitive.
We also compare with a stronger training-time federated backdoor defense in Table 8. FLAME reduces the backdoor during aggregation, but it requires modifying federated training and observing client updates. FedTSR remains applicable when only the final compromised SNN is available, and it can also be combined with FLAME.
Table 8. Comparison with a training-time robust aggregation defense on CIFAR10-DVS under the hybrid trigger.
To examine whether the advantage of FedTSR is specific to one trigger type, Table 9 compares the average results over the four datasets under static patch, temporal burst, and hybrid triggers. The static patch trigger is easier to mitigate because its spatial footprint repeatedly appears across all timesteps, making suspicious channels more visible to pruning-based defenses. The temporal burst trigger is harder because its malicious behavior is concentrated in a short interval and can be hidden by normal firing sparsity. The hybrid trigger is the hardest because it creates a spatially localized pathway that becomes highly influential only during selected timesteps. FedTSR remains effective across all three settings because the temporal concentration score A l , g captures short-window amplification, the firing deviation score B l , g captures abnormal population-level behavior, and the class-response concentration score D l , g captures target-class shortcut tendency.
Table 9. Average clean accuracy and attack success rate across the four datasets under different trigger types. Results are averaged over N-MNIST, CIFAR10-DVS, DVS Gesture, and CIFAR-10.
Figure 3 visualizes the average ASR under the hybrid trigger. The bars show that ordinary fine-tuning leaves a substantial portion of the backdoor intact, while fine-pruning and NAD reduce the attack more aggressively but still retain non-negligible malicious behavior. ANP is stronger, but its remaining ASR is still more than twice that of FedTSR. The damping-only variant already performs competitively, indicating that TSRE successfully localizes high-risk synaptic groups. The full FedTSR further improves performance because SCR restores clean temporal statistics without allowing risky groups to recover their original strength.
Figure 3. Average attack success rate under the hybrid trigger. Bars from left to right correspond to the compromised model, fine-tuning, fine-pruning, NAD, ANP, FedTSR with damping only, and full FedTSR. Lower values indicate stronger backdoor removal.
Figure 4 further shows the clean accuracy and attack success rate trade-off on CIFAR10-DVS. A desirable defense should move toward the lower-right region, where ACC is high and ASR is low. Fine-tuning remains close to the compromised model in terms of ASR , while fine-pruning and ANP move downward but also shift left because of clean accuracy degradation. FedTSR is located closest to the desired region, confirming that temporal synaptic risk estimation removes the malicious pathway more selectively. This trade-off is particularly important for event-based recognition, where clean accuracy can be sensitive to small changes in firing dynamics.
Figure 4. Clean accuracy and attack success rate trade-off on CIFAR10-DVS under the hybrid trigger. Each point denotes one repaired model, with the method name printed next to the point. A better defense appears closer to the lower-right region because it preserves clean accuracy while reducing attack success rate.
Beyond ACC and ASR, Table 10 reports clean loss, target-class confidence on triggered non-target samples, and benign distribution-shift robustness under event jitter. FedTSR lowers target-class confidence while keeping clean loss and benign-shift accuracy close to the compromised model.
Table 10. Additional metrics under the hybrid trigger. Event jitter randomly shifts event timestamps by at most one bin during testing.
The results in Table 6 and Table 9, Figure 3 and Figure 4 jointly demonstrate that FedTSR improves post-training backdoor removal in both event-based and rate-coded SNNs. The improvement is not caused by simply reducing model capacity, because the damping-only variant already lowers ASR substantially and SCR then recovers clean performance. Instead, the advantage comes from matching the defense mechanism to the temporal nature of SNN computation. This explains why FedTSR is especially effective against temporal burst and hybrid triggers, where static defenses have difficulty distinguishing malicious spike pathways from benign sparse firing.

5.3. Ablation Study and Sensitivity Analysis

This subsection studies which components of FedTSR are responsible for the observed backdoor removal performance. We conduct the analysis on CIFAR10-DVS and DVS Gesture under the hybrid trigger because these two datasets contain genuine event streams and require meaningful temporal integration. Unless otherwise stated, the settings follow Table 4. The ablation results are summarized in Table 11. Removing temporal concentration A l , g weakens the defense against delayed triggers because the sanitization procedure can no longer identify groups whose contribution is concentrated in a narrow time window. Removing firing deviation B l , g makes the method less sensitive to abnormal population-level firing, which increases ASR , especially on CIFAR10-DVS. Removing class-response concentration D l , g also increases ASR because target-class shortcut pathways are not sufficiently penalized. The largest degradation occurs when SCR is removed entirely, which indicates that damping alone can suppress the malicious pathway but cannot fully restore benign temporal dynamics. These results validate the design choice in Section 4.2: the three risk components provide complementary evidence and should be used jointly.
Table 11. Ablation results of FedTSR components under the hybrid trigger. The complete method combines temporal concentration A l , g , firing deviation B l , g , class-response concentration D l , g , and spike-consistency recalibration.
To test whether TSRE localizes malicious pathways rather than merely damping capacity, Table 12 reports a controlled diagnostic in which poisoning is restricted to a known subset of synaptic groups. A group is counted as detected when its risk score is in the top 10% of the corresponding layer. The results show high precision and recall, with temporal and hybrid triggers producing the clearest high-risk concentration.
Table 12. False-positive/false-negative diagnostic for TSRE risk localization under controlled group-limited poisoning.
Table 13 gives the requested per-trigger ablation. Removing A l , g hurts temporal-burst and hybrid triggers most, while removing D l , g hurts static and hybrid triggers because target-class shortcut evidence is no longer explicitly penalized.
Table 13. Per-trigger ablation on the average of CIFAR10-DVS and DVS Gesture. Entries are ASR after repair.
Table 14 reports the sensitivity of FedTSR to the calibration size | D c | and damping strength γ . FedTSR remains effective even with 100 clean calibration samples, reducing ASR on CIFAR10-DVS from 94.8 % to 13.9 % . Increasing | D c | improves both risk estimation and recalibration because the clean temporal statistics become more stable. However, the gain becomes modest when | D c | exceeds 500, which suggests that FedTSR does not require a large trusted dataset. The damping strength γ controls the aggressiveness of synaptic suppression. A small γ leaves part of the backdoor pathway active, while an overly large γ can damage clean representations. The default value γ = 0.65 provides the best average trade-off in this sensitivity analysis, and it is therefore used in the main experiments.
Table 14. Sensitivity of FedTSR to calibration size and damping strength on CIFAR10-DVS under the hybrid trigger. When one factor is varied, the other factor follows the default setting in Table 4.
Table 15 analyzes calibration-set composition and FedTSR-aware attack stress cases. FedTSR is stable with 1% accidental contamination but degrades under 5% contamination, severe class imbalance, or distribution shift, confirming that calibration quality is an important assumption. The adaptive benign-mimic trigger is trained with an auxiliary penalty that encourages triggered samples to match clean temporal entropy and layer-level firing means on the malicious clients. This attack directly targets the TSRE assumptions, so the residual ASR is higher than in the default hybrid setting. Nevertheless, FedTSR still reduces the attack substantially, and the result clarifies the boundary of the trigger-agnostic claim: FedTSR does not require trigger knowledge, but it is not certified against an attacker that can make malicious temporal statistics indistinguishable from benign ones.
Table 15. Calibration-set and attack stress tests on CIFAR10-DVS under the hybrid trigger unless otherwise stated.
Table 16 extends the calibration-size analysis to DVS Gesture and temporal-burst triggers. Longer temporal dependencies and hybrid triggers require more calibration samples, but the marginal gain still saturates near 500 samples.
Table 16. Calibration size versus trigger complexity. Entries are ACC/ASR after FedTSR.
Table 17 studies risk-score weights and surrogate-gradient choices on CIFAR10-DVS. FedTSR is not tied to a particular surrogate derivative, and the equal-weight default is close to the learned-coefficient variant.
Table 17. Sensitivity to risk-score weights and surrogate gradients on CIFAR10-DVS under the hybrid trigger.
Figure 5 visualizes the contribution of the three risk scores on CIFAR10-DVS. The figure reports ASR after sanitization when different combinations of A l , g , B l , g , and D l , g are used to construct R l , g . Using any single component improves over ordinary fine-tuning, but no single component is sufficient. The pair ( A l , g , D l , g ) is stronger than the other two-component combinations because hybrid triggers are both temporally concentrated and target-class oriented. The full combination is still best because B l , g suppresses groups whose firing rate deviates abnormally from the layer population. This confirms that FedTSR benefits from estimating risk from multiple temporal and semantic views rather than relying on one heuristic.
Figure 5. Effect of risk score construction on CIFAR10-DVS under the hybrid trigger. Bars from left to right show fine-tuning, single-component TSRE, two-component TSRE, and full TSRE using A l , g , B l , g , and D l , g . Lower attack success rate means stronger removal.
Figure 6 plots the relationship between γ , clean accuracy, and attack success rate on CIFAR10-DVS. The curve shows that increasing γ monotonically decreases ASR in the tested range because more high-risk synaptic contribution is suppressed. However, clean accuracy remains stable only before the damping becomes too aggressive. When γ = 0.95 , ASR is slightly lower than at γ = 0.65 , but the clean accuracy drop becomes much larger. This behavior explains why FedTSR uses soft damping rather than binary pruning: suppressing suspicious groups is necessary, but preserving enough residual capacity is equally important for maintaining normal spike-based inference.
Figure 6. Sensitivity to damping strength on CIFAR10-DVS. The solid circle-marked curve denotes clean accuracy, and the dashed square-marked curve denotes attack success rate; both values are measured after full FedTSR recalibration under the hybrid trigger.
The ablation evidence in Table 11 and Table 14, and Figure 5 and Figure 6 indicates that FedTSR is not a simple fine-tuning or pruning procedure. Its performance comes from a coupled mechanism: TSRE identifies temporally suspicious synaptic groups, damping weakens their contribution, and SCR preserves the benign firing regime. The sensitivity analysis also shows that FedTSR is practical when only a small calibration set is available, which is important for federated settings where the server rarely owns abundant, clean data.

5.4. Robustness to Federated Heterogeneity and Sanitization Efficiency

We further evaluate whether FedTSR remains reliable when the federated system becomes more heterogeneous or more severely poisoned. This analysis is important because the server-side defender observes only the final global model θ ★ and the clean calibration set D c ; it cannot directly inspect the distribution shift among clients. We first vary the Dirichlet concentration parameter ξ used for label partitioning. Smaller ξ produces stronger non-IID data allocation and therefore makes malicious updates harder to separate from benign client drift. Table 18 reports results on CIFAR10-DVS and DVS Gesture under the hybrid trigger. FedTSR consistently reduces ASR to below 10 % in all tested non-IID settings, including the severe case ξ = 0.1 . In contrast, ANP becomes less stable when the data distribution is highly skewed, because neuron sensitivity under non-IID training may reflect benign client specialization rather than backdoor behavior. FedTSR is more robust because it does not rely on static sensitivity alone; it jointly considers temporal concentration, firing deviation, and class-response concentration.
Table 18. Robustness to federated data heterogeneity under the hybrid trigger. Smaller Dirichlet concentration ξ indicates stronger non-IID client distributions.
We next vary the malicious-client ratio m = | A | / K while keeping the local poisoning ratio fixed at ρ = 0.2 . Figure 7 shows the resulting ASR on CIFAR10-DVS. As m increases, the compromised model rapidly becomes more strongly backdoored, and ANP also leaves a larger residual attack success rate. FedTSR degrades more gracefully: even when 30 % of clients are malicious, its repaired model keeps ASR at 16.8 % , substantially below the corresponding ANP result. This trend indicates that the temporal risk mask π l , g remains informative even when poisoned updates occupy a larger fraction of the federated aggregation process.
Figure 7. Attack success rate on CIFAR10-DVS when the malicious-client ratio changes. The dotted triangle curve denotes the compromised model, the dashed square curve denotes ANP, and the solid circle curve denotes FedTSR.
Table 19 reports absolute runtime and memory on all datasets. The energy proxy is computed as wall-clock time multiplied by the measured average GPU power during repair; it is intended only as a hardware-specific efficiency indicator, not as a neuromorphic hardware measurement.
Table 19. Absolute repair runtime and peak GPU memory. Entries are seconds/GB.
Table 20 compares the repair cost of different defenses on CIFAR10-DVS. The cost is normalized by the full FedTSR repair cost, so a value below 1.00 means faster repair than FedTSR and a value above 1.00 means higher repair cost. The damping-only variant is the fastest because it requires only temporal statistic collection and risk-adaptive weight damping, but it does not recover clean accuracy as well as full FedTSR. ANP has a larger cost because it searches for sensitive neurons through adversarial perturbation before calibration. Full federated retraining can obtain a low ASR if all clients are available and clean collaboration is restarted, but it requires new communication rounds and violates the post-training repair assumption. FedTSR achieves the best practical balance because it needs no client communication and keeps both repair cost and clean accuracy degradation modest.
Table 20. Sanitization efficiency on CIFAR10-DVS under the hybrid trigger. Relative repair cost is normalized by the cost of full FedTSR. Communication rounds count additional rounds required after the compromised model θ ★ has already been obtained.
Figure 8 visualizes the normalized repair cost of server-side defenses in Table 20. The figure excludes clean federated retraining because its cost is far outside the scale of post-training repair methods. The comparison shows that FedTSR is substantially cheaper than ANP while achieving a lower ASR in Table 20. This efficiency advantage comes from the grouped risk estimation strategy: FedTSR collects temporal statistics in a small number of calibration passes and then updates the model using risk-gated gradients instead of repeatedly searching over vulnerable neurons.
Figure 8. Normalized repair cost of server-side defenses on CIFAR10-DVS. Bars from left to right denote fine-tuning, fine-pruning, NAD, ANP, FedTSR with damping only, and full FedTSR; lower bars indicate faster post-training repair.
The robustness and efficiency results in Table 18 and Table 20, and Figure 7 and Figure 8 show that FedTSR is suitable for the intended federated neuromorphic deployment scenario. It remains effective under strong non-IID data partitioning and increased malicious-client ratios, while requiring no new client communication after θ ★ is obtained. Combined with the ablation analysis in Section 5.3, these results suggest that temporal synaptic risk estimation provides a practical and selective alternative to expensive retraining or static neuron suppression.

5.5. Discussion and Limitations

FedTSR is designed for fast server-side repair after federated training, so its threat model is intentionally different from training-time robust aggregation. The method depends on a reasonably clean and representative calibration set. Table 15 shows that small accidental contamination can be tolerated, but severe contamination or distribution shift degrades both risk estimation and SCR. FedTSR also does not provide a certified guarantee against adaptive attackers that explicitly optimize triggers to match benign temporal statistics; the benign-mimic trigger in Table 15 is the hardest case in our evaluation. More broadly, the trigger-agnostic claim means that FedTSR does not use trigger identity, target label, or malicious-client information during repair; it does not mean that every possible adaptive trigger family has been exhausted.
There are also evaluation limitations. The main results use three random seeds, and Table 7 reports standard deviations and paired tests, but a larger seed budget would further strengthen statistical confidence. All runtime and memory values in Table 19 are measured on a GPU-based software simulator; we have not validated the repair process on neuromorphic hardware, where membrane discretization, event routing, and quantized synapses may change the effectiveness of damping. Finally, FedTSR assumes a synchronous final global model. It can be applied to checkpoints from asynchronous or partial-participation federated learning, but additional analysis is needed when stale updates, client dropout, or extremely severe non-IID partitions create benign temporal patterns that resemble backdoor shortcuts.

6. Conclusions

This paper studied fast post-training backdoor removal for spiking neural networks trained through federated learning, where the defender only has access to a possibly compromised global model θ ★ and a small clean calibration set D c . We proposed FedTSR, a trigger-agnostic and client-independent sanitization framework that exploits the temporal nature of SNN computation. FedTSR first estimates group-wise temporal synaptic risk by combining temporal concentration A l , g , firing deviation B l , g , and class-response concentration D l , g , then converts the resulting score R l , g into a continuous risk mask π l , g for risk-adaptive damping. To avoid damaging benign event-driven representations, FedTSR further performs spike-consistency recalibration with clean-label supervision, output consistency, membrane-and-spike temporal alignment, and risk anchoring. In the evaluated settings, experiments on N-MNIST, CIFAR10-DVS, DVS Gesture, and CIFAR-10 show that FedTSR consistently reduces attack success rate under static, temporal, and hybrid backdoor triggers while preserving clean accuracy, and the ablation studies support the importance of both temporal risk estimation and spike-consistency recalibration. These results indicate that backdoor removal in federated SNNs should not treat the model as a static neural network, but should explicitly sanitize timestep-wise synaptic pathways and preserve benign spike dynamics. Future work may extend this framework to asynchronous federated neuromorphic systems, continual SNN learning, and certified robustness analysis for event-driven backdoor defense. These empirical findings are limited to the evaluated threat models and do not constitute certified robustness against all adaptive attacks, as discussed in Section 5.5.

Author Contributions

Methodology, B.W. and T.L.; Software, B.W. and T.L.; Formal analysis, T.L.; Investigation, T.L.; Data curation, B.W. and T.L.; Writing—original draft, B.W. and T.L.; Writing—review & editing, B.W. and T.L.; Visualization, T.L. All authors have read and agreed to the published version of the manuscript.

Funding

This work wes supported by: (1). Guangdong University of Science and Technology Fund “Big Data and Digital BusinessInnovation Research Team” (GKY-2022CQTD-10); (2). Fund: Philosophy and Social Sciences Project of Guangdong Province in 202(GD24XGL018) Guangdong Provincial Decision Consulting Research Base “Supply Chain Digital InnovationResearch Center”; (3). Guangdong Provincial Science and Technology Department Yue-Guan Joint Fund (2023A1515140047).

Data Availability Statement

The datasets used in this study are publicly available, and their sources are listed in Table 3.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Wu, Y.; Deng, L.; Li, G.; Zhu, J.; Shi, L. Spatio-Temporal Backpropagation for Training High-Performance Spiking Neural Networks. Front. Neurosci. 2018, 12, 331. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  2. Neftci, E.O.; Mostafa, H.; Zenke, F. Surrogate Gradient Learning in Spiking Neural Networks: Bringing the Power of Gradient-Based Optimization to Spiking Neural Networks. IEEE Signal Process. Mag. 2019, 36, 51–63. [Google Scholar] [CrossRef] [Scilit]
  3. Eshraghian, J.K.; Ward, M.; Neftci, E.O.; Wang, X.; Lenz, G.; Dwivedi, G.; Bennamoun, M.; Jeong, D.S.; Lu, W.D. Training Spiking Neural Networks Using Lessons from Deep Learning. Proc. IEEE 2023, 111, 1016–1054. [Google Scholar] [CrossRef] [Scilit]
  4. Zhou, C.; Zhang, H.; Yu, L.; Ye, Y.; Zhou, Z.; Huang, L.; Ma, Z.; Fan, X.; Zhou, H.; Tian, Y. Direct Training High-Performance Deep Spiking Neural Networks: A Review of Theories and Methods. Front. Neurosci. 2024, 18, 1383844. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  5. Li, Y.; Zhao, F.; Zhao, D.; Zeng, Y. Directly Training Temporal Spiking Neural Network with Sparse Surrogate Gradient. Neural Netw. 2024, 177, 106499. [Google Scholar] [CrossRef] [Scilit]
  6. Guo, Y.; Chen, Y.; Hao, Z.; Peng, W.; Jie, Z.; Zhang, Y.; Liu, X.; Ma, Z. Take a Shortcut Back: Mitigating the Gradient Vanishing for Training Spiking Neural Networks. Adv. Neural Inf. Process. Syst. 2024, 37, 24849–24867. [Google Scholar] [CrossRef] [Scilit]
  7. McMahan, H.B.; Moore, E.; Ramage, D.; Hampson, S.; y Arcas, B.A. Communication-Efficient Learning of Deep Networks from Decentralized Data. In Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS) 2017, Fort Lauderdale, FL, USA, 20–22 April 2017; pp. 1273–1282. [Google Scholar]
  8. Kairouz, P.; McMahan, H.B.; Avent, B.; Bellet, A.; Bennis, M.; Bhagoji, A.N.; Bonawitz, K.; Charles, Z.; Cormode, G.; Cummings, R.; et al. Advances and Open Problems in Federated Learning. Found. Trends Mach. Learn. 2021, 14, 1–210. [Google Scholar] [CrossRef] [Scilit]
  9. Venkatesha, Y.; Kim, Y.; Tassiulas, L.; Panda, P. Federated Learning With Spiking Neural Networks. IEEE Trans. Signal Process. 2021, 69, 6183–6194. [Google Scholar] [CrossRef] [Scilit]
  10. Wang, Y.; Duan, S.; Chen, F. Efficient Asynchronous Federated Neuromorphic Learning of Spiking Neural Networks. Neurocomputing 2023, 557, 126686. [Google Scholar] [CrossRef] [Scilit]
  11. Xie, X.; Feng, J.; Liu, G.; Zhan, Q.; Liu, Z.; Zhang, M. Federated Learning for Spiking Neural Networks by Hint-Layer Knowledge Distillation. Appl. Soft Comput. 2024, 163, 111901. [Google Scholar] [CrossRef] [Scilit]
  12. Abbasihafshejani, M.; Maiti, A. Spiking Neural Networks in Vertical Federated Learning: Performance Trade-Offs. arXiv 2024, arXiv:2407.17672. [Google Scholar]
  13. Aouedi, O.; Piamrat, K. SURFS: Sustainable IntrUsion Detection with HieraRchical Federated Spiking Neural Networks. In Proceedings of the IEEE International Conference on Communications; IEEE: New York, NY, USA, 2024; pp. 2173–2178. [Google Scholar]
  14. Gu, T.; Dolan-Gavitt, B.; Garg, S. BadNets: Identifying Vulnerabilities in the Machine Learning Model Supply Chain. arXiv 2017, arXiv:1708.06733. [Google Scholar]
  15. Liu, Y.; Ma, S.; Aafer, Y.; Lee, W.C.; Zhai, J.; Wang, W.; Zhang, X. Trojaning Attack on Neural Networks. In Proceedings of the Network and Distributed System Security Symposium; Internet Society: Fredericksburg, VA, USA, 2018. [Google Scholar]
  16. Bagdasaryan, E.; Veit, A.; Hua, Y.; Estrin, D.; Shmatikov, V. How To Backdoor Federated Learning. In Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, Online, 26–28 August 2020; pp. 2938–2948. [Google Scholar]
  17. Xie, C.; Huang, K.; Chen, P.Y.; Li, B. DBA: Distributed Backdoor Attacks against Federated Learning. In Proceedings of the International Conference on Learning Representations, Virtual, 26 April–1 May 2020. [Google Scholar]
  18. Sun, Z.; Kairouz, P.; Suresh, A.T.; McMahan, H.B. Can You Really Backdoor Federated Learning? arXiv 2019, arXiv:1911.07963. [Google Scholar]
  19. Li, H.; Ye, Q.; Hu, H.; Li, J.; Wang, L.; Fang, C.; Shi, J. 3DFed: Adaptive and Extensible Framework for Covert Backdoor Attack in Federated Learning. In Proceedings of the IEEE Symposium on Security and Privacy; IEEE: New York, NY, USA, 2023; pp. 1893–1907. [Google Scholar]
  20. Zhang, H.; Jia, J.; Chen, J.; Lin, L.; Wu, D. A3FL: Adversarially Adaptive Backdoor Attacks to Federated Learning. Adv. Neural Inf. Process. Syst. 2023, 36, 61213–61233. [Google Scholar] [CrossRef] [Scilit]
  21. Li, M.; Wan, W.; Ning, Y.; Hu, S.; Xue, L.; Zhang, L.Y.; Wang, Y. DarkFed: A Data-Free Backdoor Attack in Federated Learning. In Proceedings of the IJCAI ’24: Thirty-Third International Joint Conference on Artificial Intelligence, Jeju, Republic of Korea, 3–9 August 2024; pp. 4447–4455. [Google Scholar]
  22. Shi, C.; Ji, S.; Pan, X.; Zhang, X.; Zhang, M.; Yang, M.; Zhou, J.; Yin, J.; Wang, T. Towards Practical Backdoor Attacks on Federated Learning Systems. IEEE Trans. Dependable Secur. Comput. 2024, 21, 5431–5447. [Google Scholar] [CrossRef] [Scilit]
  23. Li, Y.; Zhao, Y.; Zhu, C.; Zhang, J. Infighting in the Dark: Multi-Label Backdoor Attack in Federated Learning. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition; IEEE: New York, NY, USA, 2025. [Google Scholar]
  24. Abad, G.; Ersoy, O.; Picek, S.; Urbieta, A. Sneaky Spikes: Uncovering Stealthy Backdoor Attacks in Spiking Neural Networks with Neuromorphic Data. In Proceedings of the Network and Distributed System Security Symposium, San Diego, CA, USA, 26 February–1 March 2024. [Google Scholar]
  25. Riaño, R.; Abad, G.; Picek, S.; Urbieta, A. Flashy Backdoor: Real-World Environment Backdoor Attack on SNNs with DVS Cameras. arXiv 2024, arXiv:2411.03022. [Google Scholar]
  26. Abad, G.; Picek, S.; Urbieta, A. Time-Distributed Backdoor Attacks on Federated Spiking Learning. arXiv 2024, arXiv:2402.02886. [Google Scholar]
  27. Fu, H.; Li, G.; Wu, J.; Li, J.; Lin, X.; Zhou, K.; Liu, Y. SpikeWhisper: Temporal Spike Backdoor Attacks on Federated Neuromorphic Learning over Low-Power Devices. arXiv 2024, arXiv:2403.18607. [Google Scholar]
  28. Wang, B.; Yao, Y.; Shan, S.; Li, H.; Viswanath, B.; Zheng, H.; Zhao, B.Y. Neural Cleanse: Identifying and Mitigating Backdoor Attacks in Neural Networks. In Proceedings of the IEEE Symposium on Security and Privacy; IEEE: New York, NY, USA, 2019; pp. 707–723. [Google Scholar]
  29. Liu, K.; Dolan-Gavitt, B.; Garg, S. Fine-Pruning: Defending Against Backdooring Attacks on Deep Neural Networks. In Proceedings of the International Symposium on Research in Attacks, Intrusions, and Defenses; Springer International Publishing: Cham, Switzerland, 2018; pp. 273–294. [Google Scholar]
  30. Li, Y.; Lyu, X.; Koren, N.; Lyu, L.; Li, B.; Ma, X. Neural Attention Distillation: Erasing Backdoor Triggers from Deep Neural Networks. In Proceedings of the International Conference on Learning Representations, Online, 3–7 May 2021. [Google Scholar]
  31. Wu, D.; Wang, Y. Adversarial Neuron Pruning Purifies Backdoored Deep Models. Adv. Neural Inf. Process. Syst. 2021, 34, 16913–16925. [Google Scholar]
  32. Xu, X.; Liu, Z.; Koffas, S.; Yu, S.; Picek, S. BAN: Detecting Backdoors Activated by Adversarial Neuron Noise. Adv. Neural Inf. Process. Syst. 2024, 37, 114348–114373. [Google Scholar] [CrossRef] [Scilit]
  33. Bi, X.; Li, X. Securing Federated Learning Against Backdoor Threats with Foundation Model Integration. arXiv 2024, arXiv:2410.17573. [Google Scholar]
  34. Chen, P.; Xiang, H.; Du, X.; Xu, X.; Jiang, X.; Lu, Z.; Yang, J.; Duan, Q.; Dou, W. Universal Backdoor Defense via Label Consistency in Vertical Federated Learning. In Proceedings of the International Joint Conference on Artificial Intelligence, Montreal, QC, Canada, 16–22 August 2025. [Google Scholar]
  35. Li, J.; Wu, B.; Xia, X.; Liu, X.; Yi, X.; Zhang, X. Unsupervised Backdoor Detection and Mitigation for Spiking Neural Networks. arXiv 2025, arXiv:2510.06629. [Google Scholar] [CrossRef] [Scilit]
  36. Nguyen, T.D.; Nguyen, T.M.; Nguyen, P.L.; Pham, H.H.; Doan, K.D.; Wong, K.S. Backdoor Attacks and Defenses in Federated Learning: Survey, Challenges and Future Research Directions. Eng. Appl. Artif. Intell. 2024, 127, 107166. [Google Scholar]
  37. Li, Z.; Lan, J.; Yan, Z.; Gelenbe, E. Backdoor Attacks and Defense Mechanisms in Federated Learning: A Survey. Inf. Fusion 2025, 123, 103248. [Google Scholar] [CrossRef] [Scilit]
  38. Jin, L.; Lin, M.; Jiang, W.; Zhan, J. Data Poisoning-Based Backdoor Attack Framework Against Supervised Learning Rules of Spiking Neural Networks. arXiv 2024, arXiv:2409.15670. [Google Scholar]
  39. Nguyen, T.D.; Rieger, P.; Chen, H.; Yalame, H.; Möllering, H.; Fereidooni, H.; Marchal, S.; Miettinen, M.; Mirhoseini, A.; Zeitouni, S.; et al. FLAME: Taming Backdoors in Federated Learning. In Proceedings of the 31st USENIX Security Symposium (USENIX Security 22), Boston, MA, USA; USENIX-The Advanced Computing Systems Association: San Francisco, CA, USA, 2022; pp. 1415–1432. [Google Scholar]
  40. Rezaei, H.; Taheri, R.; Jordanov, I.; Shiaeles, S. Adapt-LFA: Adaptive Gradient-Guided Label Flipping Attack Against Federated Learning-based Intrusion Detection in IoT. In Proceedings of the 2025 IEEE International Conference on Cyber Security and Resilience (CSR); IEEE: New York, NY, USA, 2025; pp. 407–412. [Google Scholar] [CrossRef] [Scilit]
  41. Orchard, G.; Cohen, G.; Jayawant, A.; Thakor, N. Converting Static Image Datasets to Spiking Neuromorphic Datasets Using Saccades. Front. Neurosci. 2015, 9, 437. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  42. Li, H.; Liu, H.; Ji, X.; Li, G.; Shi, L. CIFAR10-DVS: An Event-Stream Dataset for Object Classification. Front. Neurosci. 2017, 11, 309. [Google Scholar] [PubMed]
  43. Amir, A.; Taba, B.; Berg, D.; Melano, T.; McKinstry, J.; di Nolfo, C.; Nayak, T.; Andreopoulos, A.; Garreau, G.; Mendoza, M.; et al. A Low Power, Fully Event-Based Gesture Recognition System. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition; IEEE: New York, NY, USA, 2017; pp. 7388–7397. [Google Scholar]
  44. Krizhevsky, A. Learning Multiple Layers of Features from Tiny Images; Technical Report; University of Toronto: Toronto, ON, Canada, 2009. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.