Papers › An Empirical Study on Large-Scale Multi-Label Text Classification Including Few and...

An Empirical Study on Large-Scale Multi-Label Text Classification Including Few and Zero-Shot Labels

4 Oct 2020EMNLP 2020 11arXiv:2010.01653archive 2025-07-28

Ilias Chalkidis, Manos Fergadiotis, Sotiris Kotitsas, Prodromos Malakasiotis, Nikolaos Aletras, Ion Androutsopoulos

Large-scale Multi-label Text Classification (LMTC) has a wide range of Natural Language Processing (NLP) applications and presents interesting challenges. First, not all labels are well represented in the training set, due to the very large label set and the skewed label distributions of LMTC datasets. Also, label hierarchies and differences in human labelling guidelines may affect graph-aware annotation proximity. Finally, the label hierarchies are periodically updated, requiring LMTC models capable of zero-shot generalization. Current state-of-the-art LMTC models employ Label-Wise Attention Networks (LWANs), which (1) typically treat LMTC as flat multi-label classification; (2) may use the label hierarchy to improve zero-shot learning, although this practice is vastly understudied; and (3) have not been combined with pre-trained Transformers (e.g. BERT), which have led to state-of-the-art results in several NLP benchmarks. Here, for the first time, we empirically evaluate a battery of LMTC methods from vanilla LWANs to hierarchical classification approaches and transfer learning, on frequent, few, and zero-shot learning on three datasets from different domains. We show that hierarchical methods based on Probabilistic Label Trees (PLTs) outperform LWANs. Furthermore, we show that Transformer-based approaches outperform the state-of-the-art in two of the datasets, and we propose a new state-of-the-art method which combines BERT with LWANs. Finally, we propose new models that leverage the label hierarchy to improve few and zero-shot learning, considering on each dataset a graph-aware annotation proximity measure that we introduce.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2010.01653")

Code

Syntology Ran 1 of 8 code samples harvested from 1 repository linked to this paper; 7 have no recorded run. Of those that ran: 1 ran · our draft was wrong.

By repository: official repository: 8 samples from 1 repository, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

iliaschalkidis/lmtc-eurlex57k officialtfApache-2.0 report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

8 samples harvested; 1 ran; 0 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
7unverified

Licence: 0 of the 8 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from iliaschalkidis/lmtc-eurlex57k. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

convert_to_unicode iliaschalkidis/lmtc-eurlex57k/neural_networks/layers/bert_tokenization.py official repository ran · our draft was wrong fingerprinted Apache-2.0 (permissive) · 1923fc05163d207d · report
dot_product iliaschalkidis/lmtc-eurlex57k/neural_networks/layers/attention.py official repository unverified Apache-2.0 (permissive) · bcf6da6d6b37e4d1 · report
load_vocab iliaschalkidis/lmtc-eurlex57k/neural_networks/layers/bert_tokenization.py official repository unverified Apache-2.0 (permissive) · ff83ccc8b0b6462d · report
mean_ndcg_score iliaschalkidis/lmtc-eurlex57k/metrics.py official repository unverified Apache-2.0 (permissive) · e38d16c8dc98d937 · report
mean_precision_k iliaschalkidis/lmtc-eurlex57k/metrics.py official repository unverified Apache-2.0 (permissive) · 3cc7db202885c138 · report
mean_recall_k iliaschalkidis/lmtc-eurlex57k/metrics.py official repository unverified Apache-2.0 (permissive) · c098f170b5b2019d · report
printable_text iliaschalkidis/lmtc-eurlex57k/neural_networks/layers/bert_tokenization.py official repository unverified Apache-2.0 (permissive) · 0e5615f8994003cf · report
tokenize_doc_en iliaschalkidis/lmtc-eurlex57k/spacy_tagger.py official repository unverified Apache-2.0 (permissive) · e08f3bf74e750d72 · report

Tasks

MUlTI-LABEL-ClASSIFICATIONMulti Label Text ClassificationMulti-Label ClassificationMulti-Label Text ClassificationText ClassificationTransfer LearningZero-Shot LearningZero-shot Generalizationtext-classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

AdamAttentionAttention DropoutBERTDense ConnectionsDropoutLayer NormalizationLinear LayerLinear Warmup With Linear DecayMulti-Head AttentionResidual ConnectionSoftmaxWeight DecayWordPiece

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections