Overcoming Data Inequality across Domains with Semi-Supervised Domain Generalization

Jinha Park, Wonguk Cho, Taesup Kim
3/8/2024
cs.LGcs.AIcs.CV

No confident code implementation found for this paper. 5 possible matches can be shown below.

Abstract

While there have been considerable advancements in machine learning driven by extensive datasets, a significant disparity still persists in the availability of data across various sources and populations. This inequality across domains poses challenges in modeling for those with limited data, which can lead to profound practical and ethical concerns. In this paper, we address a representative case of data inequality problem across domains termed Semi-Supervised Domain Generalization (SSDG), in which only one domain is labeled while the rest are unlabeled. We propose a novel algorithm, ProUD, which can effectively learn domain-invariant features via domain-aware prototypes along with progressive generalization via uncertainty-adaptive mixing of labeled and unlabeled domains. Our experiments on three different benchmark datasets demonstrate the effectiveness of ProUD, outperforming all baseline models including single domain generalization and semi-supervised learning. Source code will be released upon acceptance of the paper.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 5 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{park2024overcoming,
  title  = {Overcoming Data Inequality across Domains with Semi-Supervised Domain Generalization},
  author = {Jinha Park and Wonguk Cho and Taesup Kim},
  year   = {2024},
  eprint = {2403.05209},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.05209v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.05209.svg)](https://codeofpaper.com/paper/2403.05209)

Discussion