On the VC-dimension and boolean functions with long runs

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

The Vapnik-Chervonenkis (VC) dimension and the Sauer-Shelah lemma have found applications in numerous areas including set theory, combinatorial geometry, graph theory and statistical learning theory. Estimation of the complexity of discrete structures associated with the search space of algorithms often amounts to estimating the cardinality of a simpler class which is effectively induced by some restrictive property of the search. In this paper we study the complexity of Boolean-function classes of finite VC-dimension which satisfy a local ‘smoothness’ property expressed as having long runs of repeated values. As in Sauer’s lemma, a bound is obtained on the cardinality of such classes.

Original languageEnglish
Pages (from-to)205-225
Number of pages21
JournalJournal of Discrete Mathematical Sciences and Cryptography
Volume10
Issue number2
DOIs
StatePublished - 2007
Externally publishedYes

Keywords

  • Boolean functions
  • Poisson approximation
  • VC-dimension

Fingerprint

Dive into the research topics of 'On the VC-dimension and boolean functions with long runs'. Together they form a unique fingerprint.

Cite this