- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies domain adaptation under unobserved confounding and proposes an abduction–deduction entanglement framework. The method introduces representation transplants to preserve shared deduction while modifying domain-specific abduction, and employs Causal Robust Optimization (CRO) to improve robustness under distribution shifts. Theoretical results characterize partial transportability under specific assumptions, while experiments on Colored MNIST, a synthetic moral questionnaire, and TerraIncognita evaluate the proposed framework.
Critical strengths
-
The paper addresses an interesting and challenging problem in domain adaptation by considering unobserved confounding and changes in the optimal prediction rule across domains.
-
The proposed representation transplant mechanism provides an interesting connection between causal modeling and representation learning. The theoretical analysis offers a structured formulation of partial transportability under explicit assumptions.
-
The experiments on Colored MNIST and the controlled moral questionnaire demonstrate the potential of the proposed approach under severe changes in spurious correlations.
Critical weaknesses
1. Insufficient experimental validation on challenging real-world benchmarks. The experimental evaluation relies heavily on Colored MNIST and a controlled moral questionnaire, which may not adequately reflect complex real-world domain shifts. Although TerraIncognita is included, CRO achieves only 46.1% accuracy, comparable to ERM and below several existing methods. Additional evaluations on standard benchmarks, such as Office-31, Office-Home, or DomainNet, are needed to demonstrate the effectiveness and generalizability of the proposed framework.
2. Limited evidence from the Colored MNIST benchmark. The main performance improvement is observed on the artificially constructed reversed-color environment of Colored MNIST. Although this benchmark is useful for studying spurious correlations, it provides limited evidence of generalization to complex real-world shifts. Moreover, the proposed method achieves only 60.5% accuracy on the reversed-color target, while a color-independent digit predictor has a theoretical reference accuracy of approximately 75% under the dataset construction. Comparisons with simple color-invariant training strategies and stronger baselines would be valuable.
3. Strong theoretical assumptions. The theoretical formulation relies on several restrictive assumptions, including shared deduction mechanisms, linear abduction and deduction maps, and closure under representation transplants. It remains unclear whether these assumptions approximately hold for high-dimensional representations extracted by modern neural networks.
4. The gap between theoretical guarantees and practical implementation. Theorem 4.1 establishes minimax optimality under exact feasibility constraints and global optimization assumptions. However, the practical implementation relies on approximate support matching, nearest-neighbor evaluation, and local optimization, which do not guarantee satisfaction of these conditions. Moreover, the optimized transplanted-source risk is not necessarily equivalent to the actual target risk.
5. Insufficient ablation studies of the core components. The paper lacks sufficient ablation studies to isolate the contributions of representation transplantation and adversarial optimization. It remains unclear whether the improvements arise from the proposed abduction–deduction mechanism or conventional robust optimization. Additional component-wise ablations and sensitivity analyses of the latent cardinality would strengthen the experimental validation.
6. Limited evidence for the effectiveness of unsupervised domain adaptation. Although the paper evaluates both DG and UDA settings, incorporating unlabeled target data does not consistently improve performance. Moreover, some comparisons use different test subsets, making it difficult to assess the actual contribution of target-domain information. The authors should provide controlled DG and UDA comparisons using identical evaluation sets and analyze why unlabeled target data sometimes fails to improve performance.
Questions for authors
Please see the Weaknesses section above.
Thank you for reviewing our work
General response (to all reviewers)
We thank the reviewers for their careful reading, and for recognizing the central idea of the paper: when the mechanism of the label is shared across domains but unobserved confounding changes, prediction rules differ from domain to domain, and the sources still constrain what can be predicted. The revision we have uploaded keeps this idea and strengthens the paper on every point you raised.
The title is now Abductive Causal Models for Robust & Generalizable Learning, after the object the paper contributes. We invite you to read the revised manuscript: we believe it answers each of your concerns, as detailed in the individual responses.
Response to Reviewer GcMa
Thank you for the positive assessment, and for seeing the potential of the model beyond this paper.
Response to Reviewer Z68w
Thank you for highlighting the causal account of why a shared prediction mechanism does not guarantee transfer. The revision builds the whole paper on it.