mlsanityData to 7 Oct 2026

Remarks on Loss Function of Threshold Method for Ordinal Regression Problem

arXiv 2405.13288 ↗First posted 22 May 2024cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Threshold methods are popular for ordinal regression problems, which are classification problems for data with a natural ordinal relation. They learn a one-dimensional transformation (1DT) of observations of the explanatory variable, and then assign label predictions to the observations by thresholding their 1DT values. In this paper, we study the influence of the underlying data distribution and of the learning procedure of the 1DT on the classification performance of the threshold method via theoretical considerations and numerical experiments. Consequently, for example, we found that threshold methods based on typical learning procedures may perform poorly when the probability distribution of the target variable conditioned on an observation of the explanatory variable tends to be non-unimodal. Another instance of our findings is that learned 1DT values are concentrated at a few points under the learning procedure based on a piecewise-linear loss function, which can make difficult to classify data well.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 5 of its 41 references that are in the map. First posted on arXiv 22 May 2024.

Builds on

5 of 41 references.

References · 5

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2019Rank consistent ordinal regression for neural networks with application to age estimationcited by 132
  3. 2017Unimodal probability distributions for deep ordinal classificationcited by 28
  4. 2014On the Consistency of Ordinal Regression Methodscited by 24
  5. 2024Parallel Algorithm for Optimal Threshold Labeling of Ordinal Regression Methodscited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.