On uniform definability of types over finite sets for NIP formulas
Preprint
Abstract
Combining two results from machine learning theory we prove that a formula is NIP if and only if it satisfies uniform definability of types over finite sets (UDTFS). This settles a conjecture of Laskowski.Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- Sample Compression Schemes for VC ClassesJournal of the ACM, 2016
- Externally definable sets and dependent pairs IITransactions of the American Mathematical Society, 2015
- On uniform definability of types over finite setsThe Journal of Symbolic Logic, 2012
- Compression Schemes, Stable Definable Families, and o-Minimal StructuresDiscrete & Computational Geometry, 2009