Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Remarks on Loss Function of Threshold Method for Ordinal Regression Problem (2405.13288v1)

Published 22 May 2024 in cs.LG

Abstract: 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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. A. Agresti. Analysis of Ordinal Categorical Data, volume 656. John Wiley & Sons, 2nd edition, 2010.
  2. Convexity, classification, and risk bounds. Journal of the American Statistical Association, 101(473):138–156, 2006.
  3. C. Beckham and C. Pal. Unimodal probability distributions for deep ordinal classification. In Proceedings of the International Conference on Machine Learning, pages 411–419, 2017.
  4. P.-C. Bürkner and M. Vuorre. Ordinal regression models in psychology: A tutorial. Advances in Methods and Practices in Psychological Science, 2(1):77–101, 2019.
  5. Rank consistent ordinal regression for neural networks with application to age estimation. Pattern Recognition Letters, 140:325–331, 2020.
  6. Cross-age reference coding for age-invariant face recognition and retrieval. In Proceedings of the European Conference on Computer Vision, pages 768–783, 2014.
  7. W. Chu and Z. Ghahramani. Gaussian processes for ordinal regression. Journal of Machine Learning Research, 6(Jul):1019–1041, 2005.
  8. W. Chu and S. S. Keerthi. New approaches to support vector ordinal regression. In Proceedings of the International Conference on Machine Learning, pages 145–152, 2005.
  9. W. Chu and S. S. Keerthi. Support vector ordinal regression. Neural Computation, 19(3):792–815, 2007.
  10. J. Cohen. A coefficient of agreement for nominal scales. Educational and Psychological Measurement, 20(1):37–46, 1960.
  11. J. Cohen. Weighted kappa: nominal scale agreement provision for scaled disagreement or partial credit. Psychological Bulletin, 70(4):213, 1968.
  12. C. Cortes and V. Vapnik. Support-vector networks. Machine Learning, 20:273–297, 1995.
  13. K. Crammer and Y. Singer. Pranking with ranking. In Advances in Neural Information Processing Systems, pages 641–647, 2002.
  14. The unimodal model for the classification of ordinal data. Neural Networks, 21(1):78–91, 2008.
  15. P. H. Franses and R. Paap. Quantitative Models in Marketing Research. Cambridge University Press, 2001.
  16. Ordinal regression methods: survey and experimental study. IEEE Transactions on Knowledge and Data Engineering, 28(1):127–146, 2015.
  17. Deep residual learning for image recognition. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 770–778, 2016.
  18. L. Li and H.-T. Lin. Ordinal regression by extended binary classification. In Advances in Neural Information Processing Systems, pages 865–872, 2007.
  19. H.-T. Lin and L. Li. Large-margin thresholded ensembles for ordinal regression: Theory and practice. In Algorithmic Learning Theory, pages 319–333, 2006.
  20. H.-T. Lin and L. Li. Reduction from cost-sensitive ordinal ranking to weighted binary classification. Neural Computation, 24(5):1329–1367, 2012.
  21. T.-Y. Liu. Learning to Rank for Information Retrieval. Springer Science & Business Media, 2011.
  22. Y. Liu. Fisher consistency of multicategory support vector machines. In Proceedings of the International Conference on Artificial Intelligence and Statistics, pages 291–298, 2007.
  23. P. McCullagh. Regression models for ordinal data. Journal of the Royal Statistical Society: Series B (Methodological), 42(2):109–127, 1980.
  24. Ordinal regression with multiple output cnn for age estimation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 4920–4928, 2016.
  25. On the consistency of ordinal regression methods. Journal of Machine Learning Research, 18(Jan):1769–1803, 2017.
  26. Feature relevance determination for ordinal regression in the context of feature redundancies and privileged information. Neurocomputing, 416:266–279, 2020.
  27. Cost-sensitive multiclass classification risk bounds. In Proceedings of the International Conference on Machine Learning, pages 1391–1399, 2013.
  28. J. D. Rennie and N. Srebro. Loss functions for preference levels: Regression with discrete ordered labels. In Proceedings of the IJCAI Multidisciplinary Workshop on Advances in Preference Handling, pages 180–186, 2005.
  29. K. Ricanek and T. Tesafaye. Morph: A longitudinal image database of normal adult age-progression. In Proceedings of the IEEE International Conference on Automatic Face and Gesture Recognition, pages 341–345, 2006.
  30. 300 faces in-the-wild challenge: Database and results. Image and Vision Computing, 47:3–18, 2016.
  31. S. Shalev-Shwartz and S. Ben-David. Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, 2014.
  32. A. Shashua and A. Levin. Taxonomy of large margin principle algorithms for ordinal regression problems. In Advances in Neural Information Processing Systems, pages 937–944, 2002.
  33. A. Shashua and A. Levin. Ranking with large margin principle: Two approaches. In Advances in Neural Information Processing Systems, pages 961–968, 2003.
  34. A. Tewari and P. L. Bartlett. On the consistency of multiclass classification methods. Journal of Machine Learning Research, 8(May):1007–1025, 2007.
  35. R. Yamasaki. Unimodal likelihood models for ordinal data. Transactions on Machine Learning Research, 2022. URL https://openreview.net/forum?id=1l0sClLiPc.
  36. R. Yamasaki. Optimal threshold labeling for ordinal regression methods. Transactions on Machine Learning Research, 2023. URL https://openreview.net/forum?id=mHSAy1n65Z.
  37. R. Yamasaki and T. Tanaka. Parallel algorithm for optimal threshold labeling of ordinal regression methods. arXiv preprint arXiv:2405.12756v1, 2024.
  38. Collaborative ordinal regression. In Proceedings of the International Conference on Machine Learning, pages 1089–1096, 2006.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets