In this article we introduce a new combinatorial parameter which generalizes the VC dimension and the fat-shattering dimension, and extends beyond the function-class setup. Using this parameter we establish entropy bounds for subsets of the n-dimensional unit cube, and in particular, we present new bounds on the empirical covering numbers and gaussian averages associated with classes of functions in terms of the fat-shattering dimension.
CITATION STYLE
Mendelson, S., & Vershynin, R. (2002). Entropy, combinatorial dimensions and random averages. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2375, pp. 14–28). Springer Verlag. https://doi.org/10.1007/3-540-45435-7_2
Mendeley helps you to discover research relevant for your work.