Label Distribution Learning with Biased Annotations by Learning Multi-Label Representation
Not on the map. Why?
Abstract (arXiv)
Multi-label learning (MLL) has gained attention for its ability to represent real-world data. Label Distribution Learning (LDL), an extension of MLL to learning from label distributions, faces challenges in collecting accurate label distributions. To address the issue of biased annotations, based on the low-rank assumption, existing works recover true distributions from biased observations by exploring the label correlations. However, recent evidence shows that the label distribution tends to be full-rank, and naive apply of low-rank approximation on biased observation leads to inaccurate recovery and performance degradation. In this paper, we address the LDL with biased annotations problem from a novel perspective, where we first degenerate the soft label distribution into a hard multi-hot label and then recover the true label information for each instance. This idea stems from an insight that assigning hard multi-hot labels is often easier than assigning a soft label distribution, and it shows stronger immunity to noise disturbances, leading to smaller label bias. Moreover, assuming that the multi-label space for predicting label distributions is low-rank offers a more reasonable approach to capturing label correlations. Theoretical analysis and experiments confirm the effectiveness and robustness of our method on real-world datasets.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 5 of its 23 references that are in the map. First posted on arXiv 3 Feb 2025.
Builds on
5 of 23 references.
References · 5
- 2014Label Distribution Learningcited by 122
- 2017Multi-Label Learning with Global and Local Label Correlationcited by 39
- 2023Exploiting Multi-Label Correlation in Label Distribution Learningcited by 20
- 2023Inaccurate Label Distribution Learningcited by 10
- 2024Inaccurate Label Distribution Learning with Dependency Noisecited by 1
Built on by
Citing papers per year: 2025: 4; 2026: 1.
5 papers.
- 2025Global Prompt Refinement with Non-Interfering Attention Masking for One-Shot Federated Learningcited by 2
- 2025Geometrically Regularized Transfer Learning with On-Manifold and Off-Manifold Perturbationcited by 1
- 2026Detecting Unobserved Confounders: A Kernelized Regression Approachcited by 1
- 2025Disentangled Geometric Alignment with Adaptive Contrastive Perturbation for Reliable Domain Transfercited by 0
- 2025Dynamic Epsilon Scheduling: A Multi-Factor Adaptive Perturbation Budget for Adversarial Trainingcited by 0
- 2026Detecting Unobserved Confounders: A Kernelized Regression Approach1 Jan 2026
- 2025Global Prompt Refinement with Non-Interfering Attention Masking for One-Shot Federated Learning21 Sep 2025
- 2025Dynamic Epsilon Scheduling: A Multi-Factor Adaptive Perturbation Budget for Adversarial Training3 Jun 2025
- 2025Disentangled Geometric Alignment with Adaptive Contrastive Perturbation for Reliable Domain Transfer21 May 2025
- 2025Geometrically Regularized Transfer Learning with On-Manifold and Off-Manifold Perturbation21 May 2025