THOR: Threshold-Based Ranking Loss for Ordinal Regression
Not on the map. Why?
Abstract (arXiv)
In this work, we present a regression-based ordinal regression algorithm for supervised classification of instances into ordinal categories. In contrast to previous methods, in this work the decision boundaries between categories are predefined, and the algorithm learns to project the input examples onto their appropriate scores according to these predefined boundaries. This is achieved by adding a novel threshold-based pairwise loss function that aims at minimizing the regression error, which in turn minimizes the Mean Absolute Error (MAE) measure. We implemented our proposed architecture-agnostic method using the CNN-framework for feature extraction. Experimental results on five real-world benchmarks demonstrate that the proposed algorithm achieves the best MAE results compared to state-of-the-art ordinal regression algorithms.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 19 references that are in the map. First posted on arXiv 10 May 2022.
Builds on
4 of 19 references.
References · 4
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2018Deep Ordinal Regression Network for Monocular Depth Estimationcited by 723
- 2017Age Progression/Regression by Conditional Adversarial Autoencodercited by 429
- 2020Convolutional Ordinal Regression Forest for Image Ordinal Estimationcited by 1
Built on by
Not cited yet.