Sep 2026· Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence· 0 citations· 46 references
TL;DR
This work proposes a novel mutual information guided reinforcement learning framework for partial label disambiguation (MR-PLL), which is formulated as a sequential Markov decision process, where an agent dynamically discriminates whether to retain, modify, or abstain from correcting ambiguous labels.
Abstract
Partial-label learning (PLL) addresses challenging scenarios where each instance is associated with a set of candidate labels and only one is the truth. Most existing PLL methods rely on static disambiguation heuristics, which are prone to error propagation when the ambiguity labels are high. To address this issue, we propose a novel mutual information guided reinforcement learning framework for partial label disambiguation (MR-PLL). In this framework, label disambiguation is formulated as a sequential Markov decision process, where an agent dynamically discriminates whether to retain, modify, or abstain from correcting ambiguous labels. To ensure reliable decision making, we introduce a mutual information guided gating mechanism that adaptively adjusts the confidence of soft label propagation according to the dependency between feature representations and labels. The abstention mechanism allows the model to postpone uncertain decisions, resulting in more reliable disambiguation. Furthermore, we design an information weighted reward term during the actor-critic process to gradually improve the label disambiguation ability of the policy, and provide theoretical analysis on convergence and bias reduction. Experiments on benchmark and real datasets verify the effectiveness of the proposed algorithm.
This paper formulate PML pretraining as a relation disambiguation problem and proposes a confidence-aware relation contrastive learning framework, which improves subset accuracy and F1-oriented measures under moderate and severe partial-label noise.
Shen-Huan Lyu, Ning Chen, Can Jiao et al.· Electronics· 0 citations
Partial label learning (PLL) addresses the problem of learning from training examples with candidate label sets, where only one label is ground-truth. The key challenge lies in disambiguating the candidate labels while learning an accurate classifier. Graph-based PLL methods have emerged as a mainstream paradigm, which...
REHC-PML (Label Confidence REcovery with High-order Label Correlations in Partial Multi-label Learning), which mines frequent high-order co-occurrences from candidate sets to identify global high-order label correlations, selects instance-relevant correlations via Gumbel-Softmax pruning, and propagates their evidence t...
Yuanchao Dai, Xi-Ming Li, Ming-Kun Xie et al.· Proceedings of the Thirty-Fi...· 0 citations
Multi-instance partial-label learning (MIPL) deals with the task of learning from multi-instance bags associated with candidate label sets. Each bag contains a set of instances, and only one true label lies within its candidate label set. Existing MIPL methods, such as DEMIPL and MIPLGP, primarily rely on bag-level agg...
Zhen-Jue Zhu, Yi-Ning Sun, Yuan-Bo Wang et al.· Neural Networks· 0 citations
Existing class-incremental learning methods struggle in multi-label scenarios (MLCIL) due to the inherent contradiction of learning objectives arising from co-occurring and incomplete labels. We argue that the core obstacle is the model's ambiguous boundary between known and unknown knowledge, which undermines historic...
Ao-Ting Zhang, Dong-Bao Yang, Chang Liu et al.· 0 citations
When training large language models with reinforcement learning, terminal rewards provide little guidance about which steps matter. Common methods for assigning step credit overlook that work built on uncorrected mistakes is wasted while independent work remains valid. With only a final success/failure reward, every st...
Zi-Yi Chen, Yan Zhang, Jian-Hui Wei et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.