mlsanityData to 7 Oct 2026

ELIAS: End-to-End Learning to Index and Search in Large Output Spaces

arXiv 2210.08410 ↗First posted 16 Oct 2022cs.LG cs.IRcited by 14

Not on the map. Why?

Abstract (arXiv)

Extreme multi-label classification (XMC) is a popular framework for solving many real-world problems that require accurate prediction from a very large number of potential output choices. A popular approach for dealing with the large label space is to arrange the labels into a shallow tree-based index and then learn an ML model to efficiently search this index via beam search. Existing methods initialize the tree index by clustering the label space into a few mutually exclusive clusters based on pre-defined features and keep it fixed throughout the training procedure. This approach results in a sub-optimal indexing structure over the label space and limits the search performance to the quality of choices made during the initialization of the index. In this paper, we propose a novel method ELIAS which relaxes the tree-based index to a specialized weighted graph-based index which is learned end-to-end with the final task objective. More specifically, ELIAS models the discrete cluster-to-label assignments in the existing tree-based index as soft learnable parameters that are learned jointly with the rest of the ML model. ELIAS achieves state-of-the-art performance on several large-scale extreme classification benchmarks with millions of labels. In particular, ELIAS can be up to 2.5% better at precision@1 and up to 4% better at recall@100 than existing XMC methods. A PyTorch implementation of ELIAS along with other resources is available at https://github.com/nilesh2797/ELIAS.

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

Builds on

18 of 39 references.

References · 18

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
  4. 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
  5. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
  6. 2022Transformer Memory as a Differentiable Search Indexcited by 242
  7. 2017The Case for Learned Index Structurescited by 188
  8. 2020Pre-training Tasks for Embedding-based Large-scale Retrievalcited by 153
  9. 2016DiSMEC - Distributed Sparse Machines for Extreme Multi-label Classificationcited by 70
  10. 2021Fast Multi-Resolution Transformer Fine-tuning for Extreme Multi-label Text Classificationcited by 66
  11. 2019Bonsai -- Diverse and Shallow Trees for Extreme Multi-label Classificationcited by 61
  12. 2021LightXML: Transformer with Dynamic Negative Sampling for High-Performance Extreme Multi-label Text Classificationcited by 61
6 more
  1. 2020PECOS: Prediction for Enormous and Correlated Output Spacescited by 50
  2. 2021DeepXML: A Deep Extreme Multi-Label Learning Framework Applied to Short Text Documentscited by 37
  3. 2022NGAME: Negative Mining-aware Mini-batching for Extreme Classificationcited by 32
  4. 2020Extreme Regression for Dynamic Search Advertisingcited by 9
  5. 2020Learned Indexes for a Google-scale Disk-based Databasecited by 9
  6. 2021Label Disentanglement in Partition-based Extreme Multilabel Classificationcited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 4; 2024: 6; 2025: 3; 2026: 1.

14 papers.

Sort:

By area: