- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper focuses on the domain generalization problem, where a model is trained on several source domains and expected to generalize to unseen target domains. A common approach is to learn domain-invariant representations. However, this paper argues that relying on a single invariant prediction rule is limited. The core assumption of the paper is that if two domains have similar domain-level style distributions, their prediction rules should also be similar. Therefore, instead of completely discarding domain-specific information, the model can use such information to identify which source-domain prediction rules are more relevant to the target domain.
With the above intuition, LADDER learns a content representation for label prediction and a style representation for domain characterization. It uses domain-adversarial training to suppress domain information in the content representation, while encouraging the style representation to preserve domain information. It then trains a separate classifier for each source domain and stores the corresponding style distribution as a domain fingerprint. At test time, after observing a set of unlabeled samples from the same target domain, LADDER estimates the target style distribution, measures its distance to the source-domain fingerprints, and reweights the fixed source-specific classifiers accordingly to make predictions.
Critical strengths
-
Although leveraging domain-specific information to improve domain generalization is not entirely new, the paper provides a novel and convincing way of utilizing such information. In particular, LADDER uses the target domain’s style distribution to select and reweight source-specific prediction rules, rather than directly using style features for label prediction. I find this distribution-level routing perspective intuitive and compelling.
-
The theoretical analysis supports the main idea of the paper. It gives a principled explanation of why style-based routing should work, which strengthens the motivation behind the proposed method.
Critical weaknesses
-
The problem setting seems to be between domain generalization and domain adaptation. Although LADDER does not update model parameters at test time, it still needs a set of unlabeled target samples to estimate the target style distribution and change the weights of the source-specific classifiers. This is different from the standard DG setting, where the model usually makes predictions without using a batch of target-domain data to adjust its prediction rule. Therefore, the setting is closer to a target-aware setting, and also shares some similarity with unsupervised domain adaptation. The paper should explain more clearly why this setting is still considered domain generalization and how it differs from domain adaptation or test-time adaptation.
-
The experimental comparison is not fully fair. LADDER uses a set of unlabeled target-domain samples at test time to estimate the target style distribution, while several standard DG baselines, such as ERM and IRM, make predictions independently for each target sample and do not use this extra target-domain information. The paper should include more protocol-matched comparisons or separate the standard DG baselines from target-aware methods.
-
Since LADDER only reweights existing source-specific classifiers, its ability to extrapolate beyond the observed source domains may be limited. Although the paper includes an extrapolation experiment, the current evidence is insufficient to show that LADDER can generalize well to target domains that are substantially different from all source domains.
-
The presentation of the main proposal is too brief, and the paper moves quickly from the motivation to the formal method, so the key intuition behind LADDER is not explained in enough depth. In contrast, the theoretical section is relatively long and detailed. I think the paper would be easier to follow if more space were given to explaining the core proposal and problem setting, while some of the theoretical details were moved to the appendix.
Questions for authors
-
Could the authors better justify the considered setting and clarify its difference from unsupervised domain adaptation?
-
When comparing with existing methods, could the authors clarify which experimental comparisons are protocol-matched and which are not?
-
Could the authors provide more evidence on the extrapolation ability of LADDER?
General Response: Summary of Revisions and Additional Results
We thank the three reviewers for their careful reading and constructive comments. In response to the reviewers' suggestions, we have revised the manuscript and added experiments and theoretical analysis. The main updates are summarized below.
Additional real-world benchmarks. We added experiments on OfficeHome and DomainNet using the DomainBed leave-one-domain-out protocol. LADDER performs comparably to CORAL, the best-performing baseline on OfficeHome, and outperforms EQRM, the best-performing standard DG baseline in our DomainNet comparison. The results are reported in Section 4.3, Table 3, with experimental details in Appendix A.3.
Additional DG baseline. We added comparisons with Arith (CVPR 2025) on FMoW-WILDS, iWildCam-WILDS, and in simulation. The results are included in Sections 4.1–4.2 and Appendix A.2.1.
Target-summary size ablation on real data. We added a target-summary size ablation on FMoW-WILDS, evaluating LADDER with different numbers of unlabeled target samples. The results show that LADDER maintains similar accuracy even with a single target sample, while larger target summaries mainly improve stability. See Appendix A.2.5, Figure 15.
Extended extrapolation experiments. We expanded the simulation to evaluate target domains beyond both boundaries of the source range. LADDER maintains its accuracy advantage over the compared non-oracle methods across the tested target coordinates, while its target-parameter estimation error increases with extrapolation distance. See Appendix A.2.1, Figure 7.
Additional theoretical analysis. We introduced Theorem 4 to characterize when separate target-group style summaries improve prediction under heterogeneous target domains. We also clarified the assumptions underlying the theoretical guarantees and the role of the training objective in learning causal and style representations. These revisions appear in Sections 2.2, 3, and 3.3.
Clarifications to the methodology and experimental protocols. We revised the Abstract and Introduction to clarify the motivation for LADDER, the distinction between sample-level style features and domain-level style distributions, and the differences from domain adaptation and test-time adaptation. We expanded the training and inference overview in Section 2, clarified target-data access conditions and protocol-matched comparisons in Section 4, and highlighted the existing representation diagnostics in Appendix A.2.2. We also moved the full statements of Corollaries 1 and 2 to Appendix B.3 to improve readability.
We appreciate the reviewers' feedback and welcome further comments or questions regarding the revised manuscript.