Prototypical Extreme Multi-label Classification with a Dynamic Margin Loss
Not on the map. Why?
Abstract (arXiv)
Extreme Multi-label Classification (XMC) methods predict relevant labels for a given query in an extremely large label space. Recent works in XMC address this problem using deep encoders that project text descriptions to an embedding space suitable for recovering the closest labels. However, learning deep models can be computationally expensive in large output spaces, resulting in a trade-off between high performing brute-force approaches and efficient solutions. In this paper, we propose PRIME, a XMC method that employs a novel prototypical contrastive learning technique to reconcile efficiency and performance surpassing brute-force approaches. We frame XMC as a data-to-prototype prediction task where label prototypes aggregate information from related queries. More precisely, we use a shallow transformer encoder that we coin as Label Prototype Network, which enriches label representations by aggregating text-based embeddings, label centroids and learnable free vectors. We jointly train a deep encoder and the Label Prototype Network using an adaptive triplet loss objective that better adapts to the high granularity and ambiguity of extreme label spaces. PRIME achieves state-of-the-art results in several public benchmarks of different sizes and domains, while keeping the model efficient.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 27 of its 56 references that are in the map. First posted on arXiv 27 Oct 2024.
Builds on
27 of 56 references.
References · 27
- 2017Attention Is All You Needcited by 59,932
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,833
- 2017Billion-scale similarity search with GPUscited by 2,477
- 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
- 2022Text Embeddings by Weakly-Supervised Contrastive Pre-trainingcited by 1,216
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
- 2021Pay Attention to MLPscited by 367
- 2020Autoregressive Entity Retrievalcited by 333
15 more
- 2021GraphFormers: GNN-nested Transformers for Representation Learning on Textual Graphcited by 143
- 2016DiSMEC - Distributed Sparse Machines for Extreme Multi-label Classificationcited by 70
- 2021LightXML: Transformer with Dynamic Negative Sampling for High-Performance Extreme Multi-label Text Classificationcited by 61
- 2021ECLARE: Extreme Classification with Label Graph Correlationscited by 38
- 2021DeepXML: A Deep Extreme Multi-Label Learning Framework Applied to Short Text Documentscited by 37
- 2022NGAME: Negative Mining-aware Mini-batching for Extreme Classificationcited by 32
- 2021Pairwise Supervised Contrastive Learning of Sentence Representationscited by 31
- 2021ProtAugment: Unsupervised diverse short-texts paraphrasing for intent detection meta-learningcited by 18
- 2021More Robust Dense Retrieval with Contrastive Dual Learningcited by 15
- 2022ELIAS: End-to-End Learning to Index and Search in Large Output Spacescited by 14
- 2024Towards Improved Proxy-based Deep Metric Learning via Data-Augmented Domain Adaptationcited by 9
- 2023PINA: Leveraging Side Information in eXtreme Multi-label Classification via Predicted Instance Neighborhood Aggregationcited by 7
- 2022Contrastive Learning with Prompt-derived Virtual Semantic Prototypes for Unsupervised Sentence Embeddingcited by 6
- 2022AdaTriplet: Adaptive Gradient Triplet Loss with Automatic Margin Learning for Forensic Medical Image Matchingcited by 3
- 2023A Multi-Granularity-Aware Aspect Learning Model for Multi-Aspect Dense Retrievalcited by 3
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.