Learning from Uncertain Similarity and Unlabeled Data

Meng Wei, Zhongnian Li, Peng Ying, Xinzheng Xu
9/15/2025
cs.LG

No official code found. Best implementation: WilsonMqz/USimUL (0 stars, last commit 2025-04-11).

Abstract

Existing similarity-based weakly supervised learning approaches often rely on precise similarity annotations between data pairs, which may inadvertently expose sensitive label information and raise privacy risks. To mitigate this issue, we propose Uncertain Similarity and Unlabeled Learning (USimUL), a novel framework where each similarity pair is embedded with an uncertainty component to reduce label leakage. In this paper, we propose an unbiased risk estimator that learns from uncertain similarity and unlabeled data. Additionally, we theoretically prove that the estimator achieves statistically optimal parametric convergence rates. Extensive experiments on both benchmark and real-world datasets show that our method achieves superior classification performance compared to conventional similarity-based approaches.

View on arXivView PDF

Code Implementations(1)

WilsonMqz/USimULCommunity68%

Learning from Uncertain Similarity and Unlabeled Data

00PythonApr 11, 20251 years ago

Cite this paper

@article{wei2025learning,
  title  = {Learning from Uncertain Similarity and Unlabeled Data},
  author = {Meng Wei and Zhongnian Li and Peng Ying and Xinzheng Xu},
  year   = {2025},
  eprint = {2509.11984},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.11984v1}
}

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/2509.11984.svg)](https://codeofpaper.com/paper/2509.11984)

Discussion