Boosting Certified Robustness for Time Series Classification with Efficient Self-Ensemble
Not on the map. Why?
Abstract (arXiv)
Recently, the issue of adversarial robustness in the time series domain has garnered significant attention. However, the available defense mechanisms remain limited, with adversarial training being the predominant approach, though it does not provide theoretical guarantees. Randomized Smoothing has emerged as a standout method due to its ability to certify a provable lower bound on robustness radius under ℓp-ball attacks. Recognizing its success, research in the time series domain has started focusing on these aspects. However, existing research predominantly focuses on time series forecasting, or under the non-ℓp robustness in statistic feature augmentation for time series classification~(TSC). Our review found that Randomized Smoothing performs modestly in TSC, struggling to provide effective assurances on datasets with poor robustness. Therefore, we propose a self-ensemble method to enhance the lower bound of the probability confidence of predicted labels by reducing the variance of classification margins, thereby certifying a larger radius. This approach also addresses the computational overhead issue of Deep Ensemble~(DE) while remaining competitive and, in some cases, outperforming it in terms of robustness. Both theoretical analysis and experimental results validate the effectiveness of our method, demonstrating superior performance in robustness testing compared to baseline approaches.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 45 references that are in the map. First posted on arXiv 4 Sep 2024.
Builds on
23 of 45 references.
References · 23
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,259
- 2018Robustness May Be at Odds with Accuracycited by 873
- 2018Deep learning for time series classification: a reviewcited by 575
- 2022Diffusion Models for Adversarial Purificationcited by 469
- 2018Certified Robustness to Adversarial Examples with Differential Privacycited by 462
- 2019InceptionTime: Finding AlexNet for Time Series Classificationcited by 386
- 2019Provably Robust Deep Learning via Adversarially Trained Smoothed Classifierscited by 328
- 2020MACER: Attack-free and Scalable Robust Training via Maximizing Certified Radiuscited by 114
11 more
- 2019Adversarial Attacks on Deep Neural Networks for Time Series Classificationcited by 53
- 2021Boosting Randomized Smoothing with Variance Reduced Classifierscited by 47
- 2024Reliable Conflictive Multi-View Learningcited by 45
- 2019Adversarial Attacks on Time Seriescited by 40
- 2020Benchmarking adversarial attacks and defenses for time-series datacited by 9
- 2022Robust Multivariate Time-Series Forecasting: Adversarial Attacks and Defense Mechanismscited by 8
- 2022Adversarial Framework with Certified Robustness for Time-Series Domain via Statistical Featurescited by 7
- 2023SWAP: Exploiting Second-Ranked Logits for Adversarial Attacks on Time Seriescited by 6
- 2022Towards an Awareness of Time Series Anomaly Detection Models' Adversarial Vulnerabilitycited by 5
- 2021Dynamic Defense Approach for Adversarial Robustness in Deep Neural Networks via Stochastic Ensemble Smoothed Modelcited by 4
- 2023Rethinking Randomized Smoothing from the Perspective of Scalabilitycited by 3
Built on by
Not cited yet.