Fetching the paper…
Reading the bibliography…
Unsupervised domain adaptation (UDA) aims to transfer knowledge from a related but different well-labeled source domain to a new unlabeled target domain.
X. Wang, Y. Jin, M. Long, J. Wang, and M. I. Jordan, “Transferable normalization: Towards improving transferability of deep neural networks,” in Proc. NeurIPS , 2019, pp. 1953–1963
1963
Earlier work this paper cites.
J. Hoffman, E. Tzeng, T. Park, J.-Y. Zhu, P. Isola, K. Saenko, A. Efros, and T. Darrell, “Cycada: cycle-consistent adversarial domain adaptation,” in Proc. ICML , 2018, pp. 1989–1998
1998
Earlier work this paper cites.
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE , vol. 86, no. 11, pp. 2278–2324, 1998
1998
Earlier work this paper cites.
B. Zadrozny, “Learning and evaluating classifiers under sample selection bias,” in Proc. ICML , 2004, p. 114
2004
Earlier work this paper cites.
Y. Grandvalet and Y. Bengio, “Semi-supervised learning by entropy minimization,” in Proc. NeurIPS , 2005, pp. 529–536
2005
Earlier work this paper cites.
A. Gretton, K. Borgwardt, M. Rasch, B. Schölkopf, and A. J. Smola, “A kernel method for the two-sample-problem,” in Proc. NeurIPS , 2007, pp. 513–520
2007
Earlier work this paper cites.
J. Yang, R. Yan, and A. G. Hauptmann, “Cross-domain video concept detection using adaptive svms,” in Proc. ACM-MM , 2007, pp. 188–197
2007
Earlier work this paper cites.
M. Sugiyama, S. Nakajima, H. Kashima, P. V. Buenau, and M. Kawanabe, “Direct importance estimation with model selection and its application to covariate shift adaptation,” in Proc. NeurIPS , 2008, pp. 1433–1440
2008
Earlier work this paper cites.
S. J. Pan and Q. Yang, “A survey on transfer learning,” IEEE Transactions on Knowledge and Data Engineering , vol. 22, no. 10, pp. 1345–1359, 2009
2009
Earlier work this paper cites.
Y. Mansour, M. Mohri, and A. Rostamizadeh, “Domain adaptation with multiple sources,” in Proc. NeurIPS , 2009, pp. 1041–1048
2009
Earlier work this paper cites.
S. Ben-David, J. Blitzer, K. Crammer, A. Kulesza, F. Pereira, and J. W. Vaughan, “A theory of learning from different domains,” Machine Learning , vol. 79, no. 1-2, pp. 151–175, 2010
2010
Earlier work this paper cites.
K. Saenko, B. Kulis, M. Fritz, and T. Darrell, “Adapting visual category models to new domains,” in Proc. ECCV , 2010, pp. 213–226
2010
Earlier work this paper cites.
S. J. Pan, I. W. Tsang, J. T. Kwok, and Q. Yang, “Domain adaptation via transfer component analysis,” IEEE Transactions on Neural Networks , vol. 22, no. 2, pp. 199–210, 2010
2010
Earlier work this paper cites.
T. Tommasi, F. Orabona, and B. Caputo, “Safety in numbers: Learning categories from few examples with multi model knowledge transfer,” in Proc. CVPR , 2010, pp. 3081–3088
2010
Earlier work this paper cites.
A. Krause, P. Perona, and R. G. Gomes, “Discriminative clustering by regularized information maximization,” in Proc. NeurIPS , 2010
2010
Earlier work this paper cites.
X. Glorot, A. Bordes, and Y. Bengio, “Domain adaptation for large-scale sentiment classification: A deep learning approach,” in Proc. ICML , 2011, pp. 513–520
2011
Earlier work this paper cites.
Y. Shi and F. Sha, “Information-theoretical learning of discriminative clusters for unsupervised domain adaptation,” in Proc. ICML , 2012, pp. 1275–1282
2012
Earlier work this paper cites.
I. Kuzborskij and F. Orabona, “Stability and hypothesis transfer learning,” in Proc. ICML , 2013, pp. 942–950
2013
Earlier work this paper cites.
M. Long, J. Wang, G. Ding, J. Sun, and P. S. Yu, “Transfer feature learning with joint distribution adaptation,” in Proc. ICCV , 2013, pp. 2200–2207
2013
Earlier work this paper cites.
R. Gopalan, R. Li, and R. Chellappa, “Unsupervised adaptation across domain shifts by generating intermediate data representations,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 36, no. 11, pp. 2288–2302, 2013
2013
Earlier work this paper cites.
B. Fernando, A. Habrard, M. Sebban, and T. Tuytelaars, “Unsupervised visual domain adaptation using subspace alignment,” in Proc. ICCV , 2013, pp. 2960–2967
2013
Earlier work this paper cites.
D.-H. Lee, “Pseudo-label: The simple and efficient semi-supervised learning method for deep neural networks,” in ICML Workshop on Challenges in Representation Learning , 2013
2013
Earlier work this paper cites.
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial nets,” in Proc. NeurIPS , 2014, pp. 2672–2680
2014
Earlier work this paper cites.
J. Yosinski, J. Clune, Y. Bengio, and H. Lipson, “How transferable are features in deep neural networks?” in Proc. NeurIPS , 2014, pp. 3320–3328
2014
Earlier work this paper cites.
M. Long, Y. Cao, J. Wang, and M. Jordan, “Learning transferable features with deep adaptation networks,” in Proc. ICML , 2015, pp. 97–105
2015
Earlier work this paper cites.
Y. Ganin and V. Lempitsky, “Unsupervised domain adaptation by backpropagation,” in Proc. ICML , 2015, pp. 1180–1189
2015
Earlier work this paper cites.
C. Doersch, A. Gupta, and A. A. Efros, “Unsupervised visual representation learning by context prediction,” in Proc. ICCV , 2015, pp. 1422–1430
2015
Earlier work this paper cites.
S. Ioffe and C. Szegedy, “Batch normalization: Accelerating deep network training by reducing internal covariate shift,” in Proc. ICML , 2015, pp. 448–456
2015
Earlier work this paper cites.
M. Ghifary, W. B. Kleijn, M. Zhang, D. Balduzzi, and W. Li, “Deep reconstruction-classification networks for unsupervised domain adaptation,” in Proc. ECCV , 2016, pp. 597–613
2016
Earlier work this paper cites.
K. Bousmalis, G. Trigeorgis, N. Silberman, D. Krishnan, and D. Erhan, “Domain separation networks,” in Proc. NeurIPS , 2016, pp. 343–351
2016
Earlier work this paper cites.
B. Chidlovskii, S. Clinchant, and G. Csurka, “Domain adaptation in the absence of source domain data,” in Proc. KDD , 2016, pp. 451–460
2016
Earlier work this paper cites.
R. Zhang, P. Isola, and A. A. Efros, “Colorful image colorization,” in Proc. ECCV , 2016, pp. 649–666
2016
Earlier work this paper cites.
M. Noroozi and P. Favaro, “Unsupervised learning of visual representations by solving jigsaw puzzles,” in Proc. ECCV , 2016, pp. 69–84
2016
Earlier work this paper cites.
T. Salimans and D. P. Kingma, “Weight normalization: A simple reparameterization to accelerate training of deep neural networks,” in Proc. NeurIPS , 2016, pp. 901–909
2016
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proc. CVPR , 2016, pp. 770–778
2016
Earlier work this paper cites.
G. Csurka, “A comprehensive survey on domain adaptation for visual applications,” in Domain Adaptation in Computer Vision Applications . Springer, 2017, pp. 1–35
2017
Earlier work this paper cites.
E. Tzeng, J. Hoffman, K. Saenko, and T. Darrell, “Adversarial discriminative domain adaptation,” in Proc. CVPR , 2017, pp. 7167–7176
2017
Earlier work this paper cites.
W. Zellinger, T. Grubinger, E. Lughofer, T. Natschläger, and S. Saminger-Platz, “Central moment discrepancy (cmd) for domain-invariant representation learning,” in Proc. ICLR , 2017
2017
Earlier work this paper cites.
W. Hu, T. Miyato, S. Tokui, E. Matsumoto, and M. Sugiyama, “Learning discrete representations via information maximizing self-augmented training,” in Proc. ICML , 2017, pp. 1158–1167
2017
Earlier work this paper cites.
D. Li, Y. Yang, Y.-Z. Song, and T. M. Hospedales, “Deeper, broader and artier domain generalization,” in Proc. ICCV , 2017, pp. 5542–5550
2017
Earlier work this paper cites.
P. Panareda Busto and J. Gall, “Open set domain adaptation,” in Proc. ICCV , 2017, pp. 754–763
2017
Cited alongside, same era.
N. Courty, R. Flamary, D. Tuia, and A. Rakotomamonjy, “Optimal transport for domain adaptation,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 39, no. 9, pp. 1853–1865, 2017
2017
Cited alongside, same era.
F. M. Cariucci, L. Porzi, B. Caputo, E. Ricci, and S. R. Bulo, “Autodial: Automatic domain alignment layers,” in Proc. ICCV , 2017, pp. 5077–5085
2017
Cited alongside, same era.
K. Saito, Y. Ushiku, and T. Harada, “Asymmetric tri-training for unsupervised domain adaptation,” in Proc. ICML , 2017, pp. 2988–2997
2017
Cited alongside, same era.
H. Venkateswara, J. Eusebio, S. Chakraborty, and S. Panchanathan, “Deep hashing network for unsupervised domain adaptation,” in Proc. CVPR , 2017, pp. 5018–5027
2017
M. Caron, P. Bojanowski, J. Mairal, and A. Joulin, “Unsupervised pre-training of image features on non-curated data,” in Proc. ICCV , 2019, pp. 2959–2968
2019
Later among the works it cites.
J. Xu, L. Xiao, and A. M. López, “Self-supervised domain adaptation for computer vision tasks,” IEEE Access , vol. 7, pp. 156 694–156 706, 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
R. Xu, G. Li, J. Yang, and L. Lin, “Larger norm more transferable: An adaptive feature norm approach for unsupervised domain adaptation,” in Proc. ICCV , 2019, pp. 1426–1435
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
2017
Cited alongside, same era.
K. Saito, K. Watanabe, Y. Ushiku, and T. Harada, “Maximum classifier discrepancy for unsupervised domain adaptation,” in Proc. CVPR , 2018, pp. 3723–3732
2018
Cited alongside, same era.
Y. Zou, Z. Yu, B. Vijaya Kumar, and J. Wang, “Unsupervised domain adaptation for semantic segmentation via class-balanced self-training,” in Proc. ECCV , 2018, pp. 289–305
2018
Cited alongside, same era.
M. Peng, Q. Zhang, Y.-g. Jiang, and X.-J. Huang, “Cross-domain sentiment classification with target domain specific information,” in Proc. ACL , 2018, pp. 2505–2513
2018
Cited alongside, same era.
Y. Chen, W. Li, C. Sakaridis, D. Dai, and L. Van Gool, “Domain adaptive faster r-cnn for object detection in the wild,” in Proc. CVPR , 2018, pp. 3339–3348
2018
Cited alongside, same era.
W. Deng, L. Zheng, Q. Ye, G. Kang, Y. Yang, and J. Jiao, “Image-image domain adaptation with preserved self-similarity and domain-dissimilarity for person re-identification,” in Proc. CVPR , 2018, pp. 994–1003
2018
Cited alongside, same era.
S. Gidaris, P. Singh, and N. Komodakis, “Unsupervised representation learning by predicting image rotations,” in Proc. ICLR , 2018
2018
Cited alongside, same era.
2019
Later among the works it cites.
R. Müller, S. Kornblith, and G. E. Hinton, “When does label smoothing help?” in Proc. NeurIPS , 2019, pp. 4694–4703
2019
Later among the works it cites.
T.-H. Vu, H. Jain, M. Bucher, M. Cord, and P. Pérez, “Advent: Adversarial entropy minimization for domain adaptation in semantic segmentation,” in Proc. CVPR , 2019, pp. 2517–2526
2019
Later among the works it cites.
Z. Deng, Y. Luo, and J. Zhu, “Cluster alignment with a teacher for unsupervised domain adaptation,” in Proc. ICCV , 2019, pp. 9944–9953
2019
Later among the works it cites.
C.-Y. Lee, T. Batra, M. H. Baig, and D. Ulbricht, “Sliced wasserstein discrepancy for unsupervised domain adaptation,” in Proc. CVPR , 2019, pp. 10 285–10 295
2019
Later among the works it cites.
X. Chen, S. Wang, M. Long, and J. Wang, “Transferability vs. discriminability: Batch spectral penalization for adversarial domain adaptation,” in Proc. ICML , 2019, pp. 1081–1090
2019
Later among the works it cites.
Y. Zhang, T. Liu, M. Long, and M. Jordan, “Bridging theory and algorithm for domain adaptation,” in Proc. ICML , 2019, pp. 7404–7413
2019
Later among the works it cites.
Z. Cao, K. You, M. Long, J. Wang, and Q. Yang, “Learning to transfer examples for partial domain adaptation,” in Proc. CVPR , 2019, pp. 2985–2994
2019
Later among the works it cites.
M. Toldo, A. Maracani, U. Michieli, and P. Zanuttigh, “Unsupervised domain adaptation in semantic segmentation: a review,” Technologies , vol. 8, no. 2, p. 35, 2020
2020
Closest in time.
W. Li, F. Li, Y. Luo, P. Wang et al. , “Deep domain adaptive object detection: A survey,” in IEEE Symposium Series on Computational Intelligence (SSCI) , 2020, pp. 1808–1813
2020
Closest in time.
J. Liang, D. Hu, and J. Feng, “Do we really need to access the source data? source hypothesis transfer for unsupervised domain adaptation,” in Proc. ICML , 2020
2020
Closest in time.
Y. Zhang, P. David, H. Foroosh, and B. Gong, “A curriculum domain adaptation approach to the semantic segmentation of urban scenes,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 42, no. 08, pp. 1823–1841, 2020
2020
Closest in time.
R. Li, Q. Jiao, W. Cao, H.-S. Wong, and S. Wu, “Model adaptation: Unsupervised domain adaptation without source data,” in Proc. CVPR , 2020, pp. 9641–9650
2020
Closest in time.
X. Peng, Z. Huang, Y. Zhu, and K. Saenko, “Federated adversarial domain adaptation,” in Proc. ICLR , 2020
2020
Closest in time.
L. Jing and Y. Tian, “Self-supervised visual feature learning with deep neural networks: A survey,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2020
2020
Closest in time.
K. He, H. Fan, Y. Wu, S. Xie, and R. Girshick, “Momentum contrast for unsupervised visual representation learning,” in Proc. CVPR , 2020, pp. 9729–9738
2020
Closest in time.
T. Chen, S. Kornblith, M. Norouzi, and G. Hinton, “A simple framework for contrastive learning of visual representations,” in Proc. ICML , 2020
2020
Closest in time.
K. Saito, D. Kim, S. Sclaroff, and K. Saenko, “Universal domain adaptation through self supervision,” in Proc. NeurIPS , 2020
2020
Closest in time.
B. Wallace and B. Hariharan, “Extending and analyzing self-supervised learning across domains,” in Proc. ECCV , 2020, pp. 717–734
2020
Closest in time.
Z. Lu, Y. Yang, X. Zhu, C. Liu, Y.-Z. Song, and T. Xiang, “Stochastic classifiers for unsupervised domain adaptation,” in Proc. CVPR , 2020, pp. 9111–9120
2020
Closest in time.
S. Cui, S. Wang, J. Zhuo, L. Li, Q. Huang, and Q. Tian, “Towards discriminability and diversity: Batch nuclear-norm maximization under label insufficient situations,” in Proc. CVPR , 2020, pp. 3941–3950
2020
Closest in time.
S. Cui, S. Wang, J. Zhuo, C. Su, Q. Huang, and Q. Tian, “Gradually vanishing bridge for adversarial domain adaptation,” in Proc. CVPR , 2020, pp. 12 455–12 464
2020
Closest in time.
S. Li, C. H. Liu, Q. Lin, Q. Wen, L. Su, G. Huang, and Z. Ding, “Deep residual correction network for partial domain adaptation,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2020
2020
Closest in time.
Z. Chen, C. Chen, Z. Cheng, B. Jiang, K. Fang, and X. Jin, “Selective transfer with reinforced transfer network for partial domain adaptation,” in Proc. CVPR , 2020, pp. 12 706–12 714
2020
Closest in time.
J. Liang, Y. Wang, D. Hu, R. He, and J. Feng, “A balanced and uncertainty-aware approach for partial domain adaptation,” in Proc. ECCV , 2020, pp. 123–140
2020
Closest in time.
C.-X. Ren, P. Ge, P. Yang, and S. Yan, “Learning target-domain-specific classifier for partial domain adaptation,” IEEE Transactions on Neural Networks and Learning Systems , vol. 32, no. 5, pp. 1989–2001, 2020
2020
Closest in time.
D. Li and T. Hospedales, “Online meta-learning for multi-source and semi-supervised domain adaptation,” in Proc. ECCV , 2020, pp. 382–403
2020
Closest in time.
N. Venkat, J. N. Kundu, D. K. Singh, A. Revanur, and R. V. Babu, “Your classifier can secretly suffice multi-source domain adaptation,” in Proc. NeurIPS , 2020
2020
Closest in time.
L. Yang, Y. Balaji, S.-N. Lim, and A. Shrivastava, “Curriculum manager for source selection in multi-source domain adaptation,” in Proc. ECCV , 2020, pp. 608–624
2020
Closest in time.
2020
Closest in time.
S. Mishra, K. Saenko, and V. Saligrama, “Surprisingly simple semi-supervised domain adaptation with pretraining and consistency,” in Proc. BMVC , 2021
2021
Closest in time.
C. Qin, L. Wang, Q. Ma, Y. Yin, H. Wang, and Y. Fu, “Opposite structure learning for semi-supervised domain adaptation,” in Proc. SDM , 2021, pp. 576–584
2021
Closest in time.
2021
Closest in time.
Y. Zhang, P. David, and B. Gong, “Curriculum domain adaptation for semantic segmentation of urban scenes,” in Proc. ICCV , 2017, pp. 2020–2030
2030
Closest in time.
B. Sun, J. Feng, and K. Saenko, “Return of frustratingly easy domain adaptation,” in Proc. AAAI , 2016, pp. 2058–2065
2065
Closest in time.
B. Gong, Y. Shi, F. Sha, and K. Grauman, “Geodesic flow kernel for unsupervised domain adaptation,” in Proc. CVPR , 2012, pp. 2066–2073
2073
Closest in time.