mlsanityData to 14 Oct 2026

Dual-Encoders for Extreme Multi-Label Classification

arXiv 2310.10636 ↗First posted 16 Oct 2023cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Dual-encoder (DE) models are widely used in retrieval tasks, most commonly studied on open QA benchmarks that are often characterized by multi-class and limited training data. In contrast, their performance in multi-label and data-rich retrieval settings like extreme multi-label classification (XMC), remains under-explored. Current empirical evidence indicates that DE models fall significantly short on XMC benchmarks, where SOTA methods linearly scale the number of learnable parameters with the total number of classes (documents in the corpus) by employing per-class classification head. To this end, we first study and highlight that existing multi-label contrastive training losses are not appropriate for training DE models on XMC tasks. We propose decoupled softmax loss - a simple modification to the InfoNCE loss - that overcomes the limitations of existing contrastive losses. We further extend our loss design to a soft top-k operator-based loss which is tailored to optimize top-k prediction performance. When trained with our proposed loss functions, standard DE models alone can match or outperform SOTA methods by up to 2% at Precision@1 even on the largest XMC datasets while being 20x smaller in terms of the number of trainable parameters. This leads to more parameter-efficient and universally applicable solutions for retrieval tasks. Our code and models are publicly available at https://github.com/nilesh2797/dexml.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 39 of its 68 references that are in the map. First posted on arXiv 16 Oct 2023.

Builds on

39 of 68 references.

References · 39

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,297
  3. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  4. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
  5. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
  6. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
  7. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
  8. 2017Billion-scale similarity search with GPUscited by 2,497
  9. 2016Bag of Tricks for Efficient Text Classificationcited by 876
  10. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 849
  11. 2019Latent Retrieval for Weakly Supervised Open Domain Question Answeringcited by 695
  12. 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 413
27 more
  1. 2017Efficient Natural Language Response Suggestion for Smart Replycited by 229
  2. 2020Sparse, Dense, and Attentional Representations for Text Retrievalcited by 214
  3. 2021Scaling Deep Contrastive Learning Batch Size under Memory Limited Setupcited by 127
  4. 2018AttentionXML: Label Tree-based Attention-Aware Deep Model for High-Performance Extreme Multi-Label Text Classificationcited by 102
  5. 2016DiSMEC - Distributed Sparse Machines for Extreme Multi-label Classificationcited by 71
  6. 2021Fast Multi-Resolution Transformer Fine-tuning for Extreme Multi-label Text Classificationcited by 67
  7. 2021LightXML: Transformer with Dynamic Negative Sampling for High-Performance Extreme Multi-label Text Classificationcited by 61
  8. 2020PECOS: Prediction for Enormous and Correlated Output Spacescited by 50
  9. 2018Smooth Loss Functions for Deep Top-k Classificationcited by 46
  10. 2017Improving Pairwise Ranking for Multi-label Image Classificationcited by 40
  11. 2015Loss Functions for Top-k Error: Analysis and Insightscited by 38
  12. 2017Adaptive Sampled Softmax with Kernel Based Samplingcited by 38
  13. 2021ECLARE: Extreme Classification with Label Graph Correlationscited by 38
  14. 2019Extreme Classification in Log Memory using Count-Min Sketch: A Case Study of Amazon Search with 50M Productscited by 36
  15. 2019On the Consistency of Top-k Surrogate Lossescited by 35
  16. 2019Sampled Softmax with Random Fourier Featurescited by 33
  17. 2021DECAF: Deep Extreme Classification with Label Featurescited by 33
  18. 2022NGAME: Negative Mining-aware Mini-batching for Extreme Classificationcited by 32
  19. 2018Stochastic Negative Mining for Learning with Large Output Spacescited by 29
  20. 2020Pretrained Generalized Autoregressive Model with Adaptive Probabilistic Label Clusters for Extreme Multi-label Text Classificationcited by 25
  21. 2017Deep Extreme Multi-label Learningcited by 24
  22. 2022Differentiable Top-k Classification Learningcited by 21
  23. 2022ZLPR: A Novel Loss for Multi-label Classificationcited by 16
  24. 2022ELIAS: End-to-End Learning to Index and Search in Large Output Spacescited by 14
  25. 2016Simultaneous Learning of Trees and Representations for Extreme Classification and Density Estimationcited by 10
  26. 2015Surrogate Functions for Maximizing Precision at the Topcited by 7
  27. 2023Multi-modal Extreme Classificationcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 4; 2025: 1; 2026: 2.

7 papers.