2020/06/12 by Divyat Mahajan, Shruti Tople, Mahajan, Divyat +3 · 27 citations
Computer Science · Mathematics · #Artificial Intelligence (cs.AI) #Domain Adaptation and Few-Shot Learning #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Multimodal Machine Learning Applications #Topic Modeling #cs.AI #cs.LG #stat.ML
paper · pdf · doi:10.48550/arxiv.2006.07500
Proceedings of the 38th International Conference on Machine Learning (ICML), PMLR 139, 2021. (Long Talk)
openalex publication_date 2020/06/12 · arxiv created 2021/06/29 · arxiv updated 2021/06/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In the domain generalization literature, a common objective is to learn representations independent of the domain after conditioning on the class label. We show that this objective is not sufficient: there exist counter-examples where a model fails to generalize to unseen domains even after satisfying class-conditional domain invariance. We formalize this observation through a structural causal model and show the importance of modeling within-class variations for generalization. Specifically, classes contain objects that characterize specific causal features, and domains can be interpreted as interventions on these objects that change non-causal features. We highlight an alternative condition: inputs across domains should have the same representation if they are derived from the same object. Based on this objective, we propose matching-based algorithms when base objects are observed (e.g., through data augmentation) and approximate the objective when objects are not observed (MatchDG). Our simple matching-based algorithms are competitive to prior work on out-of-domain accuracy for rotated MNIST, Fashion-MNIST, PACS, and Chest-Xray datasets. Our method MatchDG also recovers ground-truth object matches: on MNIST and Fashion-MNIST, top-10 matches from MatchDG have over 50% overlap with ground-truth matches.