TAROT: Towards Essentially Domain-Invariant Robustness with Theoretical Justification
Abstract
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.
Cite
Text
Yang et al. "TAROT: Towards Essentially Domain-Invariant Robustness with Theoretical Justification." Conference on Computer Vision and Pattern Recognition, 2025. doi:10.1109/CVPR52734.2025.02401Markdown
[Yang et al. "TAROT: Towards Essentially Domain-Invariant Robustness with Theoretical Justification." Conference on Computer Vision and Pattern Recognition, 2025.](https://mlanthology.org/cvpr/2025/yang2025cvpr-tarot/) doi:10.1109/CVPR52734.2025.02401BibTeX
@inproceedings{yang2025cvpr-tarot,
title = {{TAROT: Towards Essentially Domain-Invariant Robustness with Theoretical Justification}},
author = {Yang, Dongyoon and Lee, Jihu and Kim, Yongdai},
booktitle = {Conference on Computer Vision and Pattern Recognition},
year = {2025},
pages = {25780-25789},
doi = {10.1109/CVPR52734.2025.02401},
url = {https://mlanthology.org/cvpr/2025/yang2025cvpr-tarot/}
}