Improving Deep Regression with Ordinal Entropy

Shihao Zhang, Linlin Yang, Michael Bi Mi, Xiaoxu Zheng, Angela Yao
1/21/2023
cs.CVcs.AIcs.LG

No official code found. Best implementation: needylove/OrdinalEntropy (54 stars, last commit 2023-09-15).

Abstract

In computer vision, it is often observed that formulating regression problems as a classification task often yields better performance. We investigate this curious phenomenon and provide a derivation to show that classification, with the cross-entropy loss, outperforms regression with a mean squared error loss in its ability to learn high-entropy feature representations. Based on the analysis, we propose an ordinal entropy loss to encourage higher-entropy feature spaces while maintaining ordinal relationships to improve the performance of regression tasks. Experiments on synthetic and real-world regression tasks demonstrate the importance and benefits of increasing entropy for regression.

View on arXivView PDF

Code Implementations(1)

The code of "Improving Deep Regression with Ordinal Entropy" in ICLR 2023

546PythonJan 21, 20233 years ago

Similar Papers

Cite this paper

@article{zhang2023improving,
  title  = {Improving Deep Regression with Ordinal Entropy},
  author = {Shihao Zhang and Linlin Yang and Michael Bi Mi and Xiaoxu Zheng and Angela Yao},
  year   = {2023},
  eprint = {2301.08915},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.08915v3},
  journal = {ICLR 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.08915.svg)](https://codeofpaper.com/paper/2301.08915)

Discussion