- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes JCAR, a two-stage UDA method that jointly learns a shared representation from unlabeled source and target data via contrastive learning and adversarial alignment, then freezes it for source-supervised prediction. However, the experiments do not support the abstract’s claimed transfer gains.
Critical strengths
None
Critical weaknesses
Weaknesses 1: The main-paper results do not match the gains claimed in the paper: despite comparing only with traditional baselines such as ERM[1] (1991), DANN[2] (2015) and CDAN[3] (2018), JCAR remains substantially below all baselines on Office-Home (table 2).
Weaknesses 2: The appendix exceeds 20 pages while the main text is only 8 pages, with most experiments relegated to the appendix, leaving the main-paper evaluation highly insufficient.
[1]Vapnik V. Principles of risk minimization for learning theory[J]. Advances in neural information processing systems, 1991, 4.
[2]Ganin Y, Lempitsky V. Unsupervised domain adaptation by backpropagation[C]//International conference on machine learning. PMLR, 2015: 1180-1189.
[3] Long M, Cao Z, Wang J, et al. Conditional adversarial domain adaptation[J]. Advances in neural information processing systems, 2018, 31.
Questions for authors
Why are the from-scratch results so low? Could the authors clarify whether this is due to an issue with the experimental setup or training bugs?
Dear reviewers and authors,
With limited time left for discussion, please keep an eye on the newest replies and comments and deal with any outstanding concerns promptly. Thank you!
AC