VC bounds on the cardinality of nearly orthogonal function classes

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages

Scientific paper

We bound the number of nearly orthogonal vectors with fixed VC-dimension over $\setpm^n$. Our bounds are of interest in machine learning and empirical process theory and improve previous bounds by Haussler. The bounds are based on a simple projection argument and the generalize to other product spaces. Along the way we derive tight bounds on the sum of binomial coefficients in terms of the entropy function.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

VC bounds on the cardinality of nearly orthogonal function classes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with VC bounds on the cardinality of nearly orthogonal function classes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and VC bounds on the cardinality of nearly orthogonal function classes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-73812

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.