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.
Deep Extreme Multi-label Learning
1 Pith paper cite this work. Polarity classification is still indexing.
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 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Trie Automata for Constrained Decoding over Large Finite Sets
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.