Author
Listed:
- Kuniaki Saito
(The University of Tokyo)
- Shohei Yamamoto
(The University of Tokyo)
- Yoshitaka Ushiku
(The University of Tokyo)
- Tatsuya Harada
(The University of Tokyo and RIKEN)
Abstract
Many methods have been proposed for adapting a model trained in a label-rich domain (source) to a label-scarce domain (target). These methods have the assumption that these domains completely have the same the categories. However, if examples in target domain are not given label, we cannot make sure that the domains share the category. A target domain may include examples of categories that the source domain does not have (open set domain adaptation), or some categories can be absent in the target domain (partial domain adaptation). Methods that perform well in this situation are very useful. In this chapter, we briefly summarize non-closed domain adaptation settings in the related work and introduce a method for open set domain adaptation. We define the shared class as the known class and the unshared class as the unknown class. Most existing distribution matching based methods do not work well in the open set situation because unknown target samples should not be matched with the source. In this chapter, we introduce a method which utilizes adversarial training (Saito et al. (Open set domain adaptation by backpropagation. In: Proceedings of the European Conference on Computer Vision (ECCV), 2018)). A classifier is trained to make a boundary between the source and the target samples whereas a generator is trained to make target samples far from the boundary. The key idea of the method is to assign two options to the feature generator: aligning them with source known samples or rejecting them as unknown samples. This approach allows to extract features that separate unknown target samples from known target samples.
Suggested Citation
Kuniaki Saito & Shohei Yamamoto & Yoshitaka Ushiku & Tatsuya Harada, 2020.
"Adversarial Learning Approach for Open Set Domain Adaptation,"
Springer Books, in: Hemanth Venkateswara & Sethuraman Panchanathan (ed.), Domain Adaptation in Computer Vision with Deep Learning, chapter 0, pages 175-193,
Springer.
Handle:
RePEc:spr:sprchp:978-3-030-45529-3_10
DOI: 10.1007/978-3-030-45529-3_10
Download full text from publisher
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below whether another version of this item is available online.
2. Check on the provider's
web page
whether it is in fact available.
3. Perform a
for a similarly titled item that would be
available.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-030-45529-3_10. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.