Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.08986 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918328875876352 |
|---|---|
| author | Xu, Isaac Gillis, Martin Sharma, Ayushi Misiuk, Benjamin Brown, Craig J. Trappenberg, Thomas |
| author_facet | Xu, Isaac Gillis, Martin Sharma, Ayushi Misiuk, Benjamin Brown, Craig J. Trappenberg, Thomas |
| contents | 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 $F_{1}$ score. We also show our approach aids convolutional networks on challenging tasks, as in situations with suboptimal encoders or limited data. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_08986 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Improving Detection of Rare Nodes in Hierarchical Multi-Label Learning Xu, Isaac Gillis, Martin Sharma, Ayushi Misiuk, Benjamin Brown, Craig J. Trappenberg, Thomas Machine Learning Artificial Intelligence 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 $F_{1}$ score. We also show our approach aids convolutional networks on challenging tasks, as in situations with suboptimal encoders or limited data. |
| title | Improving Detection of Rare Nodes in Hierarchical Multi-Label Learning |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2602.08986 |