Unbiased Loss Functions for Extreme Classification With Missing Labels
The goal in extreme multi-label classification (XMC) is to tag an instance with a small subset of relevant labels from an extremely large set of possible labels. In addition to the computational burden arising from large number of training instances, features and labels, problems in XMC are faced with two statistical challenges, (i) large number of 'tail-labels' -- those which occur very infrequently, and (ii) missing labels as it is virtually impossible to manually assign every relevant label to an instance. In this work, we derive an unbiased estimator for general formulation of loss functions which decompose over labels, and then infer the forms for commonly used loss functions such as hinge- and squared-hinge-loss and binary cross-entropy loss. We show that the derived unbiased estimators, in the form of appropriate weighting factors, can be easily incorporated in state-of-the-art algorithms for extreme classification, thereby scaling to datasets with hundreds of thousand labels. However, empirically, we find a slightly altered version that gives more relative weight to tail labels to perform even better. We suspect is due to the label imbalance in the dataset, which is not explicitly addressed by our theoretically derived estimator. Minimizing the proposed loss functions leads to significant improvement over existing methods (up to 20% in some cases) on benchmark datasets in XMC.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationExtreme Multi-Label ClassificationGeneral ClassificationMissing LabelsMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATIONTAGSimilar Papers 제목 키워드 기반
Unbiased Loss Functions for Multilabel Classification with Missing Labels
This paper considers binary and multilabel classification problems in a setting where labels are missing independently and with a known rate. Missing labels are a ubiquitous phenomenon in extreme multi-label classificati…
ArticlesClassificationExtreme Multi-Label ClassificationMissing Labels+2On the Necessity of World Knowledge for Mitigating Missing Labels in Extreme Classification
Extreme Classification (XC) aims to map a query to the most relevant documents from a very large document set. XC algorithms used in real-world applications learn this mapping from datasets curated from implicit feedback…
ImputationMissing LabelsWorld KnowledgeUnbiased Black-Box Complexities of Jump Functions
We analyze the unbiased black-box complexity of jump functions with small, medium, and large sizes of the fitness plateau surrounding the optimal solution. Among other results, we show that when the jump size is $(1/2 …
A Generalized Unbiased Risk Estimator for Learning with Augmented Classes
In contrast to the standard learning paradigm where all classes can be observed in training data, learning with augmented classes (LAC) tackles the problem where augmented classes unobserved in the training data may emer…
Multi-class ClassificationBlack-Box Complexity of the Binary Value Function
The binary value function, or BinVal, has appeared in several studies in theory of evolutionary computation as one of the extreme examples of linear pseudo-Boolean functions. Its unbiased black-box complexity was previou…