English

Self-Paced Multi-Label Learning with Diversity

Machine Learning 2019-10-09 v1 Information Retrieval Machine Learning

Abstract

The major challenge of learning from multi-label data has arisen from the overwhelming size of label space which makes this problem NP-hard. This problem can be alleviated by gradually involving easy to hard tags into the learning process. Besides, the utilization of a diversity maintenance approach avoids overfitting on a subset of easy labels. In this paper, we propose a self-paced multi-label learning with diversity (SPMLD) which aims to cover diverse labels with respect to its learning pace. In addition, the proposed framework is applied to an efficient correlation-based multi-label method. The non-convex objective function is optimized by an extension of the block coordinate descent algorithm. Empirical evaluations on real-world datasets with different dimensions of features and labels imply the effectiveness of the proposed predictive model.

Keywords

Cite

@article{arxiv.1910.03497,
  title  = {Self-Paced Multi-Label Learning with Diversity},
  author = {Seyed Amjad Seyedi and S. Siamak Ghodsi and Fardin Akhlaghian and Mahdi Jalili and Parham Moradi},
  journal= {arXiv preprint arXiv:1910.03497},
  year   = {2019}
}
R2 v1 2026-06-23T11:37:46.348Z