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.
Bibliographical notePublisher Copyright:
© 2021 World Scientific Publishing Company.
- Local UDTFS
- local NIP
- recursive teaching dimension
- sample compression schemes