Domain Generalization via Rationale Invariance

Abstract

This paper offers a new perspective to ease the challenge of domain generalization, which involves maintaining robust results even in unseen environments. Our design focuses on the decision-making process in the final classifier layer. Specifically, we propose treating the element-wise contributions to the final results as the rationale for making a decision and representing the rationale for each sample as a matrix. For a well-generalized model, we suggest the rationale matrices for samples belonging to the same category should be similar, indicating the model relies on domain-invariant clues to make decisions, thereby ensuring robust results. To implement this idea, we introduce a rationale invariance loss as a simple regularization technique, requiring only a few lines of code. Our experiments demonstrate that the proposed approach achieves competitive results across various datasets, despite its simplicity. Code is available at https://github.com/liangchen527/RIDG.

Cite

Text

Chen et al. "Domain Generalization via Rationale Invariance." International Conference on Computer Vision, 2023. doi:10.1109/ICCV51070.2023.00168

Markdown

[Chen et al. "Domain Generalization via Rationale Invariance." International Conference on Computer Vision, 2023.](https://mlanthology.org/iccv/2023/chen2023iccv-domain/) doi:10.1109/ICCV51070.2023.00168

BibTeX

@inproceedings{chen2023iccv-domain,
  title     = {{Domain Generalization via Rationale Invariance}},
  author    = {Chen, Liang and Zhang, Yong and Song, Yibing and van den Hengel, Anton and Liu, Lingqiao},
  booktitle = {International Conference on Computer Vision},
  year      = {2023},
  pages     = {1751-1760},
  doi       = {10.1109/ICCV51070.2023.00168},
  url       = {https://mlanthology.org/iccv/2023/chen2023iccv-domain/}
}