Certified PEFTSmoothing: Parameter-Efficient Fine-Tuning with Randomized Smoothing
Not on the map. Why?
Abstract (arXiv)
Randomized smoothing is the primary certified robustness method for accessing the robustness of deep learning models to adversarial perturbations in the l2-norm, by adding isotropic Gaussian noise to the input image and returning the majority votes over the base classifier. Theoretically, it provides a certified norm bound, ensuring predictions of adversarial examples are stable within this bound. A notable constraint limiting widespread adoption is the necessity to retrain base models entirely from scratch to attain a robust version. This is because the base model fails to learn the noise-augmented data distribution to give an accurate vote. One intuitive way to overcome this challenge is to involve a custom-trained denoiser to eliminate the noise. However, this approach is inefficient and sub-optimal. Inspired by recent large model training procedures, we explore an alternative way named PEFTSmoothing to adapt the base model to learn the Gaussian noise-augmented data with Parameter-Efficient Fine-Tuning (PEFT) methods in both white-box and black-box settings. Extensive results demonstrate the effectiveness and efficiency of PEFTSmoothing, which allow us to certify over 98% accuracy for ViT on CIFAR-10, 20% higher than SoTA denoised smoothing, and over 61% accuracy on ImageNet which is 30% higher than CNN-based denoiser and comparable to the Diffusion-based denoiser.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 43 of its 53 references that are in the map. First posted on arXiv 8 Apr 2024.
Builds on
43 of 53 references.
References · 43
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2013Intriguing properties of neural networkscited by 5,114
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2021Improved Denoising Diffusion Probabilistic Modelscited by 3,736
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
- 2022Visual Prompt Tuningcited by 1,674
31 more
- 2016Beyond a Gaussian Denoiser: Residual Learning of Deep CNN for Image Denoisingcited by 1,352
- 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
- 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 863
- 2017Ensemble Adversarial Training: Attacks and Defensescited by 833
- 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
- 2015Distillation as a Defense to Adversarial Perturbations against Deep Neural Networkscited by 675
- 2017Adversarial Examples Are Not Easily Detected: Bypassing Ten Detection Methodscited by 542
- 2018Certified Robustness to Adversarial Examples with Differential Privacycited by 462
- 2016Transferability in Machine Learning: from Phenomena to Black-Box Attacks using Adversarial Samplescited by 439
- 2019Provably Robust Deep Learning via Adversarially Trained Smoothed Classifierscited by 328
- 2018Regularisation of Neural Networks by Enforcing Lipschitz Continuitycited by 311
- 2017MagNet: a Two-Pronged Defense against Adversarial Examplescited by 268
- 2016Safety Verification of Deep Neural Networkscited by 262
- 2017Formal Verification of Piece-Wise Linear Feed-Forward Neural Networkscited by 241
- 2023Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessmentcited by 227
- 2018Adversarial Risk and the Dangers of Evaluating Against Weak Attackscited by 221
- 2018Sorting out Lipschitz function approximationcited by 211
- 2018Lipschitz-Margin Training: Scalable Certification of Perturbation Invariance for Deep Neural Networkscited by 193
- 2022(Certified!!) Adversarial Robustness for Free!cited by 130
- 2020MACER: Attack-free and Scalable Robust Training via Maximizing Certified Radiuscited by 114
- 2020Consistency Regularization for Certified Robustness of Smoothed Classifierscited by 73
- 2023BlackVIP: Black-Box Visual Prompting for Robust Transfer Learningcited by 70
- 2021Training Certifiably Robust Neural Networks with Efficient Local Lipschitz Boundscited by 64
- 2021SmoothMix: Training Confidence-calibrated Smoothed Classifiers for Certified Robustnesscited by 49
- 2021Boosting Randomized Smoothing with Variance Reduced Classifierscited by 47
- 2022SUNet: Swin Transformer UNet for Image Denoisingcited by 43
- 2018On the Robustness of the CVPR 2018 White-Box Adversarial Example Defensescited by 40
- 2021On the Certified Robustness for Ensemble Models and Beyondcited by 40
- 2022Robust and Accurate -- Compositional Architectures for Randomized Smoothingcited by 12
- 2023Improved Visual Fine-tuning with Natural Language Supervisioncited by 7
Built on by
Citing papers per year: 2024: 1.
1 paper.