On uniform definability of types over finite sets for NIP formulas

Shlomo Eshel; Itay Kaplan

doi:10.1142/S021906132150015X

On uniform definability of types over finite sets for NIP formulas

Shlomo Eshel
, Itay Kaplan^*

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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.

Original language	English
Article number	2150015
Journal	Journal of Mathematical Logic
Volume	21
Issue number	3
DOIs	https://doi.org/10.1142/S021906132150015X
State	Published - 1 Dec 2021

Bibliographical note

Publisher Copyright:
© 2021 World Scientific Publishing Company.

Keywords

Local UDTFS
local NIP
recursive teaching dimension
sample compression schemes

Access to Document

10.1142/S021906132150015X

Cite this

@article{03a42793b3e14139b5297a06a6970017,

title = "On uniform definability of types over finite sets for NIP formulas",

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 = "Local UDTFS, local NIP, recursive teaching dimension, sample compression schemes",

author = "Shlomo Eshel and Itay Kaplan",

note = "Publisher Copyright: {\textcopyright} 2021 World Scientific Publishing Company.",

year = "2021",

month = dec,

day = "1",

doi = "10.1142/S021906132150015X",

language = "אנגלית",

volume = "21",

journal = "Journal of Mathematical Logic",

issn = "0219-0613",

publisher = "World Scientific Publishing Co. Pte Ltd",

number = "3",

}

TY - JOUR

T1 - On uniform definability of types over finite sets for NIP formulas

AU - Eshel, Shlomo

AU - Kaplan, Itay

PY - 2021/12/1

Y1 - 2021/12/1

N2 - 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.

AB - 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.

KW - Local UDTFS

KW - local NIP

KW - recursive teaching dimension

KW - sample compression schemes

UR - https://www.scopus.com/pages/publications/85098937677

U2 - 10.1142/S021906132150015X

DO - 10.1142/S021906132150015X

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85098937677

SN - 0219-0613

VL - 21

JO - Journal of Mathematical Logic

JF - Journal of Mathematical Logic

IS - 3

M1 - 2150015

ER -

On uniform definability of types over finite sets for NIP formulas

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this