Fetching the paper…
Reading the bibliography…
In Open Set Domain Adaptation (OSDA), large amounts of target samples are drawn from the implicit categories that never appear in the source domain.
“Who belongs in the family?,”
Robert L Thorndike, · 1953
Earlier work this paper cites.
“k-means++: The advantages of careful seeding,”
David Arthur and Sergei Vassilvitskii, · 2007
Earlier work this paper cites.
Finding groups in data: an introduciton to cluster analysis
Leonard Kaufman and Peter J Rousseeuw, · 2009
Earlier work this paper cites.
“Adapting visual category models to new domains,”
Kate Saenko, Brian Kulis, Mario Fritz, and Trevor Darrell, · 2010
Earlier work this paper cites.
“Learning transferable features with deep adaptation networks,”
Mingsheng Long et al., · 2015
Earlier work this paper cites.
“Imagenet large scale visual recognition challenge,”
Olga Russakovsky, Jia Deng, Hao Su, Jonathan Krause, Sanjeev Satheesh, Sean Ma, Zhiheng Huang, Andrej Karpathy, Aditya Khosla, Michael Bernstein, et al., · 2015
Earlier work this paper cites.
“Batch normalization: Accelerating deep network training by reducing internal covariate shift,”
Sergey Ioffe and Christian Szegedy, · 2015
Earlier work this paper cites.
“Unsupervised deep embedding for clustering analysis,”
Junyuan Xie, Ross Girshick, and Ali Farhadi, · 2016
Earlier work this paper cites.
“Open set domain adaptation,”
Pau Panareda Busto and Juergen Gall, · 2017
Cited alongside, same era.
“Deep transfer learning with joint adaptation networks,”
Mingsheng Long et al., · 2017
Cited alongside, same era.
“Domain-adversarial training of neural networks,”
Yaroslav Ganin, Evgeniya Ustinova, et al., · 2017
Cited alongside, same era.
“Deep hashing network for unsupervised domain adaptation,”
Hemanth Venkateswara, Jose Eusebio, Shayok Chakraborty, and Sethuraman Panchanathan, · 2017
Cited alongside, same era.
“Open set domain adaptation by backpropagation,”
Kuniaki Saito, Shohei Yamamoto, et al., · 2018
Cited alongside, same era.
“A dirt-t approach to unsupervised domain adaptation,”
Rui Shu et al., · 2018
Cited alongside, same era.
“Moment matching for multi-source domain adaptation,”
Xingchao Peng, Qinxun Bai, Xide Xia, Zijun Huang, Kate Saenko, and Bo Wang, · 2019
Later among the works it cites.
“Do we really need to access the source data? source hypothesis transfer for unsupervised domain adaptation,”
Jian Liang et al., · 2020
Later among the works it cites.
“Towards inheritable models for open-set domain adaptation,”
Jogendra Nath Kundu et al., · 2020
Later among the works it cites.
“Joint partial optimal transport for open set domain adaptation.,”
Renjun Xu et al., · 2020
Later among the works it cites.
“Automatically discovering and learning new visual categories with ranking statistics,”
Kai Han et al., · 2020
Later among the works it cites.
“Progressive graph learning for open-set domain adaptation,”
Yadan Luo, Zijian Wang, Zi Huang, and Mahsa Baktashmotlagh, · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Separate to adapt: Open set domain adaptation via progressive separation,”
Hong Liu et al., · 2019
Cited alongside, same era.
“Learning to discover novel visual categories via deep transfer clustering,”
Kai Han, Andrea Vedaldi, and Andrew Zisserman, · 2019
Cited alongside, same era.
“Finding a ”kneedle” in a haystack: Detecting knee points in system behavior,”
V. Satopaa et al.,
Cited in the paper.
Later among the works it cites.
“Minimum class confusion for versatile domain adaptation,”
Ying Jin et al., · 2020
Later among the works it cites.