Towards Evaluating the Robustness of Neural Networks Learned by Transduction
Not on the map. Why?
Abstract (arXiv)
There has been emerging interest in using transductive learning for adversarial robustness (Goldwasser et al., NeurIPS 2020; Wu et al., ICML 2020; Wang et al., ArXiv 2021). Compared to traditional defenses, these defense mechanisms "dynamically learn" the model based on test-time input; and theoretically, attacking these defenses reduces to solving a bilevel optimization problem, which poses difficulty in crafting adaptive attacks. In this paper, we examine these defense mechanisms from a principled threat analysis perspective. We formulate and analyze threat models for transductive-learning based defenses, and point out important subtleties. We propose the principle of attacking model space for solving bilevel attack objectives, and present Greedy Model Space Attack (GMSA), an attack framework that can serve as a new baseline for evaluating transductive-learning based defenses. Through systematic evaluation, we show that GMSA, even with weak instantiations, can break previous transductive-learning based defenses, which were resilient to previous attacks, such as AutoAttack. On the positive side, we report a somewhat surprising empirical result of "transductive adversarial training": Adversarially retraining the model using fresh randomness at the test time gives a significant increase in robustness against attacks we consider.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 30 of its 45 references that are in the map. First posted on arXiv 27 Oct 2021.
Builds on
30 of 45 references.
References · 30
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2016Adversarial examples in the physical worldcited by 1,762
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
- 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,442
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
- 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,315
18 more
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,259
- 2020Fast is better than free: Revisiting adversarial trainingcited by 723
- 2020On Adaptive Attacks to Adversarial Example Defensescited by 547
- 2016Delving into Transferable Adversarial Examples and Black-box Attackscited by 530
- 2019Unlabeled Data Improves Adversarial Robustnesscited by 415
- 2019Using Pre-Training Can Improve Model Robustness and Uncertaintycited by 373
- 2018A Survey of Unsupervised Deep Domain Adaptationcited by 361
- 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 333
- 2018Adversarially Robust Generalization Requires More Datacited by 318
- 2018MMA Training: Direct Input Space Margin Maximization through Adversarial Trainingcited by 171
- 2017The Space of Transferable Adversarial Examplescited by 156
- 2014Domain-Adversarial Neural Networkscited by 78
- 2018Stochastic Hyperparameter Optimization through Hypernetworkscited by 72
- 2020Estimating Generalization under Distribution Shifts via Domain-Invariant Representationscited by 56
- 2020Beyond Perturbations: Learning Guarantees with Arbitrary Adversarial Test Examplescited by 44
- 2021Fighting Gradients with Gradients: Dynamic Defenses against Adversarial Attackscited by 19
- 2019A Research Agenda: Dynamic Models to Defend Against Correlated Attackscited by 18
- 2019An Adaptive and Momental Bound Method for Stochastic Learningcited by 11
Built on by
Citing papers per year: 2022: 3; 2023: 2; 2024: 2; 2025: 1.
8 papers.
- 2022LAS-AT: Adversarial Training with Learnable Attack Strategycited by 94
- 2022Evaluating the Adversarial Robustness of Adaptive Test-time Defensescited by 64
- 2022Demystifying the Adversarial Robustness of Random Transformation Defensescited by 14
- 2023Uncovering Adversarial Risks of Test-Time Adaptationcited by 12
- 2024On the Adversarial Risk of Test Time Adaptation: An Investigation into Realistic Test-Time Data Poisoningcited by 4
- 2024Test-time Adversarial Defense with Opposite Adversarial Path and High Attack Time Costcited by 1
- 2025Non-Parametric Probabilistic Robustness: A Conservative Risk Estimator under Unknown Perturbation Distributionscited by 1
- 2023Two Heads are Actually Better than One: Towards Better Adversarial Robustness via Transduction and Rejectioncited by 0
- 2025Non-Parametric Probabilistic Robustness: A Conservative Risk Estimator under Unknown Perturbation Distributions21 Nov 2025
- 2024Test-time Adversarial Defense with Opposite Adversarial Path and High Attack Time Cost22 Oct 2024
- 2024On the Adversarial Risk of Test Time Adaptation: An Investigation into Realistic Test-Time Data Poisoning7 Oct 2024
- 2023Two Heads are Actually Better than One: Towards Better Adversarial Robustness via Transduction and Rejection27 May 2023
- 2023Uncovering Adversarial Risks of Test-Time Adaptation29 Jan 2023
- 2022Demystifying the Adversarial Robustness of Random Transformation Defenses18 Jun 2022
- 2022LAS-AT: Adversarial Training with Learnable Attack Strategy13 Mar 2022
- 2022Evaluating the Adversarial Robustness of Adaptive Test-time Defenses28 Feb 2022