2025· Neural Information Processing Systems· 0 citations· 35 references
Computer Science
TL;DR
This work proposes ComRank, a ranking loss framework for MLCLL, which encourages complementary labels to be ranked lower than non-complementary ones, thereby modeling pairwise label relationships and ensures Bayes consistency under both uniform and biased cases.
Abstract
Multi-label complementary label learning (MLCLL) is a weakly supervised paradigm that addresses multi-label learning (MLL) tasks using complementary labels (i.e., irrelevant labels) instead of relevant labels. Existing methods typically adopt an unbiased risk estimator (URE) under the assumption that complementary labels follow a uniform distribution. However, this assumption fails in real-world scenarios due to instance-specific annotation biases, making URE-based methods ineffective under such conditions. Furthermore, existing methods un-derutilize label correlations inherent in MLL. To address these limitations, we propose ComRank , a ranking loss framework for MLCLL, which encourages complementary labels to be ranked lower than non-complementary ones, thereby modeling pairwise label relationships. Theoretically, our surrogate loss ensures Bayes consistency under both uniform and biased cases. Experiments demonstrate the effectiveness of our method in MLCLL tasks. The code is available at https://github.com/JellyJamZhu/ComRank.
A novel PML method, namely Wasserstein Partial Multi-Label Learning with dual Label Correlation Perspectives (Wpml3cp), solved by the gradient descent with an augmented Lagrange multiplier technique, and empirical results demonstrate that Wpml3cp and Wpml3cp-D can outperform the PML baselines in various noisy levels.
Ximing Li, Yuanchao Dai, Bing Wang et al.· ACM Transactions on Knowledg...· 0 citations
This work proposes an integrated learning paradigm that simultaneously enhances feature compactness and improves robustness against label noise and introduces a feature disentanglement mechanism that isolates reliable label-related feature representations from spurious ones introduced by noisy supervision.
Yuzhi Tao, Anhui Tan· Computers, Materials & C...· 0 citations
This review consolidates the landscape of CP adaptations for MLL under a unified framework, examining the types of outputs and guarantees they provide, where label dependencies are incorporated, and how inference cost scales with the number of labels.
LDIBR performs instance-adaptive imputation conditioned on instance features and the binary observation mask, and learns a prior, a reliability-gated correction, and entry-wise fusion weights to produce a normalized imputed distribution.
Xiang-Cheng Sun, Miaogen Ling, Han Qin et al.· 0 citations
Experiments on two multi-expert ulcerative colitis endoscopic-image datasets under two ordinal-noise models show that Ord-NLL is competitive with or superior to strong baselines while reducing mean absolute error, and that Ord-NLL+ often yields further gains.
Shumpei Takezaki, K. Shiku, S. Harada et al.· IEEE Access· 0 citations