English

Embedding Semantic Hierarchy in Discrete Optimal Transport for Risk Minimization

Computer Vision and Pattern Recognition 2021-05-04 v1

Abstract

The widely-used cross-entropy (CE) loss-based deep networks achieved significant progress w.r.t. the classification accuracy. However, the CE loss can essentially ignore the risk of misclassification which is usually measured by the distance between the prediction and label in a semantic hierarchical tree. In this paper, we propose to incorporate the risk-aware inter-class correlation in a discrete optimal transport (DOT) training framework by configuring its ground distance matrix. The ground distance matrix can be pre-defined following a priori of hierarchical semantic risk. Specifically, we define the tree induced error (TIE) on a hierarchical semantic tree and extend it to its increasing function from the optimization perspective. The semantic similarity in each level of a tree is integrated with the information gain. We achieve promising results on several large scale image classification tasks with a semantic tree structure in a plug and play manner.

Keywords

Cite

@article{arxiv.2105.00101,
  title  = {Embedding Semantic Hierarchy in Discrete Optimal Transport for Risk Minimization},
  author = {Yubin Ge and Site Li and Xuyang Li and Fangfang Fan and Wanqing Xie and Jane You and Xiaofeng Liu},
  journal= {arXiv preprint arXiv:2105.00101},
  year   = {2021}
}

Comments

Accepted to IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP) 2021

R2 v1 2026-06-24T01:41:17.359Z