Open-Set Heterogeneous Domain Adaptation: Theoretical Analysis and Algorithm
Not on the map. Why?
Abstract (arXiv)
Domain adaptation (DA) tackles the issue of distribution shift by learning a model from a source domain that generalizes to a target domain. However, most existing DA methods are designed for scenarios where the source and target domain data lie within the same feature space, which limits their applicability in real-world situations. Recently, heterogeneous DA (HeDA) methods have been introduced to address the challenges posed by heterogeneous feature space between source and target domains. Despite their successes, current HeDA techniques fall short when there is a mismatch in both feature and label spaces. To address this, this paper explores a new DA scenario called open-set HeDA (OSHeDA). In OSHeDA, the model must not only handle heterogeneity in feature space but also identify samples belonging to novel classes. To tackle this challenge, we first develop a novel theoretical framework that constructs learning bounds for prediction error on target domain. Guided by this framework, we propose a new DA method called Representation Learning for OSHeDA (RL-OSHeDA). This method is designed to simultaneously transfer knowledge between heterogeneous data sources and identify novel classes. Experiments across text, image, and clinical data demonstrate the effectiveness of our algorithm. Model implementation is available at urlhttps://github.com/pth1993/OSHeDA.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 60 references that are in the map. First posted on arXiv 17 Dec 2024.
Builds on
22 of 60 references.
References · 22
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2015Domain-Adversarial Training of Neural Networkscited by 3,044
- 2020Big Bird: Transformers for Longer Sequencescited by 1,684
- 2019Big Transfer (BiT): General Visual Representation Learningcited by 769
- 2013DeCAF: A Deep Convolutional Activation Feature for Generic Visual Recognitioncited by 424
- 2017Positive-Unlabeled Learning with Non-Negative Risk Estimatorcited by 219
- 2018Open Set Domain Adaptation by Backpropagationcited by 150
- 2020Multi-Task Curriculum Framework for Open-Set Semi-Supervised Learningcited by 82
- 2020On the Effectiveness of Image Rotation for Open Set Domain Adaptationcited by 72
- 2020Progressive Graph Learning for Open-Set Domain Adaptationcited by 56
- 2019Open Set Domain Adaptation: Theoretical Bound and Algorithmcited by 48
10 more
- 2021Trash to Treasure: Harvesting OOD Data with Cross-Modal Matching for Open-Set Semi-Supervised Learningcited by 40
- 2021KL Guided Domain Adaptationcited by 35
- 2018Some Theoretical Properties of GANscited by 27
- 2023Fairness and Accuracy under Domain Generalizationcited by 24
- 2020Simultaneous Semantic Alignment Network for Heterogeneous Domain Adaptationcited by 21
- 2013Efficient Learning of Domain-invariant Image Representationscited by 20
- 2017Heterogeneous domain adaptation: An unsupervised approachcited by 17
- 2019Heterogeneous Domain Adaptation via Soft Transfer Networkcited by 14
- 2023Semi-Supervised Learning via Weight-aware Distillation under Class Distribution Mismatchcited by 8
- 2024Non-stationary Domain Generalization: Theory and Algorithmcited by 4
Built on by
Not cited yet.