Pith. sign in

Deep Extreme Multi-label Learning

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Extreme multi-label learning (XML) or classification has been a practical and important problem since the boom of big data. The main challenge lies in the exponential label space which involves $2^L$ possible label sets especially when the label dimension $L$ is huge, e.g., in millions for Wikipedia labels. This paper is motivated to better explore the label space by originally establishing an explicit label graph. In the meanwhile, deep learning has been widely studied and used in various classification problems including multi-label classification, however it has not been properly introduced to XML, where the label space can be as large as in millions. In this paper, we propose a practical deep embedding method for extreme multi-label classification, which harvests the ideas of non-linear embedding and graph priors-based label space modeling simultaneously. Extensive experiments on public datasets for XML show that our method performs competitive against state-of-the-art result.

fields

cs.AI 1

years

2026 1

verdicts

CONDITIONAL 1

representative citing papers

Trie Automata for Constrained Decoding over Large Finite Sets

cs.AI · 2026-08-12 · conditional · novelty 6.0

A trie automaton with Aho-Corasick precomputed token masks makes finite-set constrained decoding near-constant per step, giving 7x faster masking and 29x higher vLLM batch throughput than XGrammar.

citing papers explorer

Showing 1 of 1 citing paper.

  • Trie Automata for Constrained Decoding over Large Finite Sets cs.AI · 2026-08-12 · conditional · none · ref 33 · internal anchor

    A trie automaton with Aho-Corasick precomputed token masks makes finite-set constrained decoding near-constant per step, giving 7x faster masking and 29x higher vLLM batch throughput than XGrammar.