Mathematics – Combinatorics
Scientific paper
2010-07-28
Mathematics
Combinatorics
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.
Gottlieb Lee-Ad
Kontorovich
Leonid
Mossel Elchanan
No associations
LandOfFree
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.
Profile ID: LFWR-SCP-O-73812