Abstract
The paper introduces a framework for studying structural risk minimization. The model views structural risk minimization in a PAC context. It then considers the more general case when the hierarchy of classes is chosen in response to the data. This theoretically explains the impressive performance of the maximal margin hyperplane algorithm of Vapnik. It may also provide a general technique for exploiting serendipitous simplicity in observed data to obtain better prediction accuracy from small training sets.
Cite
CITATION STYLE
Shawe-Taylor, J., Bartlett, P. L., Williamson, R. C., & Anthony, M. (1996). Framework for structural risk minimization. Proceedings of the Annual ACM Conference on Computational Learning Theory, 68–76. https://doi.org/10.1145/238061.238070
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.