TY - GEN
T1 - UniDEC
T2 - 34th ACM Web Conference, WWW 2025
AU - Kharbanda, Siddhant
AU - Gupta, Devaansh
AU - Gururaj, K.
AU - Malhotra, Pankaj
AU - Singh, Amit
AU - Hsieh, Cho Jui
AU - Babbar, Rohit
PY - 2025/4/22
Y1 - 2025/4/22
N2 - Extreme Multi-label Classification (XMC) involves predicting a subset of relevant labels from an extremely large label space, given an input query and labels with textual features. Models developed for this problem have conventionally made use of dual encoder (DE) to embed the queries and label texts and one-vs-all (OvA) classifiers to rerank the shortlisted labels by the DE. While such methods have shown empirical success, a major drawback is their computational cost, often requiring upto 16 GPUs to train on the largest public dataset. Such a high cost is a consequence of calculating the loss over the entire label space. While shortlisting strategies have been proposed for classifiers, we aim to study such methods for the DE framework. In this work, we develop UniDEC, a loss-independent, end-to-end trainable framework which trains the DE and classifier together in a unified manner with a multi-class loss, while reducing the computational cost by 4 − 16×. This is done via the proposed pick-some-label (PSL) reduction, which aims to compute the loss on only a subset of positive and negative labels. These labels are carefully chosen in-batch so as to maximise their supervisory signals. Not only does the proposed framework achieve state-of-the-art results on datasets with labels in the order of millions, it is also computationally and resource efficient in achieving this performance on a single GPU.
AB - Extreme Multi-label Classification (XMC) involves predicting a subset of relevant labels from an extremely large label space, given an input query and labels with textual features. Models developed for this problem have conventionally made use of dual encoder (DE) to embed the queries and label texts and one-vs-all (OvA) classifiers to rerank the shortlisted labels by the DE. While such methods have shown empirical success, a major drawback is their computational cost, often requiring upto 16 GPUs to train on the largest public dataset. Such a high cost is a consequence of calculating the loss over the entire label space. While shortlisting strategies have been proposed for classifiers, we aim to study such methods for the DE framework. In this work, we develop UniDEC, a loss-independent, end-to-end trainable framework which trains the DE and classifier together in a unified manner with a multi-class loss, while reducing the computational cost by 4 − 16×. This is done via the proposed pick-some-label (PSL) reduction, which aims to compute the loss on only a subset of positive and negative labels. These labels are carefully chosen in-batch so as to maximise their supervisory signals. Not only does the proposed framework achieve state-of-the-art results on datasets with labels in the order of millions, it is also computationally and resource efficient in achieving this performance on a single GPU.
KW - contrastive learning
KW - dual-encoders
KW - extreme classification
KW - extreme classifiers
KW - hard-negative mining
KW - multi-label classification
UR - https://www.scopus.com/pages/publications/105005138560
U2 - 10.1145/3696410.3714704
DO - 10.1145/3696410.3714704
M3 - Chapter in a published conference proceeding
AN - SCOPUS:105005138560
T3 - WWW 2025 - Proceedings of the ACM Web Conference
SP - 4124
EP - 4133
BT - WWW 2025 - Proceedings of the ACM Web Conference
PB - Association for Computing Machinery
CY - U. S. A.
Y2 - 28 April 2025 through 2 May 2025
ER -