Show simple item record

Definable families of finite Vapnik Chervonenkis dimension

dc.contributor.advisorLaskowski, Michael Cen_US
dc.contributor.authorJohnson, Hunter Ren_US
dc.description.abstractVapnik Chervonenkis dimension is a basic combinatorial notion with applications in machine learning, stability theory, and statistics. We explore what effect model theoretic structure has on the VC dimension of formulas, considered as parameterized families of sets, with respect to long disjunctions and conjunctions. If the growth in VC dimension is linear in the number of disjunctions, then the theory under consideration has a certain kind of good structure. We have found a general class of theories in which this structure obtains, as well as situations where it fails. We relate ``compression schemes'' of computational learning theory to model theoretic type definitions, and explore the model theoretic implications. All stable definable families are shown to have finite compression schemes, with specific bounds in the case of NFCP theories. Notions of maximality in VC classes are discussed, and classified according to their first order properties. While maximum classes can be characterized in first-order logic, maximal classes can noten_US
dc.format.extent520453 bytes
dc.titleDefinable families of finite Vapnik Chervonenkis dimensionen_US
dc.contributor.publisherDigital Repository at the University of Marylanden_US
dc.contributor.publisherUniversity of Maryland (College Park, Md.)en_US
dc.subject.pqcontrolledComputer Scienceen_US
dc.subject.pquncontrolledVC dimensionen_US
dc.subject.pquncontrolledmodel theory;Vapnik Chervonenkis dimensionen_US
dc.subject.pquncontrolledIndependence dimensionen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record