Submitted:
02 October 2026
Posted:
05 October 2026
You are already at the latest version
Abstract
For targeted backdoor attacks against power-load time-series classification models, attackers can exploit covert temporal triggers to misclassify genuine high-load states as low-load states, leading to issues such as underestimation of load risks and failure of alarms. Since trigger effects may vary across different network modules, existing methods,such as pruning, fine-tuning, and unlearning,typically apply a one-size-fits-all approach, making it difficult to balance backdoor suppression with the accurate identification of normal loads. To the best of our knowledge, this paper is the first to systematically investigate backdoor defense in this scenario, focusing primarily on local time-domain triggers and verifying the method’s applicability under frequency-domain attack conditions. To this end, we propose PRISM-TS, a proxy-trigger-guided personalized backdoor defense method. This method utilizes independent proxy triggers to assess module backdoor sensitivity and jointly selects high-risk modules under clean accuracy constraints. Differentiated cleansing strategies are applied to different modules: high-risk modules are replaced with corresponding modules from the clean reference model, while the remaining modules undergo weighted averaging between the clean and backdoor models. In random time-domain attack experiments on the AEP dataset, PRISM-TS reduced the attack success rate to 2.53% while maintaining a clean accuracy of 95.72% and a high-load retention rate of 89.62%. Frequency-domain extension experiments further demonstrate that this method offers effective defense capabilities.
Keywords:
power-load time-series classification
; targeted backdoor attack
; backdoor defense
; proxy trigger
; module-level purification
1. Introduction
Power load time-series classification is a key foundation for grid monitoring, load-state identification, and operational decisions. In recent years, deep models such as one-dimensional convolutional networks, recurrent networks, and residual networks have been widely used in time-series classification and representation learning [1,2,3,4,5,6]. With the gradual application of such models in load early warning and dispatching auxiliary systems [12,13], the prediction results begin to affect the perception and risk judgment of power grid operation. Model security and reliability are now important concerns.
Training data poisoning can implant hidden time-domain or frequency-domain trigger patterns into load time series [18,19,20,21,22,23]. These triggers enable a model to maintain high classification performance on clean samples, but misjudges the real high-load states as low-load states when the trigger appears [14,15,16,17]. which leads to underestimation of load risk, alarm failure and inaccurate operation decision. The impact of triggers on different network modules may be different : some modules produce more significant response changes under trigger conditions, which may have a greater impact on backdoor prediction ; other modules are mainly responsible for normal load feature extraction and category discrimination. At the same time, it is usually difficult for defenders to obtain the original trigger used by the attacker and its precise configuration. Therefore, how to identify the module-level backdoor risk under limited trusted information and maintain the normal load identification ability while suppressing the backdoor behavior is the key problem faced by the backdoor defense of power load time series.
Existing backdoor defense methods mainly include fine-tuning, knowledge distillation, structural pruning, parameter resetting, and adversarial unlearning [27,28,29,30,31,32,33]. Although some methods perform selective repair based on neuron activations, parameter importance, or structural features, they do not fully exploit the risk differences among modules under triggered conditions. They also rarely apply different purification methods or processing intensities according to module-specific risks. If risk estimation is inaccurate or purification is insufficient, backdoor-related modules may retain malicious behavior. Conversely, overly broad processing may damage normal load representations, reducing clean classification accuracy and high-load state recognition. In addition, some methods rely on known attack samples or trigger information, which limits their applicability when the original trigger configuration is unknown or changes.Therefore, a module-risk assessment mechanism is needed that does not depend on the precise configuration of the original trigger. Such a mechanism should support differentiated purification according to module-specific risks and provide a better balance between backdoor suppression and normal-task preservation.
To tackle these problems, we propose PRISM-TS (Proxy-Trigger-Guided Risk-Aware Personalized Module Purification for Time-Series Models).In this paper, it is set that the defender can access the contaminated load classification model, the trusted clean calibration data and the same structure reference model based on the trusted data training, but it is impossible to obtain the the precise configuration of the attacker’s original trigger. The module-level purification problem of the backdoor model has become the core of the research. Based on this setting, PRISM-TS employs the characteristics of load time series to construct proxy triggers, without using the precise location, amplitude, random seed, or shape parameters of the original trigger. It analyzes the response changes of candidate module combinations under proxy-trigger conditions to estimate module-level backdoor sensitivity, and the key purification module is determined by combining the clean performance constraint. For the selected high-risk modules, the corresponding modules from the clean reference model are replaced to preferentially weaken the potential backdoor-related representations; For the remaining modules, the corresponding parameters of the clean reference model and the backdoored model are integrated with equal weights to reduce damage to normal load representations. Finally, the BatchNorm statistics are reestimated with trusted clean calibration data. This process reduces the feature-statistics shifts due to module purification, and balances backdoor suppression with normal task performance.
The main contributions of this paper are as follows:
1. We propose a framework named PRISM-TS, which is a proxy-triggered backdoor defense method for power load time-series classification. The framework does not need to use the precise configuration of the attacker 's original trigger. Instead, it estimates the module-level backdoor sensitivity based on changes in module responses under proxy-triggered conditions.
2. We propose a module combination search mechanism constrained by clean accuracy and a risk-aware hybrid purification strategy. High-risk modules are replaced with their corresponding modules from a clean reference model, and the remaining modules are fused with equal-weight parameters. This design adjusts the purification range and processing intensity according to the risk differences of each module.
3. We assess the performance of PRISM-TS under random time-domain backdoor attacks on the AEP power load dataset. The evaluation includes backdoor suppression, clean classification performance, and high-load state recognition. PRISM-TS reduces the ASR to 2.53% while keeping a CACC of 95.72% and an HLR of 89.62%. Ablation experiments further confirm the effects of proxy-trigger auditing, module-combination search, and hybrid purification. Moreover, frequency-domain experiments employ frequency-domain proxy triggers for module auditing and purification, as the original frequency-domain trigger configuration is unknown. These experiments assess the defense performance of PRISM-TS under frequency-domain attack settings, which are considered in this study.
2. Related Work
2.1. Power Load Time-Series Classification
Power-load time-series classification analyzes historical electricity consumption data to identify load states, monitor anomalies, and assess operational risks [12,13]. Early load-state identification mainly depends on manually engineered statistical and temporal features. In recent years, it has gradually shifted to automatic representation learning based on deep neural networks. With the development of deep learning, one-dimensional convolutional neural networks, recurrent neural networks, and residual networks have been used to model power load time series. These models can automatically extract features such as local fluctuations, periodic variations, and sequential dependencies [1,2,3]. More recently, the attention mechanism and Transformer structure have further enhanced the model 's ability to model long-term correlation information [7,8,9,10,11].
Existing studies mostly focus on classification accuracy, prediction performance, and feature extraction ability under normal data conditions, but they don't pay much attention to model security risks during training. Even if a deep model performs well on clean test samples, it might learn specific malicious input–output associations if the training data are poisoned. Therefore, it is difficult to judge whether the power load classification model contains potential backdoor behavior only based on the classification performance on normal samples.
2.2. Backdoor Attacks on Time Series
Backdoor attacks establish cover associations between specific trigger patterns and attacker-defined outputs by contaminaing training data or altering the training process [14,15,16]. Consequently, the model maintains normal performance on clean inputs but may produce targeted misclassifications when the trigger is present [9,10,11]. Unlike localized patches in images, time-series triggers can be encoded by their temporal position, duration, perturbation amplitude, variation pattern, or frequency components. They might also be mixed with local fluctuations and periodic changes in the original sequence, making them hard to detect [17,18,19,20].
Previous studies have shown time-series models are vulnerable to backdoor attacks [21,22,23]. For instance, BackTime is oriented to multivariate time-series forecasting and changes model predictions by finding vulnerable time positions and generating covert triggers[23]. Other studies have also revealed how trigger patterns propagate through time-series models and affect their predictions from the perspective of trigger detection, recovery, and interpretability analysis. These studies offer a basis for understanding the backdoor threats of time-series. But they mainly focus on multivariate time-series forecasting, general time-series classification, and backdoor detection. In contrast, the research on backdoor purification for power load state classification is still relatively limited, especially the lack of systematic research on the defense effect under local time domain triggering and frequency domain disturbance conditions.
2.3. Backdoor Defense Methods
Existing backdoor defense methods mostly include trusted-data-based repair, structural screening and pruning, and optimization-based or adversarial unlearning methods. These methods have different requirements for accessing trusted data, model parameters, neuron activations, training samples, and trigger information.
Trusted-data-based repair methods employs clean samples to modify the parameters or internal representations of a backdoored model. Clean Fine-Tuning uses trusted clean date to update model parameters, but it might not be enough to eliminate established backdoor mappings when clean data are limited [27]. Fine-Pruning combines low-activation neuron pruning with fine-tuning on clean data to weaken the influence of backdoor-related structures [27]. Neural Attention Distillation ( NAD ) learns the attention representation on clean samples through the knowledge distillation constraint model, thereby weakening the backdoor response [28]. The effectiveness of these methods relies on the quantity of trusted data, the scope of parameter updates, and the quality of the teacher model.
Structural defenses narrows the purification range by identifying and handling suspicious neurons or channels. Adversarial Neuron Pruning (ANP) uses adversarial perturbations to locate neurons sensitive to backdoor behavior [30]. Reconstructive Neuron Pruning (RNP) identifies suspicious structures by reconstructing neuron functions [33]. Channel Lipschitzness-based Pruning (CLP) performs selective pruning based on the Lipschitz characteristics of the channel [32]. Optimization-based and adversarial unlearning methods adjust model parameters to reduce abnormal associations between triggers and target classes. Implicit Backdoor Adversarial Unlearning (I-BAU) models backdoor purification as a bilevel optimization problem[31]. Anti-Backdoor Learning (ABL) employs the differences in model learning behavior on clean and poisoned samples to identify and weaken malicious associations [29]. ABL mainly operates during training, so it needs access to the corresponding training samples or training dynamics.
These methods are mainly designed for visual classification models. To compare their defense performance on power load time-series models, we adjust the operations of I-BAU, RNP, and CLP to the one-dimensional residual network used in this study. The methods are adapted and used as baseline defenses. This adaptation keeps the main defense mechanisms of the original methods, but the experimental results only assess their applicability to the power load classification task that is considered here. They do not mean that these methods were originally designed for this task.
Existing methods usually screen suspicious units based on clean-sample activations, parameter sensitivity, training dynamics, or structural features. But they seldom use changes in module responses under proxy-trigger conditions to evaluate module-level backdoor sensitivity. Moreover, selected neurons, channels, or parameters are usually processed via the same pruning, resetting, or updating operation. This uniform processing lacks the ability to differentiate the roles of different modules in the context of backdoor behavior and normal load representations.Under the defense setting in this paper, the defender can construct proxy-trigger patterns based on task-specific prior knowledge, but can not get the precise location, amplitude, and shape of the original trigger. Clean-sample information or structural statistics alone might not be enough to determine which modules are more sensitive to trigger conditions. If the purification scope is too narrow, residual backdoor responses might still be present. If all modules are processed with the same intensity, normal load representations might be damaged. Therefore, this study estimates the module-level backdoor sensitivity by analyzing proxy-trigger responses and selecting purification modules and purification intensity based on estimated module risks, without relying on the exact configuration of the original trigger.
3. Methodology
3.1. Power Load Time-Series Classification Task
Given a prediction time step t, construct the input window by using the historical multi-feature sequence from the previous T time steps:
In this study, the historical window length is set to T=168, meaning that data from the past 168 hours are used to predict the load state at the next time step. Each time step includes five input features: normalized load value, sine and cosine encodings of the hour-of-day cycle, and sine and cosine encodings of the day-of-week cycle; thus, C=5.
The power load classification model is defined as:
where represents the model parameters, and classes 0, 1, and 2 correspond to the low-load, normal-load, and high-load states, respectively. The labels are determined by quantile thresholds, which are computed from the training-set load values. The labels are determined using quantile thresholds computed from the training-set load values. Letand denote the lower and upper tertiles of the training-set load values, respectively. The class label at prediction time is then defined as:
Here, represents the actual load value at the prediction time t.
This paper employs a one-dimensional residual network to classify load states. The network consists of eight residual blocks, and each residual block contains two convolutional submodules, denoted by B-C1 and B-C2, where . Each convolutional submodule and its corresponding batch normalization layer are treated as an indivisible candidate module. Therefore, the network contains 16 candidate modules for the subsequent module-level auditing and purification.
3.2. Backdoor Attack and Defense Objectives
Let denote the backdoored model to be purified, and let denote a clean reference model with the same architecture. Here, and represent the parameters of the backdoored model and the clean reference model, respectively.During training process, the attacker injects a temporal trigger into a subset of high-load samples and changes their labels to the low-load class. Therefore, the backdoored model maintains high classification performance on clean samples, but it misclassifies high-load states as low-load states when the trigger is present.
This paper studies a targeted backdoor attack from the high-load class to the low-load class [14,15,21,22]. Let denote the attacker's original trigger. The source and target classes are denoted by and , respectively. The objective of the backdoor attack is formulated as follows.
The defender has access to a backdoored model to be purified, a clean reference model with the same architecture trained on complete trusted training data, and a trusted clean training window for BatchNorm calibration. But during module auditing, module-combination search, and purification-parameter selection of PRISM-TS, the defender lacks the exact location, perturbation amplitude, random seed, and encoding scheme of the attacker’s original trigger.To prevent using the same samples for module selection and evaluation, this paper divides the validation period into two subsets in chronological order. The first 60% is employed as the validation selection set for candidate module-combination search and rechecking under proxy-trigger conditions. The remaining 40% is designated as the post-selection evaluation set. This set is only used after the module set, parameter-fusion method, and BatchNorm calibration procedure have been determined. The attacker's original trigger is applied according to the evaluation protocol to compute the defense metrics. The original trigger is not employed for module localization, candidate ranking, hyperparameter selection, and model updating in PRISM-TS.
During the training of the base classification model, the complete validation period is employed to evaluate the classification performance and determine the optimal checkpoint. Therefore, the post-selection evaluation set is only independent of the defense decision process. It is not completely unseen during base-model training. BatchNorm running statistics are only reestimated using the trusted clean window of the training period. The test set is not employed for model training, module selection, and any other purification decisions. After the final defense model is determined, it is only used for final evaluation with the attacker’s original trigger according to the experimental evaluation protocol.This paper aims to reduce the attack success rate ( ASR ) while maintaining clean classification accuracy ( CACC ) and high load retention rate ( HLR ).The primary objective is to reduce the attack success rate (ASR) while maintaining clean accuracy (CACC) and the high-load retention rate (HLR).
The overall framework of PRISM-TS is shown in Figure 1.
3.3. Proxy-Trigger-Guided Joint Module Selection
Because the defender can not get the precise location, perturbation amplitude, and encoding pattern of the attacker’s original trigger, we create a random zigzag proxy trigger based on the known local time-domain trigger type for module auditing. The proxy trigger does not replicate the original attacker's encoding scheme. Instead, it employs alternating positive and negative perturbations within a local time period. Its length is fixed at 8 hours, and its injection position is shifted forward by at most 18 hours relative to the input window. The perturbation amplitude is randomly sampled between 1.5% and 3.5%. The proxy trigger is only used to evaluate the suppression effect of the candidate module combination on the trigger response. It is employed for module auditing and candidate-combination selection, but not for replicating the attacker's precise attack process. After the module combination is determined, the attacker's original trigger is employed for the final defense evaluation the post-selection evaluation set and the test set.
Let S denote a candidate module combination to be purified, and let denote the candidate model obtained after module purification and BatchNorm statistic recalibration based on S. Let denote the set of proxy-triggered samples from the source class y_s, and let denote the proxy trigger. The proxy attack success rate of the candidate model is defined as follows:
Here, denotes the indicator function. Its value is 1 when the condition in brackets is satisfied and 0 otherwise.
Let denote the attack success rate of the backdoored model on the proxy-triggered samples, and let denote its clean accuracy. The reduction in proxy attack success rate and the change in clean accuracy for candidate module combination , relative to the backdoored-model baseline, are defined as follows:
All indicators are calculated as proportions. For example, a 3-percentage-point decrease in clean accuracy corresponds to.
To balance the gain of backdoor suppression and the loss of clean classification performance, the security–utility score of candidate module combination \( S\) is defined as
where is the penalty coefficient for the loss of clean accuracy. Before the start of the experiment, is fixed at 2 and remains unchanged during module search and candidate rechecking. It is not adjusted according to validation results. A higher indicates a larger reduction in proxy attack success rate with a smaller loss of clean accuracy.
This paper does not directly select the top-k modules based on their individual risk scores. Instead, it performs a joint module search to evaluate whether purifying multiple modules together is more effective than just purifying a single module.First, all single modules and two-module combinations are evaluated. Among the two-module combinations that meet the clean-accuracy constraint, the six combinations with the highest security–utility scores are chosen as search seeds. Candidate modules are greedy extended from each seed, with a maximum number of modules of 4. Each candidate combination must meet the following criteria:
After the rapid screening, the 20 candidate combinations with the highest security–utility scores are recalibrated the BatchNorm statistics with more trusted clean training windows, and then rechecked.. Finally, the feasible combinations with the highest score after rechecking is selected as the key purification module set S*.The proxy trigger is only used for module risk auditing and candidate combination selection.. After the module combination is determined, the attacker’s original trigger is only used to verify independent defense evaluation the audit set and the test set.
3.4. Personalized Hybrid Purification
For the final selected module combination, PRISM-TS adopts differentiated purification strategies based on module risk. For the selected high-risk modules, we directly use the parameters of the corresponding modules in the clean reference model. For the remaining modules, the corresponding parameters in the clean reference model and the backdoored model are fused with equal weights. The parameters of the -th module in the final purification model are defined as:
Here, , , and denote the parameters of the -th module in the purification model, the backdoored model, and the clean reference model, respectively. For each selected module, the convolutional layers and the corresponding BatchNorm layers are replaced with the parameters of the clean reference model.
This differentiated strategy applies direct replacement to selected high-risk modules and equal-weight parameter fusion to the remaining modules. It therefore adjusts the purification operation according to module risk while reducing disruption to the normal load representations encoded by the unselected modules.
After the module-parameter replacement and fusion, the model's internal feature statistics are recalibrated to reduce the effect of parameter purification on the running statistics of BatchNorm. Specifically, the running mean and variance of each BatchNorm layer are first reset. The model then use the trusted clean calibration window from the training time period for forward propagation, and the BatchNorm running statistics are re-estimated based on the resulting feature statistics. The module search phase uses up to 20 calibration batches to reduce the computational overhead of candidate combination screening. Up to 200 calibration batches are adopted during candidate rechecking and final model construction phase.
4. Experiments and Result Analysis
This section assesses the defense performance of PRISM-TS and its key mechanisms. First, we compare PRISM-TS with representative defense methods under random time-domain backdoor attacks. Next, we conduct ablation experiments and compare module selection strategies to evaluate the impact of proxy-trigger auditing, joint module search, and hybrid purification defense performance. Finally, the method is tested under various trigger intensities and frequency-domain trigger conditions.
4.1. Experimental Setup
The experiment employs the AEP hourly power-load dataset. The data are divided chronologically into training, validation, and test sets at a ratio of 70%, 15%, and 15%,respectively. Each sample contains the load values and time-encoding features of 168 hours before the prediction time and is used to predict the load state at the next time step. Based on the lower and upper quartiles of the load values in the training period, samples are classified into three classes: low load, normal load, and high load. The first 60% of the validation period is used for module-combination search and candidate rechecking during the defense phase. The remaining 40% is reserved for independent evaluation after the module combination and purification parameters have been determined.
The attack protocol follows Section 3.2. Module auditing, joint module search, and personalized purification in PRISM-TS follow Section 3.3 and Section 3.4. We use a targeted backdoor attack from high load to low load. The random time-domain trigger has a length of 8 hours and a perturbation amplitude of 2%–4%; the maximum temporal offset is 12 hours, the poisoning ratio is 10%, and the attack seed is fixed at 42. During the defense phase, random zigzag proxy triggers are used for module auditing, combination search, and candidate rechecking. After the defense model is determined, the attacker’s original trigger is used for final evaluation on the post-selection evaluation set and the test set.
To illustrate the two trigger forms considered in this study, Figure 2 shows examples of a random time-domain trigger and a random frequency-band trigger applied to the same load sample. The upper panels show the triggered load sequences, while the lower panels show the corresponding perturbations.
To compare different backdoor purification strategies, we select Clean Fine-Tuning, NAD, Fine-Pruning, ANP, I-BAU, ABL, RNP, and CLP as representative defense baselines. The pruning ratio of Fine-Pruning is set to 40%. All methods use the same data partition, attack target, test set, and evaluation protocol. PRISM-TS requires the defender to have a clean reference model with the same architecture and trusted clean calibration data, whereas some conventional baselines use only the trusted data or training information required by their original procedures. Therefore, Table 1 only compares the actual defense effects of each method under the experimental settings in this paper, which does not mean that they use the same information resources.
This paper adopts three evaluation metrics: Clean Classification Accuracy (CACC), Attack Success Rate (ASR), and High-Load Retention Rate (HLR). CACC reflects the model’s classification accuracy on clean samples; ASR represents the proportion of triggered samples predicted as the target class; and HLR measures the proportion of samples originally belonging to the high-load class that are still correctly identified as high-load after the trigger is applied. Higher CACC and HLR values indicate better normal classification performance and higher-load identification performance of the model; a lower ASR indicates stronger backdoor suppression. Unless otherwise specified, all experimental results are the mean and standard deviation of the actual independent runs of each method.
4.2. Overall Defense Performance
Under the random time-domain backdoor attack, we compare the overall performance of different defense methods. The results are shown in Table 1. The conventional defense methods maintain high clean classification accuracy, with CACC ranging from 95.11% to 96.84%. However, their ASR remains high, ranging from 98.89% to 99.97%, whereas HLR is only 0.02%–0.24%. These results indicate that although conventional methods such as fine-tuning, distillation, pruning, and adversarial unlearning preserve classification performance on clean samples, they have difficulty suppressing targeted misclassification under trigger conditions while retaining high-load state recognition.
To compare the performance of various baselines on the one-dimensional residual network described in this paper, we adapted them according to the original mechanisms of classic defense methods. ABL starts with a randomly initialized model and performs sample isolation and anti-learning on a training set containing 10% poisoned samples. I-BAU starts from a fixed backdoor model. It uses 10% of the trusted clean training set for adversarial unlearning and generates generic perturbations during training, enabling the model to learn from both clean and perturbed samples simultaneously. RNP also operates based on a fixed backdoor model. It first performs gradient-ascending neuron unlearning using a trusted clean training subset, then learns a BatchNorm channel restoration mask, prunes some channels based on the mask scores, and finally determines the result from among candidate pruning ratios that satisfy the clean accuracy constraint. CLP requires no additional training steps. This method calculates Lipschitz anomaly scores based on channel statistics from one-dimensional convolutional layers and BatchNorm layers, and uses the first 60% of the validation set to determine the pruning threshold. The remaining 40% of the validation set and the test set are not involved in the defense process selection; they are used solely for final evaluation.
Comparatively, PRISM-TS achieves a CACC of 95.72%, reduces the ASR to 2.53% and raises the HLR to 89.62%. Compared to conventional baselines, PRISM-TS only results in a minor decrease in clean classification performance, while significantly reducing the attack success rate and maintaining a high level of high-load state recognition. In this experiment, applying differentiated purification across modules enables a balance between backdoor suppression and normal-task performance.
Under the current random time-domain backdoor attack, the ASR of conventional defense baselines is usually close to 100%. This shows that although these methods maintain high clean classification accuracy, but they do not well weaken the malicious association between high-load samples and low-load target class. Existing methods typically screen and refine model structures based on low-activity neurons, anomalous channels, or uniform processing rules. But these criteria might not be the best fit for the one-dimensional load residual network and the local time-domain trigger considered in this study. Local perturbations may propagate through multiple convolutional modules, resulting in the backdoor response being distributed across many structures instead of being concentrated in a few channels that can be directly pruned. Conversely, if the model repair is too broad, it might damage the normal load discrimination. Therefore, under the attack setting considered here, conventional baselines have difficulty simultaneously suppressing backdoor and preserving high-load state recognition. This conclusion is only applicable to the experimental setting of this study, and it does not mean these methods are ineffective for all time-series tasks.
4.3. Ablation Analysis Under Different Trigger Amplitudes
To analyze the impact of proxy-trigger auditing and risk-aware hybrid purification, we examine three configurations: the complete PRISM-TS; a configuration without proxy-trigger auditing, which employs random module selection (w/o Proxy Audit); and a configuration that replaces risk-aware hybrid purification with uniform module replacement (w/o Hybrid Purification). All three configurations are based on the same backdoor model with an attack seed of 42. They also employ the same data split, test set, and trigger intensities, as well as BatchNorm calibration settings. Therefore, the only differences among the configurations are the module selection and purification strategies.
Figure 3 shows the experimental results for the three ablation configurations under different trigger intensities. It can be observed that the CACC values for the three configurations fluctuate only slightly, at 95.72%, 96.03%, and 93.74%, respectively. This indicates that these ablation settings have a minimal impact on classification performance on clean samples and primarily affect the defense effectiveness under trigger conditions. At a trigger strength of 0.04, PRISM-TS achieved an ASR of 10.77%, far outperforming the two ablation groups; The ASR values for w/o Proxy Audit and w/o Hybrid Purification were 79.64% and 79.02%, respectively; The HLR of the full model achieved 78.99%, while the two ablation configurations reached only 15.45% and 18.55%, respectively. When the trigger intensity was increased to 0.05, the destructive capability of the backdoor attack intensified, and the defensive effectiveness of all approaches declined. However, PRISM-TS’s ASR was kept at 35.21%, which was still lower than the 97.15% for w/o Proxy Audit and the 89.43% for w/o Hybrid Purification; Its HLR was 56.77%, significantly higher than the 2.28% and 9.23% observed in the two ablation configurations.
As the trigger intensity increases, the defense performance of PRISM-TS decreases gradually. When the intensity increases from 0.05 to 0.06, its ASR goes from 35.21% to 63.34%, and its HLR decreases from 56.77% to 31.66%. At intensities of 0.07 and 0.08, ASR increases to 79.83% and 89.13%, while HLR decreases to 17.15% and 8.90%, respectively. These results indicate that PRISM-TS cannot completely resist high-intensity triggers. Its main advantage is that it achieves lower ASR and higher HLR at low and moderate trigger intensities, rather than maintaining a low ASR under strong attacks. Meanwhile, CACC is almost unchanged, suggesting that the performance degradation is mainly reflected in an increase in targeted misclassification among the triggered samples, rather than a general loss of clean-sample classification ability.
Without proxy-trigger auditing, random module selection cannot reliably identify module combinations that are more sensitive to proxy-trigger responses and more effective for backdoor suppression. Without risk-aware hybrid purification, the uniform module replacement cannot be applied for different purification operations based on module risk. Therefore, both ablation configurations exhibit a faster rate of increase in ASR and a faster rate of decrease in HLR as the trigger intensity increases. PRISM-TS achieves lower ASR and higher HLR at low and moderate trigger intensities. As the intensity increases, its defense performance decreases significantly, maybe because strong perturbations activate residual backdoor responses in modules that are not directly replaced.
4.3.1. Comparison of Joint Module Selection Strategies
To evaluate how the module-selection strategy affects defense performance, we consider four strategies: Lowest-risk, Random, Highest single-module score, and the joint module search used by PRISM-TS. Each strategy selects four modules and uses the same purification strategy, equal-weight parameter-fusion coefficient, trusted clean calibration data, and BatchNorm statistic recalibration procedure. The only difference is how the modules to be purified are determined.Lowest-risk selects the four modules with the lowest proxy-risk scores. Random randomly selects four modules from the same candidate space. Highest single-module score selects the four modules with the highest individual proxy-risk scores. PRISM-TS determines the module combination through joint search under a clean-accuracy constraint.The results are reported as the mean ± standard deviation across three independent module-selection runs using the same fixed backdoored model.
As shown in Figure 4, the CACC, ASR, and HLR of PRISM-TS are 95.72%, 2.53%, and 89.62%, respectively. While maintaining high clean classification accuracy, PRISM-TS achieves the lowest ASR and the highest HLR. Compared with Highest single-module score, PRISM-TS has a CACC that is only 0.17 percentage points lower, but its ASR is further reduced by 3.33 percentage points and its HLR is increased by 4.01 percentage points. This indicates that selecting modules according to individual proxy-risk scores may provide some purification benefit, but does not capture the interaction effects among multiple jointly purified modules.Compared with Random, PRISM-TS reduces the ASR from 29.86% ± 3.28% to 2.53% and increases the HLR from 53.95% ± 3.64% to 89.62%. Lowest-risk achieves an ASR of 64.58% and an HLR of 26.97%, indicating that low risk at the individual-module level does not necessarily imply that the resulting module combination can effectively suppress the backdoor. Except for Random, the other three strategies produce the same results in all three independent constructions; consequently, their standard deviations are 0.00. Under the experimental settings of this study, joint module search is more effective than single-module ranking or random selection in simultaneously reducing ASR and preserving high-load state recognition.
4.4. Robustness Under Different Trigger Intensities
To evaluate the robustness of various defense strategies to changes in trigger intensity, we fixed the corresponding backdoored model, defended model, selected modules, purification parameters, data partitioning, and evaluation protocol for each method. Only the random time-domain trigger's perturbation amplitude was varied at test time. The backdoored model was built with attack seed 42, and in the subsequent experiments, neither the backdoored model nor any defended model was retrained.For each trigger intensity, random time-domain trigger instances were generated with trigger-generation seeds 42, 43, and 44. We present the mean and standard deviation values for CACC, ASR, and HLR. Therefore, the reported standard deviations only account for variation across test-time trigger instances.
As shown in Figure 5, when the perturbation amplitude was 0.01, the ASR of the classical defense methods was between 12.88% and 41.92%, and their HLR was between 39.86% and 79.08%; PRISM-TS had an ASR of 0% and an HLR of 98.12%. When the amplitude reached 0.02, the ASR of all classical defence methods was at least 92.67%, and their HLR did not exceed 1.65%; PRISM-TS still had an ASR of 0% and an HLR of 96.41%.
As the trigger amplitude increases from 0.03 to 0.08, the ASR of PRISM-TS increases from 1.03% to 89.13%, and its HLR decreases from 91.42% to 8.90%. Therefore, PRISM-TS also shows degraded defense performance at high trigger intensities, and cannot fully suppress the backdoor response. But at low-to-moderate intensities, the increase in ASR and the decrease in HLR occur later, suggesting better resistance to changes in trigger intensity compared to classical defense methods. In contrast,when the perturbation amplitude reaches 0.04 or more, the ASR of classical methods is nearly 100%, and their HLR is nearly 0%. The CACC of all methods varies only slightly with trigger amplitude. In the tested range, it shows that trigger intensity mainly affects the backdoor response for triggered samples, not the classification performance on clean samples.
4.5. Defense Performance Under Frequency-Domain Backdoor Attacks
To assess the defense ability of PRISM-TS against frequency-domain backdoor attacks, we examine two types of triggers: one fixed-frequency and one random-frequency-band trigger. A corresponding frequency-domain backdoor model is trained for each attack type. The fixed-frequency trigger is used at frequency indices 17 and 29, while the random-frequency-band trigger randomly selects perturbation frequencies from the two bands, 14–20 and 26–32. For both attacks, the model input is a 168-hour historical window. The poisoning ratio is set at 10%, and the perturbation amplitude is between 2% and 4%.
During the defense process, PRISM-TS does not use the attacker's original frequency-domain trigger for module localization. Instead, it uses proxy triggers at different frequency positions to perform module auditing and joint module search. This paper selects proxy frequencies from a predefined set, such as ( 12,34 ), ( 11,35 ) and ( 13,33 ), and these frequencies do not fall within the fixed frequency point or random frequency band range used by the attacker. For each frequency domain attack, this paper performs module localization, candidate review, differentiated module purification, and BatchNorm statistics reassessment under three proxy seeds. The attacker 's original trigger is only used for subsequent evaluation and final testing.
Table 2 demonstrates that PRISM-TS maintains a low ASR under both frequency domain attacks, while maintaining a high CACC and HLR. Under fixed-frequency attack, the ASR was 0.34 % ± 0.32 %, and the HLR was 93.77 % ± 2.26 %. Under random band attack, ASR is 0.36 % ± 0.41 %, and HLR is 95.45 % ± 0.90 %. By comparison, Fine-Pruning, NAD and I-BAU are still higher ASR or lower HLR under both attacks. These results suggest that the frequency-domain backdoor response under the test conditions in this paper can be reduced by using frequency-domain proxy triggers for module sensitivity auditing, joint module selection and risk-aware purification, even if the specific configuration of the original frequency-domain trigger is unknown. It should be noted that this section re-executed the proxy auditing, module selection and model purification for each frequency-domain attack and verified the adaptive defense capability of PRISM-TS against frequency-domain attacks; it did not directly transfer the defense model obtained in the time-domain attack experiment to the frequency-domain attacks.
5. Conclusions
To address targeted backdoor attacks against power-load time-series classification models, we propose PRISM-TS, a personalized defense method guided by proxy triggers. The method assumes that the defender has access to a clean reference model with the same architecture and trusted clean calibration data, but not to the precise configuration of the attacker’s original trigger. Based on the known trigger form, PRISM-TS constructs proxy triggers and uses them to audit the sensitivity of network modules. It then determines the modules to be purified through joint module search under a clean-accuracy constraint. The selected modules are replaced with the corresponding parameters from the clean reference model, and the parameters of the unselected modules are obtained by equal-weight fusion of the clean and backdoored models. Finally, the BatchNorm running statistics are recalibrated using trusted clean training windows.
In the random time-domain attack experiments on the AEP dataset, PRISM-TS reduced the ASR to 2.53% while maintaining a CACC of 95.72% and an HLR of 89.62%. The ablation results show that removing proxy-trigger auditing or replacing hybrid purification with uniform module replacement leads to higher ASR and lower HLR. These results indicate that both components contribute to the defense performance under the tested conditions.Additional experiments with fixed-frequency and random-frequency-band attacks show that PRISM-TS can still obtain low ASR and high HLR when the precise configuration of the attacker’s original frequency-domain trigger is unavailable. In these experiments, frequency-domain proxy triggers located outside the attack frequency ranges were adopted for module auditing, joint module selection, and purification. Accordingly, proxy-trigger auditing and risk-aware hybrid purification showed effectiveness under the frequency-domain attack conditions evaluated in this study.The conclusions are limited to the AEP dataset, the selected network architecture, the availability of a clean reference model, and the trigger forms examined in this work. They therefore do not establish that PRISM-TS is effective against all unknown attacks. Future work will evaluate the method on additional datasets, architectures, and adaptive attack settings, and will investigate defense strategies that do not require a complete clean reference model.
Author Contributions
Conceptualization: Chen Du; Experimental Validation: Xiaoyi Zhou; Methodology: Qi Zhang; Data Organization: Yajun Lu; First Draft: Hao Wang; Field Research: Yaohui Wang , Zhibin Wang, and Jiehan Xu; Review and Revision: Chen Du and Xiaoyi Zhou. All authors have read and approved the final published version.
Data Availability Statement
The raw data supporting the conclusions of this article will be made available by the authors on request.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Ismail Fawaz, H.; Forestier, G.; Weber, J.; Idoumghar, L.; Muller, P.-A. Deep learning for time series classification: A review. Data Min. Knowl. Discov. 2019, 33, 917–963. [Google Scholar] [CrossRef]
- Wang, Z.; Yan, W.; Oates, T. Time Series Classification from Scratch with Deep Neural Networks: A Strong Baseline. In Proceedings of the 2017 International Joint Conference on Neural Networks (IJCNN), Anchorage, AK, USA, 14–19 May 2017; pp. 1578–1585. [Google Scholar] [CrossRef]
- Ismail Fawaz, H.; Lucas, B.; Forestier, G.; Pelletier, C.; Schmidt, D.F.; Weber, J.; Webb, G.I.; Idoumghar, L.; Muller, P.-A.; Petitjean, F. InceptionTime: Finding AlexNet for Time Series Classification. Data Min. Knowl. Discov. 2020, 34, 1936–1962. [Google Scholar] [CrossRef]
- Dempster, A.; Petitjean, F.; Webb, G.I. ROCKET: Exceptionally Fast and Accurate Time Series Classification Using Random Convolutional Kernels. Data Min. Knowl. Discov. 2020, 34, 1454–1495. [Google Scholar] [CrossRef]
- Ruiz, A.P.; Flynn, M.; Large, J.; Middlehurst, M.; Bagnall, A. The Great Multivariate Time Series Classification Bake Off: A Review and Experimental Evaluation of Recent Algorithmic Advances. Data Min. Knowl. Discov. 2021, 35, 401–449. [Google Scholar] [CrossRef] [PubMed]
- Middlehurst, M.; Large, J.; Flynn, M.; Lines, J.; Bostrom, A.; Bagnall, A. HIVE-COTE 2.0: A New Meta Ensemble for Time Series Classification. Mach. Learn. 2021, 110, 3211–3243. [Google Scholar] [CrossRef]
- Zerveas, G.; Jayaraman, S.; Patel, D.; Bhamidipaty, A.; Eickhoff, C. A Transformer-based Framework for Multivariate Time Series Representation Learning. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD '21), Virtual Event, Singapore, 14–18 August 2021; pp. 2114–2124. [Google Scholar] [CrossRef]
- Lim, B.; Arık, S.Ö.; Loeff, N.; Pfister, T. Temporal Fusion Transformers for Interpretable Multi-horizon Time Series Forecasting. Int. J. Forecast. 2021, 37, 1748–1764. [Google Scholar] [CrossRef]
- Zhou, T.; Ma, Z.; Wen, Q.; Wang, X.; Sun, L.; Jin, R. FEDformer: Frequency Enhanced Decomposed Transformer for Long-term Series Forecasting. In Proceedings of the 39th International Conference on Machine Learning (ICML), Baltimore, MD, USA, 17–23 July 2022; Proceedings of Machine Learning Research. Volume 162, pp. 27268–27286. Available online: https://proceedings.mlr.press/v162/zhou22g.html.
- Nie, Y.; Nguyen, N.H.; Sinthong, P.; Kalagnanam, J. A Time Series Is Worth 64 Words: Long-Term Forecasting with Transformers. In Proceedings of the International Conference on Learning Representations (ICLR), Kigali, Rwanda, 1–5 May 2023; Available online: https://openreview.net/forum?id=Jbdc0vTOcol.
- Wu, H.; Hu, T.; Liu, Y.; Zhou, H.; Wang, J.; Long, M. TimesNet: Temporal 2D-Variation Modeling for General Time Series Analysis. In Proceedings of the Eleventh International Conference on Learning Representations (ICLR), Kigali, Rwanda, 1–5 May 2023; Available online: https://openreview.net/forum?id=ju_Uqw384Oq.
- Hong, T.; Fan, S. Probabilistic Electric Load Forecasting: A Tutorial Review. Int. J. Forecast. 2016, 32, 914–938. [Google Scholar] [CrossRef]
- Kong, W.; Dong, Z.Y.; Jia, Y.; Hill, D.J.; Xu, Y.; Zhang, Y. Short-Term Residential Load Forecasting Based on LSTM Recurrent Neural Network. IEEE Trans. Smart Grid 2019, 10, 841–851. [Google Scholar] [CrossRef]
- Gu, T.; Liu, K.; Dolan-Gavitt, B.; Garg, S. BadNets: Evaluating Backdooring Attacks on Deep Neural Networks. IEEE Access 2019, 7, 47230–47244. [Google Scholar] [CrossRef]
- Chen, X.; Liu, C.; Li, B.; Lu, K.; Song, D. Targeted Backdoor Attacks on Deep Learning Systems Using Data Poisoning. arXiv 2017, arXiv:1712.05526. [Google Scholar] [CrossRef]
- Saha, A.; Subramanya, A.; Pirsiavash, H. Hidden Trigger Backdoor Attacks. In Proceedings of the AAAI Conference on Artificial Intelligence, New York, NY, USA, 7–12 February 2020; Volume 34, pp. 11957–11965. [Google Scholar] [CrossRef]
- Nguyen, A.; Tran, A. WaNet—Imperceptible Warping-based Backdoor Attack. In Proceedings of the Ninth International Conference on Learning Representations (ICLR), Virtual Event, 3–7 May 2021; Available online: https://openreview.net/forum?id=eEn8KTtJOx.
- Doan, K.; Lao, Y.; Zhao, W.; Li, P. LIRA: Learnable, Imperceptible and Robust Backdoor Attacks. In Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), Virtual Event, Montreal, QC, Canada, 11–17 October 2021; pp. 11946–11956. [Google Scholar] [CrossRef]
- Nguyen, T.A.; Tran, A. Input-Aware Dynamic Backdoor Attack. In Advances in Neural Information Processing Systems; Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M.F., Lin, H., Eds.; Curran Associates, Inc., 2020; Volume 33, pp. 3454–3464. [Google Scholar]
- Li, Y.; Li, Y.; Wu, B.; Li, L.; He, R.; Lyu, S. Invisible Backdoor Attack with Sample-Specific Triggers. In Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), Virtual Event, Montreal, QC, Canada, 11–17 October 2021; pp. 16443–16452. [Google Scholar] [CrossRef]
- Ding, D.; Zhang, M.; Huang, Y.; Pan, X.; Feng, F.; Jiang, E.; Yang, M. Towards Backdoor Attack on Deep Learning Based Time Series Classification. In Proceedings of the IEEE 38th International Conference on Data Engineering (ICDE), Virtual Event, Kuala Lumpur, Malaysia, 9–12 May 2022; pp. 1274–1287. [Google Scholar] [CrossRef]
- Jiang, Y.; Ma, X.; Erfani, S.M.; Bailey, J. Backdoor Attacks on Time Series: A Generative Approach. In Proceedings of the IEEE Conference on Secure and Trustworthy Machine Learning (SaTML), Raleigh, NC, USA, 8–10 February 2023; pp. 392–403. [Google Scholar] [CrossRef]
- Lin, X.; Liu, Z.; Fu, D.; Qiu, R.; Tong, H. BackTime: Backdoor Attacks on Multivariate Time Series Forecasting. In Advances in Neural Information Processing Systems (NeurIPS); Vancouver, BC, Canada, 10–15 December 2024; Volume 37, pp. 131344–131368. [Google Scholar] [CrossRef]
- Rao, Q.; Wang, L.; Liu, W. Rethinking CNNs’ Generalization to Backdoor Attacks from the Frequency Domain. In Proceedings of the International Conference on Learning Representations (ICLR), 2024; pp. 5342–5360. [Google Scholar]
- 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 (SP), San Francisco, CA, USA, 20–22 May 2019; pp. 707–723. [Google Scholar] [CrossRef]
- Tran, B.; Li, J.; Madry, A. Spectral Signatures in Backdoor Attacks. In Advances in Neural Information Processing Systems; 2018; Volume 31. [Google Scholar]
- Liu, K.; Dolan-Gavitt, B.; Garg, S. Fine-Pruning: Defending Against Backdooring Attacks on Deep Neural Networks. In Proceedings of the 21st International Symposium on Research in Attacks, Intrusions, and Defenses (RAID), Heraklion, Crete, Greece, 10–12 September 2018; Lecture Notes in Computer Science. Springer: Cham, Switzerland, 2018; Volume 11050, pp. 273–294. [Google Scholar] [CrossRef]
- 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 (ICLR), 2021. [Google Scholar]
- Li, Y.; Lyu, X.; Koren, N.; Lyu, L.; Li, B.; Ma, X. Anti-Backdoor Learning: Training Clean Models on Poisoned Data. In Advances in Neural Information Processing Systems; 2021; Volume 34, pp. 14900–14912. [Google Scholar]
- Wu, D.; Wang, Y. Adversarial Neuron Pruning Purifies Backdoored Deep Models. In Advances in Neural Information Processing Systems; 2021; Volume 34, pp. 16913–16925. [Google Scholar]
- Zeng, Y.; Chen, S.; Park, W.; Mao, Z.M.; Jin, M.; Jia, R. Adversarial Unlearning of Backdoors via Implicit Hypergradient. In Proceedings of the International Conference on Learning Representations (ICLR), 2022. [Google Scholar]
- Zheng, R.; Tang, R.; Li, J.; Liu, L. Data-Free Backdoor Removal Based on Channel Lipschitzness. In Computer Vision—ECCV 2022; Avidan, S., Brostow, G., Cissé, M., Farinella, G.M., Hassner, T., Eds.; Springer: Cham, Switzerland, 2022; pp. 175–191. [Google Scholar] [CrossRef] [PubMed]
- Li, Y.; Lyu, X.; Ma, X.; Koren, N.; Lyu, L.; Li, B.; Jiang, Y.-G. Reconstructive Neuron Pruning for Backdoor Defense. In Proceedings of the 40th International Conference on Machine Learning; PMLR, 2023; pp. 19837–19854. [Google Scholar]
Figure 1.
Overall framework of PRISM-TS. The framework includes proxy-trigger-based module auditing, joint module selection, differentiated purification, BatchNorm recalibration, and final evaluation using CACC, ASR, and HLR.
Figure 1.
Overall framework of PRISM-TS. The framework includes proxy-trigger-based module auditing, joint module selection, differentiated purification, BatchNorm recalibration, and final evaluation using CACC, ASR, and HLR.

