English

Improving Detection of Rare Nodes in Hierarchical Multi-Label Learning

Machine Learning 2026-02-10 v1 Artificial Intelligence

Abstract

In hierarchical multi-label classification, a persistent challenge is enabling model predictions to reach deeper levels of the hierarchy for more detailed or fine-grained classifications. This difficulty partly arises from the natural rarity of certain classes (or hierarchical nodes) and the hierarchical constraint that ensures child nodes are almost always less frequent than their parents. To address this, we propose a weighted loss objective for neural networks that combines node-wise imbalance weighting with focal weighting components, the latter leveraging modern quantification of ensemble uncertainties. By emphasizing rare nodes rather than rare observations (data points), and focusing on uncertain nodes for each model output distribution during training, we observe improvements in recall by up to a factor of five on benchmark datasets, along with statistically significant gains in F1F_{1} score. We also show our approach aids convolutional networks on challenging tasks, as in situations with suboptimal encoders or limited data.

Keywords

Cite

@article{arxiv.2602.08986,
  title  = {Improving Detection of Rare Nodes in Hierarchical Multi-Label Learning},
  author = {Isaac Xu and Martin Gillis and Ayushi Sharma and Benjamin Misiuk and Craig J. Brown and Thomas Trappenberg},
  journal= {arXiv preprint arXiv:2602.08986},
  year   = {2026}
}

Comments

Accepted for publication in Transactions on Machine Learning Research (TMLR), 2026

R2 v1 2026-07-01T10:28:29.068Z