TAROT: Towards Essentially Domain-Invariant Robustness with Theoretical Justification
Not on the map. Why?
Abstract (arXiv)
Robust domain adaptation against adversarial attacks is a critical research area that aims to develop models capable of maintaining consistent performance across diverse and challenging domains. In this paper, we derive a new generalization bound for robust risk on the target domain using a novel divergence measure specifically designed for robust domain adaptation. Building upon this, we propose a new algorithm named TAROT, which is designed to enhance both domain adaptability and robustness. Through extensive experiments, TAROT not only surpasses state-of-the-art methods in accuracy and robustness but also significantly enhances domain generalization and scalability by effectively learning domain-invariant features. In particular, TAROT achieves superior performance on the challenging DomainNet dataset, demonstrating its ability to learn domain-invariant representations that generalize well across different domains, including unseen ones. These results highlight the broader applicability of our approach in real-world domain adaptation scenarios.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 32 of its 43 references that are in the map. First posted on arXiv 10 May 2025.
Builds on
32 of 43 references.
References · 32
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2013Intriguing properties of neural networkscited by 5,155
- 2015Domain-Adversarial Training of Neural Networkscited by 3,044
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
- 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,451
- 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,331
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,268
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,188
- 2017Spectrally-normalized margin bounds for neural networkscited by 686
- 2019Pseudo-Labeling and Confirmation Bias in Deep Semi-Supervised Learningcited by 510
- 2019Bridging Theory and Algorithm for Domain Adaptationcited by 332
20 more
- 2020Do Adversarially Robust ImageNet Models Transfer Better?cited by 316
- 2017Parseval Networks: Improving Robustness to Adversarial Examplescited by 293
- 2019Are Labels Required for Improving Adversarial Robustness?cited by 163
- 2024Reliable and Efficient Concept Erasure of Text-to-Image Diffusion Modelscited by 133
- 2024Robust CLIP: Unsupervised Adversarial Fine-Tuning of Vision Embeddings for Robust Large Vision-Language Modelscited by 120
- 2022Understanding Zero-Shot Adversarial Robustness for Large-Scale Modelscited by 117
- 2020Exactly Computing the Local Lipschitz Constant of ReLU Networkscited by 102
- 2016MultiNet: Real-time Joint Semantic Reasoning for Autonomous Drivingcited by 90
- 2019Support and Invertibility in Domain-Invariant Representationscited by 87
- 2020Do Wider Neural Networks Really Help Adversarial Robustness?cited by 79
- 2022Rethinking Lipschitz Neural Networks and Certified Robustness: A Boolean Function Perspectivecited by 51
- 2022Efficiently Computing Local Lipschitz Constants of Neural Networks via Bound Propagationcited by 45
- 2021Adversarial Robustness for Unsupervised Domain Adaptationcited by 24
- 2021Two Wrongs Don't Make a Right: Combating Confirmation Bias in Learning with Label Noisecited by 18
- 2022Improving Adversarial Robustness by Putting More Regularizations on Less Robust Samplescited by 11
- 2021Latent Space Regularization for Unsupervised Domain Adaptation in Semantic Segmentationcited by 10
- 2022Exploring Adversarially Robust Training for Unsupervised Domain Adaptationcited by 8
- 2022SRoUDA: Meta Self-training for Robust Unsupervised Domain Adaptationcited by 6
- 2022The robust way to stack and bag: the local Lipschitz waycited by 3
- 2023Enhancing Adversarial Robustness in Low-Label Regime via Adaptively Weighted Regularization and Knowledge Distillationcited by 3
Built on by
Citing papers per year: 2026: 2.
2 papers.