Figure 2.
Examples of random time-domain and random frequency-band triggers. (a) Triggered load sequence under the random time-domain attack; (b) triggered load sequence under the random frequency-band attack; (c) time-domain perturbation; (d) frequency-domain perturbation.
Figure 2.
Examples of random time-domain and random frequency-band triggers. (a) Triggered load sequence under the random time-domain attack; (b) triggered load sequence under the random frequency-band attack; (c) time-domain perturbation; (d) frequency-domain perturbation.

Figure 3.
Ablation comparison of three defense configurations under different trigger amplitudes. (a) CACC; (b) ASR; (c) HLR.
Figure 3.
Ablation comparison of three defense configurations under different trigger amplitudes. (a) CACC; (b) ASR; (c) HLR.

Figure 4.
Comparison of defense performance across different module-selection strategies.

Figure 5.
Performance comparison of different defense methods under random time-domain backdoor attacks with different trigger amplitudes.
Figure 5.
Performance comparison of different defense methods under random time-domain backdoor attacks with different trigger amplitudes.

Table 1.
Performance comparison of different defense methods under a random time-domain backdoor attack from high load to low load.
Table 1.
Performance comparison of different defense methods under a random time-domain backdoor attack from high load to low load.
| Method | CACC (%)↑ | ASR (%)↓ | HLR (%)↑ |
| Clean Fine-Tuning | 96.69 ± 0.05 | 99.97 ± 0.01 | 0.03 ± 0.01 |
| NAD | 96.75 ± 0.00 | 99.95 ± 0.00 | 0.05 ± 0.00 |
| Fine-Pruning(40%) | 96.83 ± 0.11 | 99.92 ± 0.04 | 0.05 ± 0.00 |
| ANP | 95.31 ± 0.26 | 98.89 ± 0.55 | 0.24 ± 0.07 |
| I-BAU | 96.84 ± 0.00 | 99.95 ± 0.00 | 0.05 ± 0.00 |
| ABL | 95.11 ± 0.60 | 99.83 ± 0.06 | 0.02 ± 0.02 |
| RNP | 95.32 ± 0.50 | 99.95 ± 0.08 | 0.03 ± 0.03 |
| CLP | 96.37 ± 0.00 | 99.95 ± 0.00 | 0.05 ± 0.00 |
| PRISM-TS | 95.72 ± 0.00 | 2.53 ± 0.00 | 89.62 ± 0.00 |
Note: The results are reported as the mean ± sample standard deviation based on the actual repeated protocol of each method. The baseline methods employ five repeated defense runs. PRISM-TS uses five proxy-auditing seeds to complete the module selection construction, and the five constructions produce the same final model checkpoint, thus, its standard deviation is 0.00. CACC, ASR, and HLR denote clean classification accuracy, attack success rate, and high-load retention rate, respectively. All values are reported as percentages. ↑/↓ indicate that higher/lower values are better.
Table 2.
Performance comparison of various defense methods under frequency-domain backdoor attacks.
| Attack Type | Method | CACC (%) ↑ | ASR (%) ↓ | HLR (%) ↑ |
|---|---|---|---|---|
| Fixed-frequency (17,29) | Fine-Pruning (40%) | 96.84 ± 0.01 | 100.00 ± 0.00 | 0.00 ± 0.00 |
| NAD | 96.84 ± 0.05 | 100.00 ± 0.00 | 0.00 ± 0.00 | |
| I-BAU | 96.80 ± 0.00 | 99.79 ± 0.00 | 0.18 ± 0.00 | |
| PRISM-TS | 96.95 ± 0.06 | 0.34 ± 0.32 | 93.77 ± 2.26 | |
| Random-frequency-band (14–20, 26–32) | Fine-Pruning (40%) | 96.32 ± 0.43 | 72.86 ± 2.32 | 6.44 ± 0.95 |
| NAD | 96.92 ± 0.03 | 99.91 ± 0.00 | 0.07 ± 0.04 | |
| I-BAU | 96.92 ± 0.00 | 99.77 ± 0.00 | 0.18 ± 0.00 | |
| PRISM-TS | 97.01 ± 0.06 | 0.36 ± 0.41 | 95.45 ± 0.90 |
Note: For both attack settings, three proxy seeds were used for frequency-domain proxy-trigger auditing, joint module selection, purification-model construction, and performance evaluation. The attack seed was fixed at 42. The attacker’s original frequency-domain trigger was used only for the final defense evaluation on the post-selection evaluation set and the test set and was not involved in defense selection.
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. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.