Generalization Bounds for Some Ordinal Regression Algorithms
Abstract
The problem of ordinal regression, in which the goal is to learn a rule to predict labels from a discrete but ordered set, has gained considerable attention in machine learning in recent years. We study generalization properties of algorithms for this problem. We start with the most basic algorithms that work by learning a real-valued function in a regression framework and then rounding off a predicted real value to the closest discrete label; our most basic bounds for such algorithms are derived by relating the ordinal regression error of the resulting prediction rule to the regression error of the learned real-valued function. We end with a margin-based bound for the state-of-the-art ordinal regression algorithm of Chu & Keerthi (2007).
Cite
Text
Agarwal. "Generalization Bounds for Some Ordinal Regression Algorithms." International Conference on Algorithmic Learning Theory, 2008. doi:10.1007/978-3-540-87987-9_6Markdown
[Agarwal. "Generalization Bounds for Some Ordinal Regression Algorithms." International Conference on Algorithmic Learning Theory, 2008.](https://mlanthology.org/alt/2008/agarwal2008alt-generalization/) doi:10.1007/978-3-540-87987-9_6BibTeX
@inproceedings{agarwal2008alt-generalization,
title = {{Generalization Bounds for Some Ordinal Regression Algorithms}},
author = {Agarwal, Shivani},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {2008},
pages = {7-21},
doi = {10.1007/978-3-540-87987-9_6},
url = {https://mlanthology.org/alt/2008/agarwal2008alt-generalization/}
}