Home Bookmarks Papers Blog

On generalization bounds, projection profile, and margin distribution

Ashutosh Garg, Sariel Har-Peled, and Dan Roth.


We study generalization properties of linear learning algorithms and develop a data dependent approach that is used to derive generalization bounds that depend on the margin distribution. Our method makes use of random projection techniques to allow the use of existing VC dimension bounds in the effective, lower, dimension of the data. Comparisons with existing generalization bound show that our bounds are tighter and meaningful in cases existing bounds are not.


To appear in ICML 2002.
Postscript, PDF


Last modified: Tue Jul 19 21:22:29 CDT 2011 Last updated: Thu Jun 21 13:58:32 CDT 2001