Nearly Uniform Validation Improves Compression-Based Error Bounds

  • Authors:
  • Eric Bax

  • Affiliations:
  • -

  • Venue:
  • The Journal of Machine Learning Research
  • Year:
  • 2008
  • Validation of network classifiers

    SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper develops bounds on out-of-sample error rates for support vector machines (SVMs). The bounds are based on the numbers of support vectors in the SVMs rather than on VC dimension. The bounds developed here improve on support vector counting bounds derived using Littlestone and Warmuth's compression-based bounding technique.