TY - JOUR
T1 - Constrained versions of Sauer's lemma
AU - Ratsaby, Joel
PY - 2008/7/28
Y1 - 2008/7/28
N2 - Let [n] = {1, ..., n}. For a function h : [n] → {0, 1}, x ∈ [n] and y ∈ {0, 1} define by the widthωh (x, y) of h at x the largest nonnegative integer a such that h (z) = y on x - a ≤ z ≤ x + a. We consider finite VC-dimension classes of functions h constrained to have a width ωh (xi, yi) which is larger than N for all points in a sample ζ = {(xi, yi)}1ℓ or a width no larger than N over the whole domain [n]. Extending Sauer's lemma, a tight upper bound with closed-form estimates is obtained on the cardinality of several such classes.
AB - Let [n] = {1, ..., n}. For a function h : [n] → {0, 1}, x ∈ [n] and y ∈ {0, 1} define by the widthωh (x, y) of h at x the largest nonnegative integer a such that h (z) = y on x - a ≤ z ≤ x + a. We consider finite VC-dimension classes of functions h constrained to have a width ωh (xi, yi) which is larger than N for all points in a sample ζ = {(xi, yi)}1ℓ or a width no larger than N over the whole domain [n]. Extending Sauer's lemma, a tight upper bound with closed-form estimates is obtained on the cardinality of several such classes.
KW - Binary functions
KW - Integer partitions
KW - Sauer's lemma
UR - http://www.scopus.com/inward/record.url?scp=50649095912&partnerID=8YFLogxK
U2 - 10.1016/j.dam.2007.11.017
DO - 10.1016/j.dam.2007.11.017
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:50649095912
SN - 0166-218X
VL - 156
SP - 2753
EP - 2767
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - 14
ER -