On the Learnability of Multilabel Ranking

Vinod Raman, Unique Subedi, Ambuj Tewari
4/6/2023
cs.LGstat.ML

No confident code implementation found for this paper.

Abstract

Multilabel ranking is a central task in machine learning. However, the most fundamental question of learnability in a multilabel ranking setting with relevance-score feedback remains unanswered. In this work, we characterize the learnability of multilabel ranking problems in both batch and online settings for a large family of ranking losses. Along the way, we give two equivalence classes of ranking losses based on learnability that capture most, if not all, losses used in practice.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{raman2023learnability,
  title  = {On the Learnability of Multilabel Ranking},
  author = {Vinod Raman and Unique Subedi and Ambuj Tewari},
  year   = {2023},
  eprint = {2304.03337},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.03337v2},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.03337.svg)](https://codeofpaper.com/paper/2304.03337)

Discussion