# Adversarial Partial Multi-Label Learning

arXiv: https://arxiv.org/abs/1909.06717 · HTML: https://mlsanity.com/paper/1909.06717/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 Sep 2019.

## Built on by (most cited first, 5 of 5)

- [Spatial Consistency Loss for Training Multi-Label Classifiers from Single-Label Annotations](https://mlsanity.com/paper/2203.06127/) (2022)
- [CCMN: A General Framework for Learning with Class-Conditional Multi-Label Noise](https://mlsanity.com/paper/2105.07338/) (2021)
- [Partial Wasserstein Adversarial Network for Non-rigid Point Set Registration](https://mlsanity.com/paper/2203.02227/) (2022)
- [Deep Partial Multi-Label Learning with Graph Disambiguation](https://mlsanity.com/paper/2305.05882/) (2023)
- [ProPML: Probability Partial Multi-label Learning](https://mlsanity.com/paper/2403.07603/) (2024)

## Abstract (arXiv)

Partial multi-label learning (PML), which tackles the problem of learning multi-label prediction models from instances with overcomplete noisy annotations, has recently started gaining attention from the research community. In this paper, we propose a novel adversarial learning model, PML-GAN, under a generalized encoder-decoder framework for partial multi-label learning. The PML-GAN model uses a disambiguation network to identify noisy labels and uses a multi-label prediction network to map the training instances to the disambiguated label vectors, while deploying a generative adversarial network as an inverse mapping from label vectors to data samples in the input feature space. The learning of the overall model corresponds to a minimax adversarial game, which enhances the correspondence of input features with the output labels in a bi-directional mapping. Extensive experiments are conducted on multiple datasets, while the proposed model demonstrates the state-of-the-art performance for partial multi-label learning.
