Metraipolis › archive › dc_fdf197678a7e

Importance Weighting for Unlabeled-unlabeled Learning under Distribution Shift — arXiv:2609.10994

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.10994
License (as archived)
CC0-1.0
Archived
2026-10-16T05:26:45.725Z
SHA-256 of the archived text
4c57a70d4c481a5d460101f2dd8859c01626bc0397112b61bcac97b365e9f8d1
Stable URL of this page
https://metraipolis.com/documento/dc_fdf197678a7e

How to cite

Importance Weighting for Unlabeled-unlabeled Learning under Distribution Shift — arXiv:2609.10994 — arXiv (en), https://arxiv.org/abs/2609.10994 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fdf197678a7e (Metraipolis archive dc_fdf197678a7e, sha256 4c57a70d4c481a5d460101f2dd8859c01626bc0397112b61bcac97b365e9f8d1)
BibTeX
@misc{dcfdf197678a7e,
  title = {Importance Weighting for Unlabeled-unlabeled Learning under Distribution Shift — arXiv:2609.10994},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.10994},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fdf197678a7e; sha256 4c57a70d4c481a5d460101f2dd8859c01626bc0397112b61bcac97b365e9f8d1},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.10994. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Unlabeled-unlabeled (UU) learning allows us to learn a binary classifier from two sets of unlabeled data with different class-priors. It is a general framework because it includes a wide variety of supervised learning such as positive-unlabeled (PU) learning, noisy label learning, and similarity-based learning. Existing UU learning assumes that the test and training distributions have the same class-conditional densities. However, this assumption rarely holds in practice due to distribution shifts. This paper proposes a distribution shift adaptation method for UU learning that uses UU data in the training distribution and a few UU data in the test distribution. The proposed method is based on the importance weighting, which minimizes the test risk by using training data with estimated importance weights. Although existing importance weighting methods cannot handle UU data, we show that it can be done in a principled manner. Thanks to the generality of UU learning, our method can handle various learning problems such as PU and noisy label learning under distribution shift within a single framework while existing methods are usually tailored to a specific problem. Moreover, it does not require any assumption of the shift types such as covariate shift. We experimentally demonstrate the effectiveness of the proposed method with real-world datasets.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-11 in cs.AI).
Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2609.10994 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T05:17:52.106Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).