Combining Supervised Learning and Reinforcement Learning for Multi-Label Classification Tasks with Partial Labels
Not on the map. Why?
Abstract (arXiv)
Traditional supervised learning heavily relies on human-annotated datasets, especially in data-hungry neural approaches. However, various tasks, especially multi-label tasks like document-level relation extraction, pose challenges in fully manual annotation due to the specific domain knowledge and large class sets. Therefore, we address the multi-label positive-unlabelled learning (MLPUL) problem, where only a subset of positive classes is annotated. We propose Mixture Learner for Partially Annotated Classification (MLPAC), an RL-based framework combining the exploration ability of reinforcement learning and the exploitation ability of supervised learning. Experimental results across various tasks, including document-level relation extraction, multi-label image classification, and binary PU learning, demonstrate the generalization and effectiveness of our framework.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 26 of its 49 references that are in the map. First posted on arXiv 24 Jun 2024.
Builds on
26 of 49 references.
References · 26
- 2014Microsoft COCO: Common Objects in Contextcited by 17,498
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2020Asymmetric Loss For Multi-Label Classificationcited by 379
- 2019DocRED: A Large-Scale Document-Level Relation Extraction Datasetcited by 239
- 2017Positive-Unlabeled Learning with Non-Negative Risk Estimatorcited by 217
- 2021RvS: What is Essential for Offline RL via Supervised Learning?cited by 184
- 2016An Actor-Critic Algorithm for Sequence Predictioncited by 158
- 2019Learning a Deep ConvNet for Multi-label Classification with Partial Labelscited by 124
- 2022SURF: Semi-supervised Reward Learning with Data Augmentation for Feedback-efficient Preference-based Reinforcement Learningcited by 96
- 2021Multi-Label Learning from Single Positive Labelscited by 81
- 2022Revisiting DocRED -- Addressing the False Negative Problem in Relation Extractioncited by 57
- 2018Reinforcement Learning for Relation Classification from Noisy Datacited by 46
14 more
- 2023DREEAM: Guiding Attention with Evidence for Improving Document-Level Relation Extractioncited by 37
- 2018Robust Distant Supervision Relation Extraction via Deep Reinforcement Learningcited by 35
- 2020Empirical Analysis of Unlabeled Entity Problem in Named Entity Recognitioncited by 34
- 2019Named Entity Recognition with Partially Annotated Training Datacited by 27
- 2021Multi-label Classification with Partial Annotations using Class-aware Selective Losscited by 25
- 2023Waypoint Transformer: Reinforcement Learning via Supervised Learning with Intermediate Targetscited by 22
- 2022Does Recommend-Revise Produce Reliable Annotations? An Analysis on Missing Instances in DocREDcited by 19
- 2022A Unified Positive-Unlabeled Learning Framework for Document-Level Relation Extraction with Different Levels of Labelingcited by 9
- 2021Partially Supervised Named Entity Recognition via the Expected Entity Ratio Losscited by 7
- 2022G2NetPL: Generic Game-Theoretic Network for Partial-Label Image Classificationcited by 7
- 2023Uncertainty Guided Label Denoising for Document-level Distant Relation Extractioncited by 7
- 2022An Effective Approach for Multi-label Classification with Missing Labelscited by 5
- 2023A Positive-Unlabeled Metric Learning Framework for Document-Level Relation Extraction with Incomplete Labelingcited by 4
- 2019Deep Ranking Based Cost-sensitive Multi-label Learning for Distant Supervision Relation Extractioncited by 1
Built on by
Citing papers per year: 2025: 2.
2 papers.